A rejected-reinsertion heuristic for the static Dial-A-Ride Problem

Transportation Research Part B: Methodological

Volumn 41, Issue 7, 2007, Pages 736-755

  Luo, Ying ^a   Schonfeld, Paul ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Dial A Ride; Heuristic algorithm; Paratransit service; Public transportation; Scheduling

Indexed keywords

COMPUTATIONAL EFFICIENCY; CONSTRAINED OPTIMIZATION; HEURISTIC ALGORITHMS; OPERATIONS RESEARCH; SCHEDULING ALGORITHMS;

REJECTED-REINSERTION HEURISTIC; SERVICE QUALITY CONSTRAINTS; VEHICLE REDUCTION;

VEHICLE ROUTING;

HEURISTICS; LOCATION DECISION; PUBLIC TRANSPORT; TRAFFIC MANAGEMENT; TRAVEL BEHAVIOR; TRAVEL TIME;

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

References (35)

1. Attanasio A., Cordeau J.F., Ghiani G., and Laporte G. Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Computing 30 (2004) 377-387
2. Baugh J.W., Kakivaya G.K.R., and Stone J.R. Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Engineering Optimization 30 (1998) 91-123
3. Bodin L.D., Golden B., Assad A., and Ball M. Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research 10 2 (1983) 63-211
4. Bodin L.D., and Sexton T. The multi-vehicle subscriber dial-a-ride problem. TIMS Studies in the Management Sciences 22 (1986) 73-86
5. Borndorfer R., Grotschel M., Klostermeier F., and Kuttner C. Telebus Berlin: vehicle scheduling in a dial-a-ride system. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems vol. 471 (1997), Springer-Verlag, Berlin 391-422
6. Campbell A.M., and Savelsbergh M. Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science 38 3 (2004) 369-378
7. Cordeau J.F., and Laporte G. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B 37 (2003) 579-594
8. Desaulniers G., Desrosiers J., Erdmann A., Solomon M.M., and Soumis F. VRP with pickup and delivery. In: Toth P., and Vigo D. (Eds). The Vehicle Routing Problem (2002), SIAM Monographs on Discrete Mathematics and Applications, Philadelphia 225-242
9. Desrosiers J., Dumas Y., Solomon M.M., and Soumis F. Time constrained routing and scheduling. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Network Routing, Handbooks in Operations Research and Management Science vol. 8 (1995), Elsevier Science, Amsterdam 35-139
10. Desrosiers J., Dumas Y., and 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
11. Desrosiers J., Dumas Y., and Soumis F. The multiple vehicle dial-a-ride problem. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical System vol. 308 (1988), Springer, Berlin 15-27
12. Dessouky, M., Adam, S., 1998. Real-time scheduling of demand responsive transit service - final report. University of Southern California, Department of Industrial and Systems Engineering, Los Angeles.
13. Dessouky M., Rahimi M., and Weidner M. Jointly optimizing cost, service, and environmental performance in demand-responsive transit scheduling. Transportation Research Part D 8 (2003) 433-465
14. Diana M., and Dessouky M.M. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research Part B 38 6 (2004) 539-557
15. Fu L. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transportation Research Part B 36 (2002) 485-506
16. Fu L. Analytical model for paratransit capacity and quality-of-service analysis. Transportation Research Record 1841 (2003) 81-89
17. Hart S.M. The modeling and solution of a class of dial-a-ride problems using simulated annealing. Control and Cybernetics 25 1 (1996) 131-157
18. Ioachim I., Desrosiers J., Dumas Y., Solomon M.M., and Villeneuve D. A request clustering algorithm for door-to-door handicapped transportation. Transportation Science 29 1 (1995) 63-78
19. Jaw, J.J., 1984. Heuristic algorithms for multi-vehicle, advance-request dial-a-ride problems. Ph.D. Dissertation, Department of Aeronautics and Astronautics, MIT, Cambridge, MA.
20. Jaw J.J., Odoni A.R., Psaraftis H.N., and Wilson N.H.M. A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time windows. Transportation Research Part B 20 3 (1986) 243-257
21. Kikuchi S., and Rhee J.H. Scheduling method for demand-responsive transportation system. Journal of Transportation Engineering 115 6 (1989) 630-645
22. Luo, Y., 2006. Heuristics and performance metamodels for the dynamic dial-a-ride problem. Ph.D. Dissertation, Department of Civil and Environmental Engineering, University of Maryland, College Park.
23. Madsen O.B.G., Ravn H.F., and Rygaard J.M. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60 (1995) 193-208
24. Mitrovic-Minic, S., 2001. The dynamic pickup and delivery problem with time windows. Ph.D. Dissertation, School of Computing Science, Simon Fraser University, Burnaby, Canada.
25. Potvin J.Y., and Rousseau J.M. Constraint-directed search for the advanced request dial-a-ride problem with service quality constraint. In: Balci O., Sharda R., and Zenios S.A. (Eds). Computer Science and Operations Research: New Developments in Their Interfaces (1992), Pergamon Press, Oxford, England 457-474
26. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 2 (1980) 130-154
27. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17 3 (1983) 351-357
28. 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transportation Research Part B 17 (1983) 133-145
29. Savelsbergh M.W.P., and Sol M. The general pickup and delivery problem. Transportation Science 29 1 (1995) 17-29
30. Sexton T., and Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: I. scheduling. Transportation Science 19 (1985) 378-410
31. Sexton T., and Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: II. routing. Transportation Science 19 (1985) 411-435
32. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 2 (1987) 254-265
33. Toth P., and Vigo D. Fast local search algorithms for the handicapped persons transportation problem. In: Osman I.H., and Kelly J.P. (Eds). Meta-Heuristics: Theory and Applications (1996), Kluwer, Boston 677-690
34. Toth P., and Vigo D. Heuristic algorithms for the handicapped persons transportation problem. Transportation Science 31 1 (1997) 60-71
35. Van Der Bruggen L.J.J., Lenstra J.K., and Schuur P.C. Variable-depth search for the single-vehicle pickup and delivery problem with time windows. Transportation Science 27 3 (1993) 298-311