Solving the Capacitated Vehicle Routing Problem and the Split Delivery using GRASP Metaheuristic

Abstract : This paper presents two GRASP metaheuristic algorithms for the vehicle routing problem, considering the capacity and shared demand of the customers. In this paper the solution obtained is compared with a greedy solution and two hybrid solutions (greedy and random). The results obtained show that the GRASP algorithm obtains a better quality solution for this kind of problem.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01054588
Contributor : Hal Ifip <>
Submitted on : Thursday, August 7, 2014 - 3:24:35 PM
Last modification on : Friday, August 11, 2017 - 11:17:28 AM
Document(s) archivé(s) le : Wednesday, November 26, 2014 - 1:46:53 AM

File

IFIP-Gallart.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Joseph Gallart Suárez, Manuel Tupia Anticona. Solving the Capacitated Vehicle Routing Problem and the Split Delivery using GRASP Metaheuristic. Third IFIP TC12 International Conference on Artificial Intelligence (AI) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.243-249, ⟨10.1007/978-3-642-15286-3_25⟩. ⟨hal-01054588⟩

Share

Metrics

Record views

670

Files downloads

983