Advertisement

A New Metaheuristic for the Vehicle Routing Problem with Split Demands

  • Enrique Mota
  • Vicente Campos
  • Ángel Corberán
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)

Abstract

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.

Keywords

Feasible Solution Tabu Search Vehicle Route Problem Tabu Search Procedure Tabu Search Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science 39, 182–187 (2005)CrossRefGoogle Scholar
  2. 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. 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. 4.
    Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Working paperGoogle Scholar
  5. 5.
    Belenguer, J.M., Martínez, M.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Operations Research 48, 801–810 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 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
  7. 7.
    Dror, M., Laporte, G., Trudeau, P.: Vehicle Routing with Split Deliveries. Discrete Applied Mathematics 50, 239–254 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Dror, M., Trudeau, P.: Savings by split delivery routing. Transportation Science 23, 141–145 (1989)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Dror, M., Trudeau, P.: Split Delivery Routing. Naval Research Logistics 37, 383–402 (1990)zbMATHMathSciNetGoogle Scholar
  10. 10.
    Frizzell, P.W., Giffin, J.W.: The split delivery vehicle routing problem with time windows and grid network distances. Computers and Operations Research 22, 655–667 (1995)zbMATHCrossRefGoogle Scholar
  11. 11.
    Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276–1290 (1994)zbMATHGoogle Scholar
  12. 12.
    Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution. LNCS, vol. 1363, p. 1354. Springer, Berlin Heidelberg New York (1998)CrossRefGoogle Scholar
  13. 13.
    Laguna, M., Martí, R.: Scatter Search - Methodology and implementations in C. Kluwer Academic Publishers, Boston (2003)Google Scholar
  14. 14.
    Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the travelling salesman problem. Operations Research 21, 498–516 (1973)zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routing in livestock feed distribution. Journal of the Operational Research Society 48, 107–116 (1997)zbMATHCrossRefGoogle Scholar
  16. 16.
    Sierksma, G., Tijssen, G.A.: Routing helicopters for crew exchanges on off-shore locations. Annals of Operations Research 76, 261–286 (1998)zbMATHCrossRefGoogle Scholar
  17. 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

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Enrique Mota
    • 1
  • Vicente Campos
    • 1
  • Ángel Corberán
    • 1
  1. 1.Dep. Estasdística i Investigació Operativa. Universitat de València.Spain

Personalised recommendations