Hybrid scheduling methods for paratransit operations

Computers and Industrial Engineering

Volumn 45, Issue 1, 2003, Pages 75-96

  Aldaihani, Majid ^a   Dessouky, Maged M ^b  

^a KUWAIT UNIVERSITY   (Kuwait)

^b University of Southern California   (United States)

Author keywords

Dial a ride; Heuristic; Hybrid systems

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INDUSTRIAL ENGINEERING; PROBLEM SOLVING;

HYBRID SCHEDULING METHODS;

SCHEDULING;

EID: 0038581771     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(03)00032-9     Document Type: Article

References (28)

1. Badeau P., Buertin F., Gendreau M., Potvin J.-Y., Taillard E. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research Part C. 5:1997;109-122.
2. Chira-Chavala R., Venter C. Cost and productivity impacts of a smart paratransit system. Transportation Research Record. 1571:1997;81-87.
3. 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 Science. 6:1986;301-325.
4. Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal of Operations Research. 54:1991;7-22.
5. Fischetti M., Toth P. An additive bounding procedure for combinatorial optimization problems. Operations Research. 37:1989;319-328.
6. Hickman M., Blume K. 8th International Conference on Computer-Aided Scheduling of Public Transport (CASPT), Washington, DC. Washington, DC. 2000.
7. Higgins L., Laughlin J.B., Turnbull K. Proceedings of the 2000 Transportation Research Board Conference, Washington, DC. Proceedings of the 2000 Transportation Research Board Conference, Washington, DC. 2000.
8. 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.
9. 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 with time windows. Transportation Research Part B. 20:1986;243-257.
10. Kalantari B., Hill A.V., Arora S.R. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operations Research. 22:1985;377-386.
11. Khattak A., Hickman M. Automatic vehicle location and computer aided dispatch systems: Commercial availability and deployment in transit agencies. Journal of Public Transportation. 2:1998;1-26.
12. 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.
13. Levine C.J. ADA and the demand for paratransit. Transportation Quarterly. 51:1997;29-43.
14. Lewis D., Evans T., Koffman D. Impact of reliability on paratransit demand and operating costs. Transportation Planning and Technology. 21:1998;323-346.
15. Liaw C., White C., Bander J. A decision support system for the bimodal dial-a-ride problem. IEEE Transactions on System, Man, and Cybernetics. 26:1996;552-565.
16. 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.
17. Nanry W.P., Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B. 34:2000;107-121.
18. Psaraftis H. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science. 14:1980;130-154.
19. Psaraftis H. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science. 17:1983;351-357.
20. Rardin R. Optimization in operations research. 1998;Prentice Hall, Upper Saddle River, NJ.
21. Rochat Y., Taillard E. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
22. Ruland K.S., Rodin E.Y. The pickup and delivery problem: Faces and branch-and-cut algorithm. Computers Mathematics Application. 33:1997;1-13.
23. Savelsbergh M.W.P., Sol M. The general pickup and delivery problem. Transportation Science. 29:1995;17-29.
24. Savelsbergh M.W.P., Sol M. DRIVE: Dynamic routing of independent vehicles. Operations Research. 46:1998;474-490.
25. Stone J.R., Nalevanko A.M., Gilbert G. Computer dispatch and scheduling for paratransit: An application of advanced public transportation systems. Transportation Quarterly. 48:1994;173-184.
26. Taillard E., Badeau P., Gendreau M., Guertin F., Potvin J. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science. 31:1997;170-186.
27. Toth P., Vigo D. Heuristic algorithms for the handicapped person transportation problem. Transportation Science. 31:1997;60-71.
28. Wallace R.R. Paratransit customer: Modeling elements of satisfaction with service. Transportation Research Record. 1571:1997;59-66.