Skip to main content
SpringerLink
Log in

The Split Delivery Vehicle Routing Problem: A Survey

  • Chapter
The Vehicle Routing Problem: Latest Advances and New Challenges

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 43))

Summary

In the classical Vehicle Routing Problem (VRP) a fleet of capacitated vehicles is available to serve a set of customers with known demand. Each customer is required to be visited by exactly one vehicle and the objective is to minimize the total distance traveled. In the Split Delivery Vehicle Routing Problem (SDVRP) the restriction that each customer has to be visited exactly once is removed, i.e., split deliveries are allowed. In this chapter we present a survey of the state-of-the-art on the SDVRP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Archetti, A. Hertz, M.G. Speranza. A tabu search algorithm for the split delivery vehicle routing problem.Transportation Science, 40: 64-73, 2006.

    Article  Google Scholar 

  2. C. Archetti, R. Mansini, M.G. Speranza. Complexity and reducibility of the skip delivery problem.Transportation Science, 39: 182-187, 2005.

    Article  Google Scholar 

  3. C. Archetti, M.W.P. Savelsbergh, M.G. Speranza. Worst-case analysis for split delivery vehicle routing problems.Transportation Science, 40: 226-234, 2006.

    Article  Google Scholar 

  4. C. Archetti, M.W.P. Savelsbergh, M.G. Speranza. To split or not to split: That is the question. To appear inTransportation Research E.

    Google Scholar 

  5. C. Archetti, M.W.P. Savelsbergh, M.G. Speranza. An optimization-based heuristic for the split delivery vehicle routing problem. To appear inTransportation Science.

    Google Scholar 

  6. C. Archetti, M.G. Speranza. Vehicle routing in the 1-skip collection problem.Journal of the Operational Research Society, 55: 717-727, 2004.

    Article  Google Scholar 

  7. M. Ball, L. Bodin, R. Baldacci, A. Mingozzi. The rollon-rolloff vehicle routing problem.Transportation Science, 34: 271-288, 2000.

    Article  Google Scholar 

  8. J.M. Belenguer, M.C. Martinez, E. Mota. A lower bound for the split delivery vehicle routing problem.Operations Research, 48: 801-810, 2000.

    Article  Google Scholar 

  9. S. Chen, B. Golden, E. Wasil. The split delivery vehicle routing problem: Applications, test problems, and computational results.Networks, 49: 318-329, 2007.

    Article  Google Scholar 

  10. L. De Meulemeester, G. Laporte, F.V. Louveaux, F. Semet. Optimal sequencing of skip collections and deliveries.Journal of the Operational Research Society, 48: 57-64, 1997.

    Article  Google Scholar 

  11. M. Dror, L. Levy. A vehicle routing improvement algorithm: comparison of a ‘‘greedy’’ and a matching implementation for inventory routing.Computers & Operations Research, 13: 33–45, 1986.

    Article  Google Scholar 

  12. M. Dror, G. Laporte, P. Trudeau. Vehicle routing with split deliveries.Discrete Applied Mathematics, 50: 239-254, 1994.

    Article  Google Scholar 

  13. M. Dror, P. Trudeau. Savings by split delivery routing.Transportation Science, 23: 141-145, 1989.

    Article  Google Scholar 

  14. M. Dror, P. Trudeau. Split delivery routing.Naval Research Logistics, 37: 383-402, 1990.

    Google Scholar 

  15. D. Feillet, P. Dejax, M. Gendreau, C. Gueguen. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems.Networks, 44: 216–229, 2004.

    Article  Google Scholar 

  16. P.W. Frizzell, J.W. Giffin. The split delivery vehicle scheduling problem with time windows and grid network distances.Computers & Operations Research, 22: 655-667, 1995.

    Article  Google Scholar 

  17. M. Gendreau, P. Dejax, D. Feillet, C. Gueguen. Vehicle routing with time windows and split deliveries. Working paper.

    Google Scholar 

  18. M. Gendreau, A. Hertz, G. Laporte. New insertion and postoptimization procedures for the traveling salesman problem.Operations Research, 40: 1086–1094, 1992.

    Google Scholar 

  19. C. Gueguen.Méthodes de résolution exacte pour les problèmes de tournées de véhicules. PhD thesis, École Centrale Paris, 1999.

    Google Scholar 

  20. M. Jin, K. Liu, R.O. Bowden. A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem.International Journal of Production Economics, 105: 228–242, 2007.

    Article  Google Scholar 

  21. C.G. Lee, M.A. Epelman, C.C. White III, Y.A. Bozer. A shortest path approach to the multiple-vehicle routing problem with split pick-ups.Transportation Research B, 40: 265–284, 2006.

    Article  Google Scholar 

  22. S. Lin. Computer solutions of the traveling salesman problem.Bell System Technical Journal, 44: 2245–2269, 1965.

    Google Scholar 

  23. K. LiuA study on the split delivery vehicle routing problem. PhD thesis, Mississippi State University, 2005.

    Google Scholar 

  24. E. Mota, V. Campos, A. Corbéran. A new metaheuristic for the vehicle routing problem with split demands. Working paper.

    Google Scholar 

  25. P.A. Mullaseril, M. Dror, J. Leung. Split-delivery routing in livestock feed distribution.Journal of the Operational Research Society, 48: 107-116, 1997.

    Article  Google Scholar 

  26. M.A. Nowak.The pickup and delivery problem with split loads. PhD thesis, Georgia Institute of Technology, 2005.

    Google Scholar 

  27. G. Sierksma, G.A. Tijssen. Routing helicopters for crew exchanges on off-shore locations.Annals of Operations Research, 76: 261-286, 1998.

    Article  Google Scholar 

  28. P. Toth, D. Vigo. The granular tabu search and its application to the vehicle-routing problem.INFORMS Journal on Computing, 15: 333-346, 2003.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Quantitative Methods, University of Brescia, Contrada Santa Chiara 50, I-25122 Brescia, Italy

    Claudia Archetti & Maria Grazia Speranza

Authors
  1. Claudia Archetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maria Grazia Speranza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Claudia Archetti .

Editor information

Editors and Affiliations

  1. University of Maryland, College Park, MD, USA

    Bruce Golden  & S. Raghavan  & 

  2. American University, Washington, DC, USA

    Edward Wasil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Archetti, C., Speranza, M.G. (2008). The Split Delivery Vehicle Routing Problem: A Survey. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_5

Download citation

Publish with us

Policies and ethics

Search

Navigation