Waiting strategies for the dynamic pickup and delivery problem with time windows

Transportation Research Part B: Methodological

Volumn 38, Issue 7, 2004, Pages 635-655

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

^a SIMON FRASER UNIVERSITY   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Dynamic pickup and delivery problem with time windows; Heuristic algorithm; Scheduling

Indexed keywords

PICKUPS; PROBLEM SOLVING;

COURIER COMPANIES; SMALL PARCELS; VEHICLE ROUTES; WAITING STRATEGIES;

TRANSPORTATION;

FREIGHT TRANSPORT;

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

References (33)

1. 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
2. Borndörfer, R., Grötschel, M., Klostermeier, F., Kütner, A., 1997. Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Infromationstechnik Berlin
3. Cordeau J.-F. Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem Transportation Research B 37 2003 579-594
4. Cordeau J.-F. Laporte G. The dial-a-ride problem (DARP): Variants, modeling issues and algorithms 4OR-Quarterly Journal of the Belgian French and Italian Operations Research Societies 1 2003 89-101
5. 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
6. 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
7. 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
8. Dumas Y. Soumis F. Desrosiers J. Optimizing the schedule for a fixed vehicle path with convex inconvenience costs Transportation Science 24 1990 145-152
9. Dumas Y. Desrosiers J. Soumis F. The pickup and delivery problem with time windows European Journal of Operational Research 54 1991 7-22
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. Gendreau M. Potvin J.-Y. Dynamic vehicle routing and dispatching Crainic T.G. Laporte G. Fleet Management and Logistics 1998 115-126 Kluwer Boston
12. Gendreau, M., Guertin, F., Potvin, J.-Y., Séguin, R., 1998. 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
13. 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
14. 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 B 20 1986 243-257
15. Madsen O.B.G. Ravn H.F. Rygaard J.M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives Annals of Operations Research 60 1995 193-208
16. 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
17. Mitrović-Minić, S., Krishnamurti, R., Laporte, G., in press. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research B. doi:10.1016/j.trb.2003.09.001
18. Nanry W.P. Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search Transportation Research B 34 2000 107-121
19. 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
20. Powell W.B. Optimization models and algorithms: An emerging technology for the motor carrier industry IEEE Transactions on Vehicular Technology 40 1991 68-80
21. 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
22. Psaraftis, H.N., 1988. Dynamic vehicle routing problems. In: Golden, B.L., Assad, A.A., (Eds.), Vehicle Routing: Methods and Studies. Studies in Management Science and Systems, vol. 16. North-Holland, Amsterdam, pp. 223-248
23. Psaraftis H.N. Dynamic vehicle routing: Status and prospects Annals of Operations Research 61 1995 143-164
24. Rochat Y. Taillard É.D. Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147-167
25. Rosenkrantz D.J. Stearns R.E. Lewis P.M. II An analysis of several heuristics for the traveling salesman problem SIAM Journal on Computing 6 1977 563-581
26. Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration ORSA Journal on Computing 4 1992 146-154
27. Sexton T.R. Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling Transportation Science 19 1985 378-410
28. Sexton T.R. Choi Y. Pickup and delivery of partial loads with time windows American Journal of Mathematical and Management Sciences 6 1986 369-398
29. 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
30. Toth P. Vigo D. Heuristic algorithms for the handicapped persons transportation problem Transportation Science 31 1997 60-71
31. Toth, P., Vigo, D., 2002. The Vehicle Pouting Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia
32. 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
33. Wolfler Calvo, R., Colorni, A., submitted for publication. An approximation algorithm for the dial-a-ride problem