Solving the Capacitated Vehicle Routing Problem and the Split Delivery using GRASP Metaheuristic - Artificial Intelligence in Theory and Practice III Access content directly
Conference Papers Year : 2010

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.
Fichier principal
Vignette du fichier
IFIP-Gallart.pdf (239.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01054588 , version 1 (07-08-2014)

Licence

Attribution

Identifiers

Cite

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⟩
232 View
1232 Download

Altmetric

Share

Gmail Facebook X LinkedIn More