A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows

Transportation Research Part B: Methodological

Volumn 38, Issue 6, 2004, Pages 539-557

  Diana, Marco ^a   Dessouky, Maged M ^b  

^a POLITECNICO DI TORINO   (Italy)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Dial a ride problem; Heuristics; Paratransit services; Public transportation

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; HEURISTIC METHODS; HIGHWAY TRAFFIC CONTROL;

PARATRANSIT SERVICE; ROUTE INITIALIZATION PROCEDURE;

MOTOR TRANSPORTATION;

ALGORITHM; HEURISTICS; PUBLIC TRANSPORT; TRANSPORTATION PLANNING;

CALIFORNIA; LOS ANGELES COUNTY; NORTH AMERICA; UNITED STATES;

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

References (45)

1. Bodin L. Sexton T. The multi-vehicle subscriber dial-a-ride problem TIMS Studies in the Management Sciences 22 1986 73-86
2. Borndörfer R. Grötschel M. Klosteimer F. Küttner C. Telebus Berlin: Vehicle scheduling in a dial-a-ride system Lecture Notes in Economics and Mathematical Systems 471: Computer-Aided Transit Scheduling 1999 391-422 Springer-Verlag Berlin
3. Caseau Y. Laburthe F. Heuristics for large constrained vehicle routing problems Journal of Heuristics 5 1999 281-303
4. Cervero R. Paratransit in America--Redefining Mass Transportation 1997 Praeger Westport
5. Daganzo C. An approximate analytic model of many-to-many demand responsive transportation systems Transportation Research 12 1978 325-333
6. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F., 2000. The VRP with Pickup and Delivery. Cahiers du GERAD G-2000-25, Ecole des Hautes Etudes Commerciales, Montréal
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 6 1986 301-325
8. Desrosiers J. Dumas Y. Soumis F. The multiple dial-a-ride problem Lecture Notes in Economics and Mathematical Systems 308: Computer-Aided Transit Scheduling 1988 Springer Berlin
9. 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
10. Dial R.B. Autonomous dial-a-ride transit: Introductory overview Transportation Research C 3C 1995 261-275
11. Diana, M., 2003. Methodologies for the Tactical and Strategic Design of Large-Scale Advance-Request and Real-Time Demand Responsive Transit Services. Ph.D. Dissertation, Politecnico di Torino, Dipartimento di Idraulica, Trasporti e Infrastrutture Civili, Torino, Italy
12. Dumas Y. Desrosiers J. Soumis F. The pickup and delivery problem with time windows European Journal of Operational Research 54 1991 7-22
13. Fisher M.L. Jaikumar R. A generalized assignment heuristic for vehicle routing Networks 11 1981 109-124
14. Fu L. A simulation model for evaluating advanced dial-a-ride paratransit systems Transportation Research A 36A 2002 291-307
15. Healy P. Moll R. A new extension of local search applied to the dial-a-ride problem European Journal of Operational Research 83 1995 83-104
16. Horn M.E.T. Multi-modal and demand-responsive passenger transport systems: A modelling framework with embedded control systems Transportation Research A 36A 2002 167-188
17. Horn M.E.T. Fleet scheduling and dispatching for demand-responsive passenger services Transportation Research C 10C 2002 35-63
18. Ioachim I. Desrosiers J. Dumas Y. Solomon M.M. Villeneuve D. A request clustering algorithm for door-to-door handicapped transportation Transportation Science 29 1995 63-78
19. Jaw J.J. Odoni A.R. Psaraftis H.N. Wilson N.H.M. A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem Transportation Research B 20B 1986 243-257
20. Kontoravdis G. Bard J.F. A GRASP for the vehicle routing and scheduling problem with time windows ORSA Journal of Computing 7 1995 10-23
21. Lave, R.E., Teal, R., Piras, P., 1996. A handbook for acquiring demand-responsive transit software, Transit Cooperative Research Program Report #18, Transportation Research Board, Washington, DC
22. Liu F.H. Shen S.Y. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows European Journal of Operational Research 118 1999 485-504
23. Lu, Q., Dessouky, M., forthcoming. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science
24. Madsen O.B.G. Raven 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 60 1995 193-208
25. Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points Transportation Research A 23A 1989 377-386
26. Nanry W.P. Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search Transportation Research B 34B 2000 107-121
27. Potvin J.Y. Rousseau J.M. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows European Journal of Operational Research 66 1993 331-340
28. Psaraftis H.N. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem Transportation Science 14 1980 130-154
29. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows Transportation Science 17 1983 351-357
30. Psaraftis H.N. k-interchange procedures for local search in a precedence-constrained routing problem European Journal of Operational Research 13 1983 391-402
31. 2) heuristic for the single vehicle many-to-many euclidean dial-a-ride problem Transportation Research B 17B 1983 133-145
32. Psaraftis H.N. Scheduling large-scale advance-request dial-a-ride systems American Journal of Mathematical and Management Sciences 6 1986 327-367
33. Ruland K.S. Rodin E.Y. The pickup and delivery problem: Faces and branch-and-cut algorithm Computers and Mathematics with Applications 33 1997 1-13
34. Russell R.A. Hybrid heuristics for the vehicle routing problem with time windows Transportation Science 29 1995 156-166
35. Savelsbergh M.W.P. Sol M. The general pickup and delivery problem Transportation Science 29 1995 17-29
36. Savelsbergh M.W.P. Sol M. DRIVE: Dynamic routing of independent vehicles Operations Research 46 1998 474-490
37. Sexton T.R. Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: 1. Scheduling Transportation Science 19 1985 378-410
38. Sexton T.R. Bodin L.D. Optimizing single vehicle many-to-many operations with desired delivery times: 2. Routing Transportation Science 19 1985 411-435
39. Sexton T.R. Choi Y. Pickup and delivery of partial loads with soft time windows American Journal of Mathematical and Management Sciences 6 1986 369-398
40. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time windows constraints Operations Research 35 1987 254-265
41. Stein D.M. Scheduling dial-a-ride transportation problems Transportation Science 12 1978 232-249
42. Stein D.M. An asymptotic probabilistic analysis of a routing problem Mathematics of Operations Research 3 1978 89-101
43. Teodorovich D. Radivojevic G. A fuzzy logic approach to dynamic dial-a-ride problem Fuzzy Sets and Systems 116 2000 23-33
44. Toth P. Vigo D. Heuristic algorithms for the handicapped persons transportation problem Transportation Science 31 1997 60-71
45. Van Der Bruggen L.J.J. Lenstra J.K. Schuur P.C. Variable-depth search for the single-vehicle pickup and delivery problem with time windows Transportation Science 27 1993 298-311