A tabu search heuristic for the static multi-vehicle dial-a-ride problem

Transportation Research Part B: Methodological

Volumn 37, Issue 6, 2003, Pages 579-594

  Cordeau, Jean François ^a   Laporte, Gilbert ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

Dial a ride problem; Door to door transportation; Tabu search heuristic

Indexed keywords

COSTS; HEURISTIC METHODS; VEHICLES;

ROUTE DURATION;

MOTOR TRANSPORTATION;

HEURISTICS; TRANSPORTATION PLANNING; TRAVEL BEHAVIOR;

EID: 0038364102     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(02)00045-0     Document Type: Article

References (30)

1. Bodin L.D. Sexton T. The multi-vehicle subscriber dial-a-ride problem TIMS Studies in Management Science 26 1986 73 86
2. Borndörfer, R., Grötschel, M., Klostermeier F., Küttner, C., 1997. Telebus Berlin: Vehicle scheduling in a dial-a-ridesystem. Technical Report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin.
3. Cordeau J.-F. Gendreau M. Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119
4. Cordeau, J.-F., Laporte, G., 2002. The dial-a-ride problem: Variants, modeling issues and algorithms. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, forthcoming
5. Cordeau J.-F. Laporte G. Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society 52 2001 928 936
6. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2002. VRP with pickup and delivery. In:Toth, P., Vigo, D. (Eds.), The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
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., Taillefer, S., Villeneuve, D., 1991. An algorithm for mini-clustering in handicapped transport. Cahier du GERAD G-91-22, École des Hautes Études Commerciales, Montreal
9. Dumas, Y., Desrosiers, J., Soumis, F., 1989. Large scale multi-vehicle dial-a-ride problems. Cahier du GERAD G-89-30, École des Hautes Études Commercials, Montreal
10. Dumas Y. Desrosiers J. Soumis F. The pickup and delivery problem with time windows European Journal of Operational Research 54 1991 7 22
11. Fu L. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion Transportation Research B 36 2002 485 506
12. Gendreau M. Hertz A. Laporte G. A tabu search heuristic for the vehicle routing problem Management Science 40 1994 1276 1290
13. Glover F. Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 533 549
14. Glover F. Laguna M. Tabu Search 1997 Kluwer Boston
15. Ioachim I. Desrosiers J. Dumas Y. Solomon M.M. A request clustering algorithm for door-to-door handicapped transportation Transportation Science 29 1995 63 78
16. Jaw 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
17. Madsen O.B.G. Ravn H.F. Rygaard J.M. A heuristic algorithm for the a dial-a-ride problem with time windows, multiple capacities, and multiple objectives Annals of Operations Research 60 1995 193 208
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. Psaraftis H.N. A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem Transportation Science 14 1980 130 154
20. 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
21. Savelsbergh M.W.P. The vehicle routing problem with time windows: Minimizing route duration ORSA Journal on Computing 4 1992 146 154
22. Sexton T. Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling Transportation Science 19 1985 378 410
23. Sexton T. Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing Transportation Science 19 1985 411 435
24. Taillard, E.D., 1993. Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673.
25. Toth P. Vigo D. Fast local search algorithms for the handicapped persons transportation problem Osman I.H. Kelly J.P. Meta-Heuristics: Theory and Applications 1996 677 690 Kluwer Boston
26. Toth P. Vigo D. Heuristic algorithms for the handicapped persons transportation problem Transportation Science 31 1997 60 71
27. Toth, P., Vigo, D., 2002. The vehicle routing problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia
28. Wilson, N.H.M., Colvin, N., 1976. Computer control of the Rochester dial-a-ride system. Technical Report R77-31, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA
29. Wilson, N.H.M., Sussman, J., Wong, H., Higonnet, B., 1971. Scheduling Algorithms for dial-a-ride systems. Technical Report USL TR-70-13, Urban Systems Laboratory, Massachusetts Institute of Technology, Cambridge, MA
30. Wilson, N.H.M., Weissberg, H., 1976. Advanced dial-a-ride algorithms research project: Final report. Technical Report R76-20, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA