A New Metaheuristic for the Vehicle Routing Problem with Split Demands
In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.
KeywordsFeasible Solution Tabu Search Vehicle Route Problem Tabu Search Procedure Tabu Search Method
Unable to display preview. Download preview PDF.
- 2.Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. To appear in Transportation ScienceGoogle Scholar
- 3.Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: To Split or Not to Split: That is the Question. To appear in Transportation ResearchGoogle Scholar
- 4.Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Working paperGoogle Scholar
- 6.Clarke, G., Wright, J.V.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)Google Scholar
- 13.Laguna, M., Martí, R.: Scatter Search - Methodology and implementations in C. Kluwer Academic Publishers, Boston (2003)Google Scholar
- 17.Wasil, E., Golden, B., Chen, S.: The Split Delivery Vehicle Routing Problem: Applications, algorithms, test problems and computational results. Presented at EURO, Iceland (2006)Google Scholar