A three-stage hybrid heuristic algorithm for the capacitated vehicle routing problem. (c2016)

LAUR Repository

Show simple item record

dc.contributor.author Kfoury, Muhib S.
dc.date.accessioned 2017-03-09T09:42:01Z
dc.date.available 2017-03-09T09:42:01Z
dc.date.copyright 2016 en_US
dc.date.issued 2017-03-09
dc.date.submitted 2016-12-09
dc.identifier.uri http://hdl.handle.net/10725/5342
dc.description.abstract In the Vehicle Routing Problem (VRP) we are given a set of demands that need to be delivered to a specified list of customers, and we are asked to assign vehicles to deliver the demands so that the corresponding cost of routes is minimized. The problem received great attention due to its many applications in various fields such as logistics and transportation. Different types of the VRP have been proposed such as the Capacitated Vehicle Routing Problem (CVRP), where a designated single depot contains identical vehicles and the objective is to minimize the number of vehicles and the time taken for delivery, provided the total demand of supplies per vehicle does not exceed its capacity. CVRP is a well-known NP-complete problem. We consider heuristic methods that are based on two-phase algorithms. Each such algorithm starts by clustering the underlining network before proceeding into the route construction phase. We propose a three-stage hybrid heuristic approach consisting of a mixture of five algorithms that are run in parallel, differing only in the clustering stage. Experimental results on different benchmark datasets show that the proposed hybrid algorithm can outperform other existing heuristic methods, both in terms of number of vehicles and total distances traveled. In some cases, our algorithm found solutions that are better than the current best-known results, thereby breaking the records reported for some of the well-known benchmarks. en_US
dc.language.iso en en_US
dc.subject Dissertations, Academic en_US
dc.subject Lebanese American University -- Dissertations en_US
dc.subject Vehicle routing problem en_US
dc.title A three-stage hybrid heuristic algorithm for the capacitated vehicle routing problem. (c2016) en_US
dc.type Thesis en_US
dc.term.submitted Fall en_US
dc.author.degree MS in Computer Science en_US
dc.author.school SAS en_US
dc.author.idnumber 201004742 en_US
dc.author.commembers Mansour, Nashat
dc.author.commembers Kassar, Abdul-Nasser
dc.author.department Computer Science and Mathematics en_US
dc.description.embargo N/A en_US
dc.description.physdesc 1 hard copy: xii, 66 leaves; 31 cm. available at RNL. en_US
dc.author.advisor Abu-Khzam, Faisal
dc.keywords Vehicle Routing Problem en_US
dc.keywords Heuristic Algorithm en_US
dc.keywords Cluster-First Route-Second en_US
dc.keywords CVRP en_US
dc.keywords Hybrid Algorithm en_US
dc.keywords Parallel en_US
dc.description.bibliographiccitations Bibliography : leaves 63-66. en_US
dc.identifier.doi https://doi.org/10.26756/th.2016.38 en_US
dc.author.email muhib.kfoury@lau.edu en_US
dc.identifier.tou http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php en_US
dc.publisher.institution Lebanese American University en_US
dc.author.affiliation Lebanese American University en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR

Advanced Search


My Account