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.
Type de document :
Communication dans un congrès
Max Bramer. Third IFIP TC12 International Conference on Artificial Intelligence (AI) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. Springer, IFIP Advances in Information and Communication Technology, AICT-331, pp.243-249, 2010, Artificial Intelligence in Theory and Practice III. 〈10.1007/978-3-642-15286-3_25〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01054588
Contributeur : Hal Ifip <>
Soumis le : jeudi 7 août 2014 - 15:24:35
Dernière modification le : vendredi 11 août 2017 - 11:17:28
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 01:46:53

Fichier

IFIP-Gallart.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Joseph Gallart Suárez, Manuel Tupia Anticona. Solving the Capacitated Vehicle Routing Problem and the Split Delivery using GRASP Metaheuristic. Max Bramer. Third IFIP TC12 International Conference on Artificial Intelligence (AI) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. Springer, IFIP Advances in Information and Communication Technology, AICT-331, pp.243-249, 2010, Artificial Intelligence in Theory and Practice III. 〈10.1007/978-3-642-15286-3_25〉. 〈hal-01054588〉

Partager

Métriques

Consultations de la notice

529

Téléchargements de fichiers

646