Skip to main content
SpringerLink
Log in

Self-imposed time windows in vehicle routing problems

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

We observe self-imposed time windows (SITW) whenever a logistics service provider quotes a delivery time window to his customer. Once this time window is communicated, the company strives to respect it as well as possible. We incorporate these SITW within the framework of the vehicle routing problem (VRP). Essential to SITW is the fact that the time window is determined by the carrier company and not by the customer. The resulting VRP-SITW is inherently different from the well-studied VRP with time windows (VRPTW) in that in the latter problem the time windows are exogenous constraints imposed by the customers. The second important element of the problem studied in this paper is the uncertainty in the travel times. The basic mechanism of dealing with this uncertainty is the allocation of time buffers throughout the routes, which absorb disruptions. We propose a heuristic solution approach combining an LP model and a local search heuristic. A tabu search heuristic assigns customers to vehicles and establishes the order of visit of the customers per vehicle. Detailed timing decisions are subsequently generated by the LP model, whose output also guides the local search in a feedback loop. We test our algorithm on a number of benchmark instances for the VRP and VRPTW. We highlight the costs involved in integrating SITW with the VRP and we underline the advantages of SITW as compared to VRPTW.

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

Similar content being viewed by others

References

  • Augerat P, Belenguer JM, Benavent E, Corber A, Naddef D (1998) Separating capacity constraints in the CVRP using tabu search. Eur J Oper Res 106:546–557

    Article  Google Scholar 

  • Ballestín F, Leus R (2008) Meta-heuristics for stable scheduling on a single machine. Comput Oper Res 35:2175–2192

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transp Sci 39(1):104–118

    Article  Google Scholar 

  • Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: Metaheuristics. Transp Sci 39(1):119–139

    Article  Google Scholar 

  • Christiansen CH, Lysgaard J (2007) A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res Lett 35(6):773–781

    Article  Google Scholar 

  • Cordeau J-F, Laporte G, Potvin J-Y, Savelsbergh MWP (2007) Transportation. In: Handbooks in operations research and management science. Elsevier, Amsterdam, pp 367–428

  • Daniels R, Carrillo J (1997) \(\beta \)-robust scheduling for single-machine systems with uncertain processing times. IIE Trans 29:977–985

    Google Scholar 

  • Daniels R, Kouvelis P (1995) Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag Sci 41:363–376

    Article  Google Scholar 

  • Finke DA, Medeiros DJ, Traband MT (2007) Multiple machine JIT scheduling: a tabu search approach. Int J Prod Res 45(21):4899–4915

    Article  Google Scholar 

  • Flisberg P, Lidéna B, Rönnqvist M (2009) A hybrid method based on linear programming and tabu search for routing of logging trucks. Comput Oper Res 36(4):1122–1144

    Article  Google Scholar 

  • Garcia BL, Potvin J-Y, Rousseau J-M (1994) A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints. Comput Oper Res 21(9):1025–1033

    Article  Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276–1290

    Article  Google Scholar 

  • Gendreau M, Laporte G, Séguin R (1995a) An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp Sci 29(2):143–155

    Article  Google Scholar 

  • Gendreau M, Laporte G, Séguin R (1996) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res 44(3):469–477

    Article  Google Scholar 

  • Gendreau M, Laporte G, Solomon MM (1995b) Single-vehicle routing and scheduling to minimize the number of delays. Transp Sci 29(1):56–62

    Article  Google Scholar 

  • Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manuf Serv Oper Manag 11(4):630–643

    Google Scholar 

  • Herroelen W, Leus R (2004) The construction of stable project baseline schedules. Eur J Oper Res 156:550–565

    Article  Google Scholar 

  • Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129–135

    Article  Google Scholar 

  • Hopp WJ, Spearman ML (1996) Factory physics. Foundations for Manufacturing Management, Mc-Graw Hill, New York

  • Jabali O, Van Woensel T, de Kok AG, Lecluyse C, Peremans H (2009) Time-dependent vehicle routing subject to time delay perturbations. IIE Trans 41(12):1049–1066

    Article  Google Scholar 

  • Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37(1):69–82

    Article  Google Scholar 

  • Kouvelis P, Daniels R, Vairaktarakis G (2000) Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans 32:421–432

    Google Scholar 

  • Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht

  • Lambrechts O (2007) Robust project scheduling subject to resource breakdowns. Ph.D. thesis, Faculty of Business and Economics, KU Leuven

  • Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416

    Article  Google Scholar 

  • Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26(3):161–170

    Article  Google Scholar 

  • Laporte G, Louveaux FV, Van hamme L (2002) An integer \(L\)-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operat Res 50(3):415–423

    Article  Google Scholar 

  • Lei H, Laporte G, Guo B (2012) A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. TOP 20:99–118

    Article  Google Scholar 

  • Leus R, Herroelen W (2005) The complexity of machine scheduling for stability with a single disrupted job. Oper Res Lett 33:151–156

    Article  Google Scholar 

  • Leus R, Herroelen W (2007) Scheduling for stability in single-machine production systems. J Sched 10:223–235

    Article  Google Scholar 

  • Li X, Tian P, Leung SCH (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int Prod Econ 125:137–145

    Article  Google Scholar 

  • Mitrović-Minić S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transp Res Part B 38:635–655

    Article  Google Scholar 

  • Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. Thesis, Northwestern University, Evanston, Illinois

  • Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46(12):1433–1446

    Article  Google Scholar 

  • Puchinger J, Raidl GR (2005) Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification. Mira J, Álvarez JR (eds) Artificial intelligence and knowledge engineering applications: a bioinspired approach. Lecture notes in computer science, vol 3562. Springer, Berlin, pp 41–53

  • Ralphs T (2010) Branch Cut and Price Resource Web. http://www.branchandcut.org. Accessed Oct 2010

  • Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper Res 57(1):214–230

    Article  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265

    Article  Google Scholar 

  • Solomon MM (2010) VRPTW Benchmark Problems. http://web.cba.neu.edu/~msolomon/problems.htm. Accessed April 2010

  • Taş D, Dellaert NP, van Woensel T, de Kok AG (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput Oper Res 40(1):214–224

    Article  Google Scholar 

  • Taillard É, Badeau P, Gendreau M, Guertin F, Potvin J-Y (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31:170–186

    Article  Google Scholar 

  • Xiang S, Chu C, Chen H (2008) The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments. Eur J Oper Res 185(2):534–551

    Article  Google Scholar 

  • Zhao J, Dessouky M, Bukkapatnam S (2006) Optimal slack time for schedule-based transit operations. Transp Sci 40(4):529–539

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HEC Montréal and CIRRELT, 3000, chemin de la Côte-Sainte-Catherine, Montréal, H3T 2A7, Canada

    Ola Jabali

  2. Research Center ORSTAT, KU Leuven, Naamsestraat 69, Leuven, 3000, Belgium

    Roel Leus

  3. School of Industrial Engineering, Eindhoven University of Technology, Postbus 513, Eindhoven, 5600 MB, The Netherlands

    Tom Van Woensel & Ton de Kok

Authors
  1. Ola Jabali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roel Leus
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tom Van Woensel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ton de Kok
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ola Jabali.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jabali, O., Leus, R., Van Woensel, T. et al. Self-imposed time windows in vehicle routing problems. OR Spectrum 37, 331–352 (2015). https://doi.org/10.1007/s00291-013-0348-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-013-0348-1

Keywords

Search

Navigation