Title
Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic
Date Issued
01 January 2010
Access level
open access
Resource Type
conference paper
Author(s)
Publisher(s)
Springer New York LLC
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. © 2010 IFIP.
Start page
243
End page
249
Volume
331 AICT
Language
English
OCDE Knowledge area
Ciencias de la información
Subjects
Scopus EID
2-s2.0-77957090029
Resource of which it is part
IFIP Advances in Information and Communication Technology
ISBN of the container
978-364215285-6
Conference
Artificial Intelligence in Theory and Practice III
Sources of information:
Directorio de Producción Científica
Scopus