An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem

Claudia Archetti (), M. Grazia Speranza () and Martin W. P. Savelsbergh ()
Additional contact information
Claudia Archetti: Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy
M. Grazia Speranza: Department of Quantitative Methods, University of Brescia, 25122 Brescia, Italy
Martin W. P. Savelsbergh: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332

Transportation Science, 2008, vol. 42, issue 1, 22-31

Abstract: The split delivery vehicle routing problem is concerned with serving the demand of a set of customers with a fleet of capacitated vehicles at minimum cost. Contrary to what is assumed in the classical vehicle routing problem, a customer can be served by more than one vehicle, if convenient. We present a solution approach that integrates heuristic search with optimization by using an integer program to explore promising parts of the search space identified by a tabu search heuristic. Computational results show that the method improves the solution of the tabu search in all but one instance of a large test set.

Keywords: vehicle routing; split delivery; tabu search; integer programming (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (38)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1070.0204 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:42:y:2008:i:1:p:22-31

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().