Solving the Capacitated Vehicle Routing Problem and the Split Delivery using GRASP Metaheuristic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

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

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Licence

Paternité

Identifiants

Citer

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 Consultations
1235 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More