TY - GEN
T1 - Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic
AU - Suárez, Joseph Gallart
AU - Anticona, Manuel Tupia
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - Capacitated Vehicle Routing Problem
KW - GRASP
KW - Metaheuristic
KW - Split Delivery Vehicle Routing Problem
UR - http://www.scopus.com/inward/record.url?scp=77957090029&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15286-3_25
DO - 10.1007/978-3-642-15286-3_25
M3 - Conference contribution
AN - SCOPUS:77957090029
SN - 3642152856
SN - 9783642152856
T3 - IFIP Advances in Information and Communication Technology
SP - 243
EP - 249
BT - Artificial Intelligence in Theory and Practice III - Third IFIP TC 12 International Conference on Artificial Intelligence, IFIP AI 2010, Held as Part of WCC 2010, Proceedings
A2 - Bramer, Max
PB - Springer New York LLC
ER -