A Granular Tabu Search algorithm for the Dial-a-Ride Problem

Transportation Research Part B: Methodological

Volumn 56, Issue , 2013, Pages 120-135

  Kirchler, Dominik ^a,b,c   Wolfler Calvo, Roberto ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITÉ PARIS 13   (France)

^c Mediamobile   (France)

Author keywords

Dial a Ride Problem; Granular Tabu Search

Indexed keywords

FLEET OPERATIONS; GENETIC ALGORITHMS; LEARNING ALGORITHMS; OPTIMIZATION; TABU SEARCH;

DIAL-A-RIDE PROBLEM; DIAL-A-RIDE SYSTEMS; FLEET OF VEHICLES; MIXED INTEGER LINEAR PROGRAMMING; ROUTING AND SCHEDULING; TABU SEARCH ALGORITHMS; TEST INSTANCES; VARIABLE NEIGHBORHOOD SEARCH;

INTEGER PROGRAMMING;

ALGORITHM; LINEAR PROGRAMING; NUMERICAL MODEL; OPTIMIZATION; TRANSPORTATION;

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

References (29)

1. Berbeglia G., Cordeau J.-F., Laporte G. Dynamic pickup and delivery problems. European Journal of Operational Research 2010, 202(1):8-15.
2. Bergvinsdottir, K.B., 2004. The Genetic Algorithm for Solving the Dial-A-Ride Problem. Master thesis, Technical University of Denmark.
3. Wolfler Calvo R., Colorni A. An effective and fast heuristic for the Dial-a-Ride problem 2006, 4 or 5(1):61-73.
4. Cordeau J.-F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 2006, 54(3):573-586.
5. Cordeau J.-F., Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 2003, 37(6):579-594.
6. Cordeau J.-F., Laporte G. The dial-a-ride problem: models and algorithms. Annals of Operations Research 2007, 153(1):29-46.
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 1986, 6:301-325.
8. Diana M., Dessouky M.M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B 2004, 38(6):539-557.
9. Diana M., Dessouky M.M., Xia N. A model for the fleet sizing of demand responsive transportation services with time windows. Transportation Research Part B 2006, 40(8):651-666.
10. Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal Of Operational Research 1991, 54(1):7-22.
11. Gendreau M. An introduction to Tabu Search. Handbook of Metaheuristics 2003, 57:37-54.
12. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 1986, 13(5):533-549.
13. Ioachim I., Desrosiers J., Dumas Y., Solomon M.M., Villeneuve D. A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 1995, 29(1):63-78.
14. Jaw J.-J., Odoni A., Psaraftis H.N., Wilson N.H. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B 1986, 2(3):243-257.
15. Jorgensen R.M., Larsen J., Bergvinsdottir K.B. Solving the Dial-a-Ride problem using genetic algorithms. Journal of the Operational Research Society 2006, 58(10):1321-1331.
16. Labadie N., Mansini R., Melechovský J., Wolfler Calvo R. The team orienteering problem with time windows: an LP-based granular variable neighborhood search. European Journal of Operational Research 2012, 220(1):15-27.
17. Lu Q., Dessouky M.M. A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. European Journal Of Operational Research 2006, 175(2):672-687.
18. 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 1995, 60(1):193-208.
19. Miller C.E., Tucker A.W., Zemlin R.A. Integer programming formulations and traveling salesman problems. Journal of the ACM 1960, 7(4):326-329.
20. Paquette J., Cordeau J.-F., Laporte G., Pascoal M.M.B. Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Research Part B 2013, 52:1-16.
21. Parragh S.N., Schmid V. Hybrid column generation and large neighborhood search for the dial-a-ride problem. Computers & Operations Research 2012, 40(1):490-497.
22. Parragh S.N., Doerner K.F., Hartl R.F. A survey on pickup and delivery problems part II: transportation between pickup and delivery locations. Journal für Betriebswirtschaft 2008, 2(58):81-117.
23. Parragh S.N., Doerner K.F., Hartl R.F. Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 2010, 37(6):1129-1138.
24. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 1983, 17(3):351-357.
25. Savelsbergh M.W.P. Local search in routing problems with time windows. Annals of Operations Research 1985, 4(1):285-305.
26. Sexton T.R., Choi Y.M. Pickup and delivery of partial loads with soft time windows. American Journal of Mathematical and Management Sciences 1986, 6(3-4):369-398.
27. Taillard E. Parallel iterative search methods for vehicle routing problems. Networks 1993, 23(8):661-673.
28. Toth P., Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 1997, 31(1):60-71.
29. Toth P., Vigo D. The Granular Tabu Search and its application to the vehicle-routing problem. INFORMS Journal on Computing 2003, 15(4):333-346.