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

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

Joseph Gallart Suárez
  • Function : Author
Engineering department
Manuel Tupia Anticona
  • Function : Author
Engineering department

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.

Domains

Digital Libraries [cs.DL]
Fichier principal
Vignette du fichier
IFIP-Gallart.pdf (224.5 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Hal Ifip  : Connect in order to contact the contributor

https://inria.hal.science/hal-01054588

Submitted on : Thursday, August 7, 2014-3:24:35 PM

Last modification on : Friday, September 9, 2022-2:46:06 PM

Long-term archiving on : Wednesday, November 26, 2014-1:46:53 AM

Download

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

IFIP IFIP-AICT IFIP-AICT-331 IFIP-TC IFIP-TC12 IFIP-AI IFIP-WCC
258 View
1288 Download

Altmetric

Share

More