Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows

Transportation Research Part B: Methodological

Volumn 38, Issue 8, 2004, Pages 669-685

  Mitrović Minić, Snežana ^a   Krishnamurti, Ramesh ^a   Laporte, Gilbert ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Dynamic pickup and delivery problem with time windows; On line heuristic; Rolling time horizon; Short term and long term time horizons

Indexed keywords

COSTS; HEURISTIC METHODS; INDUSTRIAL MANAGEMENT; MATHEMATICAL MODELS; POSTAL SERVICES; STOCHASTIC CONTROL SYSTEMS;

PARCELS; ROLLING TIME HORIZONE; ROUTING COST; STOCHASTIC MODELING;

TRANSPORTATION;

HEURISTICS;

EID: 2942585122     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2003.09.001     Document Type: Article

References (40)

1. Assad A.A. Modeling and implementation issues in vehicle routing Golden B.L. Assad A.A. Vehicle Routing: Methods and Studies, Studies in Management Science and Systems vol. 16 1988 7-45 North-Holland Amsterdam
2. Benyahia I. Potvin J.-Y. Decision support for vehicle dispatching using genetic programming IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans 28 1998 306-314
3. Bodin L.D. Golden B.L. Assad A.A. Ball M.O. Routing and scheduling of vehicles and crews: the state of the art Computers - Operations Research 11 1983 63-211
4. Cordeau J.-F. Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research 37B 2003 579-594
5. Daganzo C.F. An approximate analytical model of many-to-many demand responsive transportation systems Transportation Research 12 1978 325-333
6. Desrosiers J. Dumas Y. Solomon M.M. Soumis F. Time constrained routing and scheduling Ball M.O. Magnanti T.L. Monma C.L. Nemhauser G.L. Network Routing, Handbooks in Operations Research and Management Science vol. 8 1995 35-139 North-Holland Amsterdam
7. Desrosiers J. Dumas Y. Soumis F. A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows American Journal of Mathematical and Management Sciences 6 1986 301-325
8. Desrosiers J. Dumas Y. Soumis F. The multiple vehicle dial-a-ride problem Daduna J.R. Wren A. Computer Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport Lecture Notes in Economics and Mathematical Systems 308 1988 15-27 Springer-Verlag Berlin
9. Desrosiers, J., Dumas, Y., Soumis, F., Taillefer, S., Villeneuve, D., 1991. An algorithm for mini-clustering in handicapped transport. Les cahiers du GERAD G-91-02, École des Hautes Études Commerciales, Montreal
10. Dumas Y. Desrosiers J. Gélinas E. Solomon M.M. An optimal algorithm for the traveling salesman problem with time windows Operations Research 43 1995 367-371
11. Dumas, Y., Desrosiers, J., Soumis, F., 1989. Large-scale multi-vehicle dial-a-ride problems. Les cahiers du GERAD G-89-30, École des Hautes Études Commerciales, Montreal
12. Dumas Y. Desrosiers J. Soumis F. The pickup and delivery problem with time windows European Journal of Operational Research 54 1991 7-22
13. Fu L. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion Transportation Research 36B 2002 485-506
14. Garcia B.-L. Potvin J.-Y. Rousseau J.-M. A parallel implementation of the tabu search heuristic for vehicle routing problems with time windows constraints Computers - Operations Research 21 1994 1025-1033
15. Gendreau, M., Guertin, F., Potvin, J.-Y., Séguin, R., 1998a. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Report CRT-98-10, Centre de recherche sur les transports, Montreal
16. Gendreau M. Hertz A. Laporte G. Stan M. A generalized insertion heuristic for the traveling salesman problem with time windows Operations Research 43 1998 330-335
17. Gendreau M. Potvin J.-Y. Dynamic vehicle routing and dispatching Crainic T.G. Laporte G. Fleet Management and Logistics 1998 115-126 Kluwer Boston
18. Ioachim I. Desrosiers J. Dumas Y. Solomon M.M. Villeneuve D. A request clustering algorithm for door-to-door handicapped transportation Transportation Science 29 1995 63-78
19. Jaw J.-J. Odoni A.R. Psaraftis H.N. Wilson N.H.M. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows Transportation Research 20B 1986 243-257
20. Kanji G.K. 100 Statistical Tests 1993 Sage London
21. Mitrović-Minić, S., 2001. The dynamic pickup and delivery problem with time windows. Ph.D. Dissertation, School of Computing Science, Simon Fraser University, Burnaby, Canada
22. Mitrović-Minić, S., Laporte, G., in press. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research B, in press
23. Nanry W.P. Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search Transportation Research 34B 2000 107-121
24. Potvin J.-Y. Rousseau J.-M. Constraint-directed search for the advanced request dial-a-ride problem with service quality constraints Balci O. Shrada R. Zenios S.A. Computer Science and Operations Research: New Developments in Their Interfaces 1992 457-474 Pergamon Press Oxford
25. Powell W.B. On languages for dynamic resource scheduling problems Crainic T.G. Laporte G. Fleet Management and Logistics 1998 127-157 Kluwer Boston
26. Powell W.B. Jaillet P. Odoni A.R. Stochastic and dynamic networks and routing Ball M.O. Magnanti T.L. Monma C.L. Nemhauser G.L. Network Routing, Handbooks in Operations Research and Management Science vol. 8 1995 141-295 North-Holland Amsterdam
27. Powell W.B. Snow W. Cheung R.K. Adaptive labeling algorithms for the dynamic assignment problem Transportation Science 34 2000 50-66
28. Powell W.B. Towns M.T. Marar A. On the value of globally optimal solutions for dynamic routing and scheduling problems Transportation Science 34 2000 67-85
29. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows Transportation Science 17 1983 351-357
30. Psaraftis H.N. Dynamic vehicle routing problems Golden B.L. Assad A.A. Vehicle Routing: Methods and Studies, Studies in Management Science and Systems vol. 16 1988 223-248 North-Holland Amsterdam
31. Psaraftis H.N. Dynamic vehicle routing: status and prospects Annals of Operations Research 61 1995 143-164
32. Regan A.C. Mahmassani H.S. Jaillet P. Dynamic decision making for commercial fleet operations using real-time information Transportation Research Record 1537 1996 91-97
33. Regan A.C. Mahmassani H.S. Jaillet P. Dynamic dispatching strategies under real-time information for carrier fleet management Lesort J.B. Transportation and Traffic Theory 1996 737-756 Pergamon Oxford
34. Regan A.C. Mahmassani H.S. Jaillet P. Evaluation of dynamic fleet management systems: simulation framework Transportation Research Record 1645 1998 176-184
35. Rochat Y. Taillard É.D Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147-167
36. Savelsbergh M.W.P. Local search in routing problems with time windows Annals of Operations Research 4 1985 285-305
37. Shen Y. Potvin J.-Y. Rousseau J.-M. Roy S. A computer assistant for vehicle dispatching with learning capabilities Annals of Operations Research 61 1995 189-211
38. Toth P. Vigo D. Heuristic algorithms for the handicapped persons transportation problem Transportation Science 31 1997 60-71
39. Van der Bruggen L.J.J. Lenstra J.K. Schuur P.C. Variable-depth search for the single-vehicle pickup and delivery problem with time windows Transportation Science 27 1993 298-311
40. Yang, J., Jaillet, P., Mahmassani, H.S., 2000. Real-time multi-vehicle truckload pick-up and delivery problems. Working paper, Department of Industrial and Manufacturing Engineering, New Jersey Institute of Technology, Newark, NJ