Real-time vehicle rerouting problems with time windows

European Journal of Operational Research

Volumn 194, Issue 3, 2009, Pages 711-727

  Li, Jing Quan ^a   Mirchandani, Pitu B ^b   Borenstein, Denis ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Arizona   (United States)

^c FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

Author keywords

Lagrangian heuristic; Rerouting; Schedule recovery; Vehicle routing

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; OPERATING COSTS; SYSTEMS ENGINEERING; VEHICLE ROUTING; VEHICLES; WINDOWS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPUTATIONAL EXPERIMENTS; FEASIBLE SOLUTIONS; LAGRANGIAN HEURISTIC; LAGRANGIAN RELAXATIONS; PRIMAL PROBLEMS; REROUTING; RESOURCE CONSTRAINTS; SCHEDULE RECOVERY; SERVICE DISRUPTIONS; SHORTEST PATH PROBLEMS; TIME WINDOWS; WEIGHTED SUMS;

PROBLEM SOLVING;

EID: 55149123359     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.12.037     Document Type: Article

References (51)

1. Bertsimas D.J., and Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Operations Research 44 2 (1996) 286-304
2. Campbell A.M., and Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 38 3 (2004) 369-378
3. Caprara A., Fischetti M., and Toth P. A heuristic method for the set covering problem. Operations Research 47 5 (1999) 730-743
4. Carlson P.M. Exploiting the opportunities of collaborative decision making: A model and efficient solution algorithm for airline use. Transportation Science 34 4 (2000) 381-393
5. Chen Z.L., and Xu H. Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science 40 21 (2006) 74-88
6. Desrochers M., and Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 3 (1988) 191-212
7. Desrochers M., Desrosiers J., and Solomon M.M. A new optimization algorithm for the vehicle-routing problem with time windows. Operations Research 40 2 (1992) 342-354
8. Dror M. Note on the complexity of the shortest-path models for column generation in vrptw. Operations Research 42 5 (1994) 977-978
9. Du T.C., Li E.Y., and Chou D. Dynamic vehicle routing for online b2c delivery. Omega-International Journal of Management Science 33 1 (2005) 33-45
10. Dumas Y., Desrosiers J., and Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research 54 1 (1991) 7-22
11. El Rhalibi, A., Kelleher, G., 2003. An approach to dynamic vehicle routing, rescheduling and disruption metrics. In: IEEE International Conference on Systems, Man and Cybernetics. Washington DC, USA, pp. 3613-3618.
12. Fabri A., and Recht P. On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Part B-Methodological 40 4 (2006) 335-350
13. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 3 (2004) 216-229
14. Fleischmann B., Gnutzmann S., and Sandvoss E. Dynamic vehicle routing based on online traffic information. Transportation Science 38 4 (2004) 420-433
15. Gendreau M., and Potvin J.-Y. Dynamic vehicle routing and dispatching. In: Crainic T., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, New York 115-126
16. Gendreau M., Laporte G., and Seguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science 29 2 (1995) 143-155
17. Gendreau M., Laporte G., and Seguin R. Stochastic vehicle routing. European Journal of Operational Research 88 1 (1996) 3-12
18. Gendreau M., Laporte G., and Seguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Operations Research 44 3 (1996) 469-477
19. Gendreau M., Laporte G., and Semet F. A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. Parallel Computing 27 12 (2001) 1641-1653
20. Ghiani G., Guerriero F., Laporte G., and Musmanno R. Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research 151 1 (2003) 1-11
21. Haghani A., and Jung S. A dynamic vehicle routing problem with time-dependent travel time. Computers and Operations Research 32 11 (2005) 2959-2986
22. Held M., and Karp R.M. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming 1 (1971) 6-25
23. Houck D.J., Picard J.C., Queyranne M., and Vemuganti R.R. The travelling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch 17 (1980) 93-109
24. Huisman D., Freling R., and Wagelmans A.P.M. A robust solution approach to the dynamic vehicle scheduling problem. Transportation Science 38 4 (2004) 447-458
25. Ichoua S., Gendreau M., and Potvin J.-Y. Diversion issues in real-time vehicle dispatching. Transportation Science 34 4 (2000) 426-438
26. Irnich S., and Villeneuve D. The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS Journal on Computing 18 3 (2006) 391-406
27. Jarrah A.I.Z., Yu G., Krishnamurthy N., and Rakshit A. A decision support framework for airline flight cancellations and delays. Transportation Science 27 3 (1993) 266-280
28. Kohl N., and Madsen O.B.G. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Operations Research 45 3 (1997) 395-406
29. Laporte G., and Louveaux F.V. Solving stochastic routing problems with integer l-shaped method. In: Crainic T., and Laporte G. (Eds). Fleet Management and Logistics (1998), Kluwer, New York 159-167
30. Larsen, J., 1999. Parallelizatin of the vehicle routing problem with time windows. PhD Dissertation, Department of Mathematical Modeling, Technical University of Denmark, Lyngby, Denmark.
31. Larsen A., Madsen O.B.G., and Solomon M.M. The a priori dynamic traveling salesman problem with time windows. Transportation Science 38 4 (2004) 459-572
32. Larsson T., and Patriksson M. Global optimality conditions for discrete and nonconvex optimization - with applications to Lagrangian heuristics and column generation. Operations Research 54 3 (2006) 436-453
33. Lettovský, L., 1997. Airline operations recovery: An optimization approach. PhD Thesis, Georgia Institute of Technology, USA.
34. Li, J.-Q., Mirchandani, P.B., Borenstein, D., 2004. Parallel auction algorithm for bus rescheduling. In: Proceedings of the 9th International Conference on Computer-Aided Scheduling of Public Transport. San Diego, California, USA.
35. Li J.-Q., Borenstein D., and Mirchandani P.B. A decision support system for the single-depot vehicle rescheduling problem. Computers and Operations Research 34 4 (2007) 1008-1032
36. Li J.-Q., Mirchandani P.B., and Borenstein D. Vehicle rescheduling problem: Model and algorithms. Networks 50 3 (2007) 211-229
37. Li, J.-Q., Mirchandani, P.B., Borenstein, D., 2007c. A vehicle rescheduling problem with real-time vehicle reassignments and trip cancellations. Tech. Rep. A-2007-1, The University of Arizona.
38. Mahmassani H.S., Kim Y., and Jaillet P. Local optimization approaches to solve dynamic commercial fleet management problems. Transportation Research Record 1733 (2000) 71-79
39. Powell W.B., Jaillet P., and Odoni A. Stochastic and dynamic networks and routing. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks in Operations Research and Management Science, Network Routing (1995), North-Holland, Amsterdam, The Netherlands 141-295
40. Psaraftis H.N. Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61 (1995) 143-164
41. Regan A.C., Mahmassani H.S., and Jaillet P. Dynamic decision making for commercial fleet operations using real-time information. Transportation Research Record 1537 (1996) 91-97
42. Regan A.C., Mahmassani H.S., and Jaillet P. Evaluation of dynamic fleet management systems simulation framework. Transportation Research Record 1645 (1998) 176-184
43. Righini G., and Salani M. Symmery helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization 3 (2006) 255-273
44. Rosenberger J.M., Johnson E.L., and Nemhauser G.L. Rerouting aircraft for airline recovery. Transportation Science 37 4 (2003) 408-421
45. Shieh H.M., and May M.D. On-line vehicle routing with time windows, optimization-based heuristics approach for freight demands requested in real-time. Transportation Research Record 1617 (1998) 171-178
46. Solomon M.M. Algorithms for the vehicle-routing and scheduling problems with time window constraints. Operations Research 35 2 (1987) 254-265
47. Spivey M.Z., and Powell W.B. The dynamic assignment problem. Transportation Science 38 4 (2004) 399-419
48. Teodorović D., and Stojković G. Model to reduce airline schedule disturbances. Journal of Transportation Engineering-ASCE 121 4 (1995) 324-331
49. Yan S., and Yang D.-H. A decision support framework for handling schedule perturbation. Transportation Research Part B-Methodological 30 6 (1996) 405-419
50. Yang J., Jaillet P., and Mahmassani H.S. Real-time multivehicle truckload pickup and delivery problems. Transportation Science 38 2 (2004) 135-148
51. Yu G., Argüello M., Song G., McCowan S.M., and White A. A new era for crew recovery at continental airlines. Interfaces 33 1 (2003) 5-22