Skip to main content
Conference ProceedingsOPEN ACCESS

Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic

IFIP Advances in Information and Communication Technology (2010) 331 AICT 243-249
DOI: 10.1007/978-3-642-15286-3_25
3Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Suárez, J. G., & Anticona, M. T. (2010). Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic. In IFIP Advances in Information and Communication Technology (Vol. 331 AICT, pp. 243–249). Springer New York LLC. https://doi.org/10.1007/978-3-642-15286-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free