Self-imposed time windows in vehicle routing problems

OR Spectrum

Volumn 37, Issue 2, 2015, Pages 331-352

  Jabali, Ola ^a   Leus, Roel ^b   van Woensel, Tom ^c   de Kok, Ton ^c  

^a HEC MONTRÉAL   (Canada)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Disruptions in travel times; Linear programming; Tabu search; Vehicle routing problem; Vehicle scheduling

Indexed keywords

EID: 84924051733     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-013-0348-1     Document Type: Article

References (43)

1. 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
2. Ballestín F, Leus R (2008) Meta-heuristics for stable scheduling on a single machine. Comput Oper Res 35:2175–2192
3. 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
4. Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: Metaheuristics. Transp Sci 39(1):119–139
5. 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
6. 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
7. Daniels R, Carrillo J (1997) $$\beta $$β-robust scheduling for single-machine systems with uncertain processing times. IIE Trans 29:977–985
8. Daniels R, Kouvelis P (1995) Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag Sci 41:363–376
9. Finke DA, Medeiros DJ, Traband MT (2007) Multiple machine JIT scheduling: a tabu search approach. Int J Prod Res 45(21):4899–4915
10. 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
11. 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
12. Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276–1290
13. 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
14. 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
15. Gendreau M, Laporte G, Solomon MM (1995b) Single-vehicle routing and scheduling to minimize the number of delays. Transp Sci 29(1):56–62
16. Groër C, Golden B, Wasil E (2009) The consistent vehicle routing problem. Manuf Serv Oper Manag 11(4):630–643
17. Herroelen W, Leus R (2004) The construction of stable project baseline schedules. Eur J Oper Res 156:550–565
18. Hertz A, Laporte G, Mittaz M (2000) A tabu search heuristic for the capacitated arc routing problem. Oper Res 48(1):129–135
19. Hopp WJ, Spearman ML (1996) Factory physics. Foundations for Manufacturing Management, Mc-Graw Hill, New York
20. 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
21. Kenyon AS, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37(1):69–82
22. Kouvelis P, Daniels R, Vairaktarakis G (2000) Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Trans 32:421–432
23. Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht
24. Lambrechts O (2007) Robust project scheduling subject to resource breakdowns. Ph.D. thesis, Faculty of Business and Economics, KU Leuven
25. Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416
26. Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26(3):161–170
27. Laporte G, Louveaux FV, Van hamme L (2002) An integer $$L$$L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Operat Res 50(3):415–423
28. 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
29. Leus R, Herroelen W (2005) The complexity of machine scheduling for stability with a single disrupted job. Oper Res Lett 33:151–156
30. Leus R, Herroelen W (2007) Scheduling for stability in single-machine production systems. J Sched 10:223–235
31. 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
32. 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
33. 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
34. Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routing problems with time windows. J Oper Res Soc 46(12):1433–1446
35. 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
36. Ralphs T (2010) Branch Cut and Price Resource Web. http://www.branchandcut.org. Accessed Oct 2010
37. Secomandi N, Margot F (2009) Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper Res 57(1):214–230
38. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265
39. Solomon MM (2010) VRPTW Benchmark Problems. http://web.cba.neu.edu/~msolomon/problems.htm. Accessed April 2010
40. 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
41. 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
42. 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
43. Zhao J, Dessouky M, Bukkapatnam S (2006) Optimal slack time for schedule-based transit operations. Transp Sci 40(4):529–539