Skip to main content
SpringerLink
Log in

Branch-and-Price on the Split Delivery Vehicle Routing Problem with Time Windows and Alternative Delivery Periods

  • Conference paper
  • First Online:
Operations Research Proceedings 2013

Part of the book series: Operations Research Proceedings ((ORP))

  • 1638 Accesses

Abstract

In this article we address the Split Delivery Vehicle Routing Problem with Time Windows and alternative Periods (SDVRPTWA). The consideration of multiple delivery periods per customer and the possibility of splitting deliveries across different periods makes it a relaxation of the well-known Vehicle Routing Problem with Time Windows and Split Deliveries (VRPTWSD). The problem is solved by a branch-and-price method. The opportunity for freight forwarders is to plan more efficient tours by exploiting alternative delivery periods. The contribution of this article is to prove the potential of this approach for cost savings and to demonstrate the decomposition of a SDVRPTWA in a demand focused master problem and period related pricing problems .

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Archetti, C., Savelsbergh, M., & Speranza, M. G. (2006). Worst-case analysis for split delivery vehicle routing problems. Transportation Science, 40(2), 226–234.

    Article  Google Scholar 

  2. Archetti, C., Bianchessi, N., & Speranza, M. G. (2011). A column generation approach for the split delivery vehicle routing problem. Networks, 58(4), 241–254.

    Article  Google Scholar 

  3. Baldacci, R., Mingozzi, A., & Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research, 218(1), 1–6.

    Article  Google Scholar 

  4. Cordeau, J.-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928–936.

    Article  Google Scholar 

  5. Desrosiers, J., Soumis, F., & Desrochers, M. (1984). Routing with time windows by column generation. Networks, 14(4), 545–565.

    Article  Google Scholar 

  6. Desaulniers, G. (2010). Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research, 58(1), 179–192.

    Article  Google Scholar 

  7. Desaulniers, G., Desrosiers, J., & Spoorendonk, S. (2010). The vehicle routing problem with time windows: State-of-the-art exact solution methods. In: J.J. Cochrane (Ed.), Wiley encyclopedia of operations research and management science (Vol. 8, pp. 5742–5749). Wiley. http://onlinelibrary.wiley.com/doi/10.1002/9780470400531.eorms1034/abstract.

  8. Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141.

    Article  Google Scholar 

  9. Feillet, D. (2010). A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR: A Quarterly Journal of Operations Research.

    Google Scholar 

  10. Frizzell, P. W., & Giffin, J. W. (1995). The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research, 22(6), 655–667.

    Article  Google Scholar 

  11. Gendreau, M., Dejax, P., Feillet, D., & Gueguen, C. (2006). Vehicle routing with time windows and split deliveries. Laboratoire Informatique dAvignon, Technical report.

    Google Scholar 

  12. Pirkwieser, S., & Raidl, G. (2009). A column generation approach for the periodic vehicle routing problem with time windows. Proceedings of the International Network Optimization Conference.

    Google Scholar 

  13. Salani, M., & Vacca, I. (2009). Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Transport and Mobility Laboratory, Ecole Polytechnique Fédérale de Lausanne, Technical report.

    Google Scholar 

  14. Solomon, M. M. (1983). Vehicle routing and scheduling with time windows constraints: Models and algorithms (PhD thesis, University of Pennsylvania).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Karlsruhe Institute of Technology (KIT), 76131, Karlsruhe, Germany

    Heiko Breier

  2. Accenture GmbH, 80807, Munich, Germany

    Timo Gossler

Authors
  1. Heiko Breier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Timo Gossler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Heiko Breier .

Editor information

Editors and Affiliations

  1. Econometric Institute, Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Dennis Huisman

  2. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Ilse Louwerse

  3. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Albert P.M. Wagelmans

Appendix

Appendix

In this section we present our solutions to the problem. We created instances with up to 17 customers

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Breier, H., Gossler, T. (2014). Branch-and-Price on the Split Delivery Vehicle Routing Problem with Time Windows and Alternative Delivery Periods. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_9

Download citation

Publish with us

Policies and ethics

Search

Navigation