Variable neighborhood search for the dial-a-ride problem

Computers and Operations Research

Volumn 37, Issue 6, 2010, Pages 1129-1138

  Parragh, Sophie N ^a   Doerner, Karl F ^a   Hartl, Richard F ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Dial a ride problem; Metaheuristic; Transportation; Variable neighborhood search

Indexed keywords

DIAL-A-RIDE PROBLEM; EJECTION CHAIN; METAHEURISTIC; PICKUP AND DELIVERY; TIME WINDOWS; VARIABLE NEIGHBORHOOD SEARCH; VEHICLE LOAD;

HEURISTIC METHODS;

EID: 71749088943     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.10.003     Document Type: Article

References (23)

1. Baugh J.W., Krishna G., Kakivaya R., and Stone J.R. Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30 (1998) 91-123
2. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31 (1997) 60-71
3. Aldaihani M., and Dessouky M.M. Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45 (2003) 75-96
4. Jørgensen R.M., Larsen J., and Bergvinsdottir K.B. Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58 (2007) 1321-1331
5. Berbeglia G., Cordeau J.-F., Gribkovskaia I., and Laporte G. Static pickup and delivery problems: a classification scheme and survey. TOP 15 (2007) 1-31
6. Cordeau J.-F., and Laporte G. The dial-a-ride problem: models and algorithms. Ann Oper Res 153 (2007) 29-46
7. Parragh S.N., Doerner K.F., and Hartl R.F. A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations. J Betriebswirtschaft 58 (2008) 81-117
8. Paquette J., Cordeau J.-F., and Laporte G. Quality of service in dial-a-ride operations. Comput Ind Eng 56 (2009) 1721-1734
9. Cordeau J.-F., and Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res B Meth 37 (2003) 579-594
10. Mladenović N., and Hansen P. Variable neighborhood search. Comput Oper Res 24 (1997) 1097-1100
11. Glover F., and Laguna M. Tabu search (1997), Kluwer, Norwell
12. Parragh SN, Doerner KF, Gandibleux X, Hartl RF. A heuristic two-phase solution method for the multi-objective dial-a-ride problem. Networks 2009, to appear, available online, doi: 10.1002/net.20335.
13. Polacek M., Hartl R.F., Doerner K.F., and Reimann M. A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10 (2004) 613-627
14. Hemmelmayr V.C., Doerner K.F., and Hartl R.F. A variable neighborhood search heuristic for periodic routing problems. Eur J Oper Res 195 (2009) 791-802
15. Carrabs F., Cordeau J.-F., and Laporte G. Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19 (2007) 618-632
16. Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54 (2006) 573-586
17. Glover F. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl Math 65 (1996) 223-253
18. Ropke S., and Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40 (2006) 455-472
19. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
20. Savelsbergh M.W.P. The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4 (1992) 146-154
21. Cordeau J.-F., Gendreau M., and Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 (1997) 105-119
22. Parragh SN. Ambulance routing problems with rich constraints and multiple objectives. PhD thesis, University of Vienna, Faculty for Business, Economics and Statistics; 2009.
23. Bergvinsdottir KB. The genetic algorithm for solving the dial-a-ride problem. Master's thesis, Informatics and Mathematical Modelling, Technical University of Denmark; 2004.