Skip to main content
SpringerLink
Log in

A multi-shift vehicle routing problem with windows and cycle times

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

Abstract

In many applications of the vehicle routing problem with time windows (VRPTW), goods must be picked up within desired time frames. In addition, they have some limitations on their arrival time to the central depot. In this paper, we present a new version of VRPTW that minimizes the total cycle time of the goods. In order to meet the time windows and also minimize the cycle time, the courier’s schedule is allowed to vary. An algorithm, named VeRSA, is proposed to solve this problem. VeRSA employs concepts of scheduling theorems and algorithms to determine feasible routes and schedules of the available couriers. We prove a theoretical lower bound that provides a useful bound on the optimality gap. We also conduct a set of numerical experiments. VeRSA obtains a feasible solution faster than solving the MIP. The optimality gap using our proposed lower bound is smaller than the gap found with the standard LP relaxation.

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

Similar content being viewed by others

References

  1. Angelelli E., Grazia Speranza M., Savelsbergh M.W.P.: Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49, 308–317 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.M.: Vehicle routing problem with time windows. Column Gener., 67–98 (2005)

  3. Lee Y.H., Pinedo M.: Scheduling jobs on parallel machines with sequence-dependent setup times. Eur. J. Oper. Res. 100, 464–474 (1997)

    Article  MATH  Google Scholar 

  4. Pinedo M.: Scheduling: theory, algorithms, and systems. Springer, Berlin (2008)

    Google Scholar 

  5. Ren Y., Dessouky M., Ordóñez F.: The multi-shift vehicle routing problem with overtime. Comput. Oper. Res. 37, 1987–1998 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Toth P., Vigo D.: The vehicle routing problem. Society for Industrial Mathematics, Canada (2002)

    Book  MATH  Google Scholar 

  7. Wolsey L.A: Integer programming. Wiley, NY (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Washington, Seattle, WA, 98195-2650, USA

    Shabnam Zangeneh-Khamooshi, Zelda B. Zabinsky & Joseph A. Heim

Authors
  1. Shabnam Zangeneh-Khamooshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zelda B. Zabinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Joseph A. Heim
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shabnam Zangeneh-Khamooshi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zangeneh-Khamooshi, S., Zabinsky, Z.B. & Heim, J.A. A multi-shift vehicle routing problem with windows and cycle times. Optim Lett 7, 1215–1225 (2013). https://doi.org/10.1007/s11590-012-0497-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-012-0497-1

Keywords

Search

Navigation