Effective handling of dynamic time windows and its application to solving the dial-a-ride problem

Transportation Science

Volumn 49, Issue 2, 2015, Pages 335-354

  Gschwind, Timo ^a   Irnich, Stefan ^a  

^a JOHANNES GUTENBERG UNIVERSITY MAINZ   (Germany)

Author keywords

Branch and price; Dial a ride problem; Dynamic time windows; Labeling algorithm; Ride time constraints; Time synchronization; Transportation; Vehicle routing

Indexed keywords

COSTS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; NETWORK ROUTING; ROUTING ALGORITHMS; TRANSPORTATION; VEHICLES;

BRANCH AND PRICE; DIAL-A-RIDE PROBLEM; DYNAMIC TIME; LABELING ALGORITHMS; TIME CONSTRAINTS; TIME SYNCHRONIZATION;

VEHICLE ROUTING;

EID: 84923052387     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2014.0531     Document Type: Article

References (40)

1. Ascheuer N, Fischetti M, Grötschel M (2000) A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2):69-79.
2. Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3):756-763.
3. Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math. Programming 120(2):347-380.
4. Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269-1283.
5. Borndörfer R, Klostermeier F, Grötschel M, Küttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik, Berlin.
6. Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. 191(1):19-29.
7. Ceselli A, Righini G, Salani M (2009) A column generation algorithm for a rich vehicle-routing problem. Transportation Sci. 43(1):56-69.
8. Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3):573-586.
9. Cordeau J-F, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Res. Part B 37(6):579-594.
10. Cordeau J-F, Laporte G (2007) The dial-a-ride problem: Models and algorithms. Ann. Oper. Res. 153(1):29-46.
11. Cordeau J-F, Laporte G, Ropke S (2008) Recent models and algorithms for one-to-one pickup and delivery problems. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer, Boston), 327-357.
12. Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3): 387-404.
13. Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F (2002) VRP with pickup and delivery. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 225-242.
14. Desaulniers G, Desroisiers J, Ioachim I, Solomon MM, Soumis F, Villeneuve D (1998) A unified framework for deterministic time constraint vehicle routing and crew scheduling problems. Crainic TG, Laporte G, eds. Fleet Management and Logistics (Kluwer, Norwell, MA), 57-93.
15. Desrochers M, Soumis F (1988) A generalized permanent labelling algorithm for the shortest path problem with time windows. INFOR 26(3):191-212.
16. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342-354.
17. Drexl M (2012) Synchronization in vehicle routing-A survey of VRPs with multiple synchronization constraints. Transportation Sci. 46(3):297-316.
18. du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math. 194(1-3):229-237.
19. Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur. J. Oper. Res. 54(1):7-22.
20. Eveborn P, Flisberg P, Rönnqvist M (2006) Laps care-An operational system for staff planning of home care. Eur. J. Oper. Res. 171(3):962-976.
21. Firat M, Woeginger GJ (2011) Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper. Res. Lett. 39(1):32-35.
22. Haugland D, Ho SC (2010) Feasibility testing for dial-a-ride problems. Chen B, ed. Algorithmic Aspects in Information and Management, Lecture Notes Comput. Sci., Vol. 6124 (Springer, Berlin Heidelberg), 170-179.
23. Houck DJ, Picard JC, Queyranne M, Vemuganti RR (1980) The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. OPSEARCH 17:93-109.
24. Ioachim I, Desrosiers J, Soumis F, Bélanger N (1999) Fleet assignment and routing with schedule synchronization constraints. Eur. J. Oper. Res. 119(1):75-90.
25. Ioachim I, Gélinas S, Desrosiers J, Soumis F (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3):193-204.
26. Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33-65.
27. Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k-cycle elimination for k≥ 3. INFORMS J. Comput. 18(3):391-406.
28. Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497-511.
29. Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007-1023.
30. Madsen O, Ravn H, Rygaard J (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60(1):193-208.
31. Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated VRP. Toth P, Vigo D, eds. The Vehicle Routing Problem (SIAM, Philadelphia), 53-84.
32. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems: Part II: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58(2):81-117.
33. Parragh SN, Doerner KF, Hartl RF (2010) Variable neighborhood search for the dial-a-ride problem. Comps. Oper. Res. 37(6): 1129-1138.
34. Ropke S, Cordeau J-F (2005) Branch and cut and price for the pickup and delivery problem with time windows. Unpublished doctoral dissertation, Heuristic and exact algorithms for vehicle routing problems, University of Copenhagen, Copenhagen.
35. Ropke S, Cordeau J-F (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transportation Sci. 43(3):267-286.
36. Ropke S, Cordeau J-F, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4):258-272.
37. Russell RA, Morrel RB (1986) Routing special-education school buses. Interfaces 16(5):56-64.
38. Savelsbergh MWP (1992) The vehicle routing problem with time windows: Minimizing route duration. INFORMS J. Comput. 4(2):146-154.
39. Tang J, Kong Y, Lau H, Ip AWH (2010) A note on "efficient feasibility testing for dial-a-ride problems." Oper. Res. Lett. 38(5): 405-407.
40. Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transportation Sci. 31(1):60-71.