Large neighborhood search for dial-a-ride problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6876 LNCS, Issue , 2011, Pages 400-413

  Jain, Siddhartha ^a   Van Hentenryck, Pascal ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX OPTIMIZATION; CONSTRAINT PROGRAMMING; CONSTRAINT-BASED; DIAL-A-RIDE PROBLEM; EXPERIMENTAL EVIDENCE; HIGH-QUALITY SOLUTIONS; LARGE NEIGHBORHOOD SEARCH; STATE OF THE ART; STATE-OF-THE-ART APPROACH; URBAN TRANSPORTATION; VARIABLE NEIGHBORHOOD SEARCH; COMPLEX OPTIMIZATION PROBLEMS;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; TABU SEARCH;

TABU SEARCH; URBAN TRANSPORTATION;

EID: 80053035016     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23786-7_31     Document Type: Conference Paper

References (13)

1. Baugh, J., John, W.K., Reddy, G.K., Stone, J.R.: Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization 30, 91-123 (1998)
2. Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33, 875-893 (2006)
3. Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38, 515-530 (2004)
4. Berbeglia, G., Cordeau, J.-F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. Submitted to INFORMS Journal on Computing (2010)
5. Berbeglia, G., Pesant, G., Rousseau, L.-M.: Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science (2010)
6. Berbeglia, G., Pesant, G., Rousseau, L.-M.: Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Submitted to Transportation Science (2010)
7. Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological 37(6), 579-594 (2003)
8. Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research 153, 29-46 (2007), 10.1007/s10479-007-0170-8
9. Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65(1-3), 223-253 (1996); First International Colloquium on Graphs and Optimization
10. Jorgensen, R.M., Larsen, J., Bergvinsdottir, K.B.: Solving the dial-a-ride problem using genetic algorithms. Journal of the Operational Research Society 58(11), 1321-1331 (2007)
11. Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 37(6), 1129-1138 (2010)
12. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417-431. Springer, Heidelberg (1998)
13. Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 60-71 (1997)