Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem

Parallel Computing

Volumn 30, Issue 3, 2004, Pages 377-387

  Attanasio, Andrea ^a   Cordeau, Jean François ^b   Ghiani, Gianpaolo ^c   Laporte, Gilbert ^b  

^a UNIVERSITY OF CALABRIA   (Italy)

^b HEC MONTRÉAL   (Canada)

^c UNIVERSITY OF SALENTO   (Italy)

Author keywords

Dial a ride problem; Metaheuristics; Parallel computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER OPERATING SYSTEMS; CONSTRAINT THEORY; HEURISTIC METHODS; INTERNET; PROBLEM SOLVING;

DIAL-A-RIDE PROBLEM; METAHEURISTICS;

PARALLEL PROCESSING SYSTEMS;

EID: 1842852976     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2003.12.001     Document Type: Article

References (12)

1. R. Borndörfer, M. Grötschel, F. Klostermeier, C. Küttner. Telebus Berlin: vehicle scheduling in a dial-a-ride system, technical report SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik Berlin, 1997.
2. Cordeau J.-F., Gendreau M., Laporte G., Potvin J.-Y., Semet F. A guide to vehicle routing heuristics. Journal of the Operational Research Society. 53:2002;512-522.
3. Cordeau J.-F., Laporte G. The dial-a-ride problem: variants, modeling issues and algorithms. 4OR - Quarterly Journal of the Belgian, French and Italian Operations Research Societies. 1:2003;89-101.
4. 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.
5. Crainic T.G., Toulouse M., Gendreau M. Towards a taxonomy of parallel Tabu search algorithms. INFORMS Journal on Computing. 9:1997;61-72.
6. Ghiani G., Guerriero F., Laporte G., Musmanno R. Real-time vehicle routing: solution concepts. Algorithms and parallel computing strategies, European Journal of Operational Research. 151:2003;1-11.
7. Psaraftis H.N. Dynamic vehicle routing: status and prospects. Annals of Operations Research. 61:1995;143-164.
8. 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.
9. Savelsbergh M.W.P. The vehicle routing problem with time windows: minimizing route duration. ORSA Journal on Computing. 4:1992;146-154.
10. 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.
11. Toth P., Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science. 31:1997;60-71.
12. William G., Snir M., Gropp W., Nitzberg B., Lusk E. MPI: The Complete Reference. 1998;MIT Press, Boston, MA.