Skip to main content
SpringerLink
Log in

A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts

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

Abstract

In the capacitated team orienteering problem, a fleet of vehicles visits and services a subset of customers in order to maximize the total profit collected while obeying capacity and route length constraints. In the split delivery team orienteering problem (SDCTOP), multiple vehicles can service the same customer; each vehicle satisfies some, but not all, of the customer demand. Allowing split deliveries may double the total profit, in the extreme case. However, split deliveries often cause inconvenience to the customers, so we introduce the split delivery team orienteering problem with minimum delivery amounts (SDCTOP–MDA). In this paper, we perform a worst-case analysis on the SDCTOP–MDA to determine tight bounds on the maximum possible profit increase.

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

Similar content being viewed by others

References

  1. Archetti, C., Bianchessi, N., Speranza, M.G., Hertz, A.: The split delivery capacitated team orienteering problem. Networks 63(1), 16–33 (2014)

    Article  MathSciNet  Google Scholar 

  2. Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transp. Sci. 40(2), 226–234 (2006)

    Article  Google Scholar 

  3. Chen, S., Golden, B., Wasil, E.: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks 49(4), 318–329 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gulczynski, D., Golden, B., Wasil, E.: The split delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Logist. Transp. Rev. 46(5), 612–626 (2010)

    Article  Google Scholar 

  5. Xiong, Y., Gulczynski, D., Kleitman, D., Golden, B., Wasil, E.: A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. Optim. Lett. 7(7), 1597–1609 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Maryland, College Park, MD, 20742, USA

    Xingyin Wang

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

    Bruce Golden

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

    Damon Gulczynski

Authors
  1. Xingyin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruce Golden
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Damon Gulczynski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xingyin Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, X., Golden, B. & Gulczynski, D. A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optim Lett 8, 2349–2356 (2014). https://doi.org/10.1007/s11590-014-0752-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0752-8

Keywords

Search

Navigation