Skip to main content
SpringerLink
Log in

A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In the vehicle routing problem (VRP), a fleet of vehicles must service the demands of customers in a least-cost way. In the split delivery vehicle routing problem (SDVRP), multiple vehicles can service the same customer by splitting the deliveries. By allowing split deliveries, savings in travel costs of up to 50 % are possible, and this bound is tight. Recently, a variant of the SDVRP, the split delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA), has been introduced. In the SDVRP-MDA, split deliveries are allowed only if at least a minimum fraction of a customer’s demand is delivered by each visiting vehicle. We perform a worst-case analysis on the SDVRP-MDA to determine tight bounds on the maximum possible savings.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Archetti, C., Savelsbergh, M., Speranza, M.: Worst-case analysis for split delivery vehicle routing problems. Transport. Sci. 40, 226–234 (2006)

    Article  Google Scholar 

  2. Golden, B., Raghavan, S., Wasil, E.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, New York (2008)

  3. Gulczynski, D., Golden, B., Wasil, E.: The split delivery vehicle routing problem with minimum delivery amounts. Transport. Res. Part E 46, 612–626 (2010)

    Article  Google Scholar 

Download references

Acknowledgments

We thank Claudia Archetti for her input on an early version of this paper.

Author information

Authors and Affiliations

  1. Mercury Systems, Inc., Princeton, NJ, 08540, USA

    Yupei Xiong

  2. RouteSmart Technologies, Inc., Columbia, MD, 21045, USA

    Damon Gulczynski

  3. Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA

    Daniel Kleitman

  4. Robert H. Smith School of Business, University of Maryland, College Park, MD, 20742, USA

    Bruce Golden

  5. Kogod School of Business, American University, Washington, DC, 20016, USA

    Edward Wasil

Authors
  1. Yupei Xiong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Damon Gulczynski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Kleitman
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bruce Golden
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Edward Wasil
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Damon Gulczynski.

Appendix

Appendix

figure a1
figure a2
figure a3

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xiong, Y., Gulczynski, D., Kleitman, D. et al. A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim Lett 7, 1597–1609 (2013). https://doi.org/10.1007/s11590-012-0554-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0554-9

Keywords

Search

Navigation