The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services

Journal of Advanced Transportation

Volumn 40, Issue 1, 2006, Pages 23-46

  Diana, Marco ^a  

^a UNIVERSITÉ GUSTAVE EIFFEL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; INFORMATION MANAGEMENT; MOTOR TRANSPORTATION; REAL TIME SYSTEMS;

COMPUTATIONAL CYCLE TIME; INFORMATION FLOW; TRANSPORT SERVICES;

INFORMATION ANALYSIS;

EID: 29544443938     PISSN: 01976729     EISSN: None     Source Type: Journal    
DOI: 10.1002/atr.5670400103     Document Type: Review

References (30)

1. Colorni, A., Righini, G., 2001. Modeling and optimizing dynamic dial-a-ride problems. International Transactions in Operational Research 8, 155-166.
2. Dessouky, M.M., Adam, S., 1998a. Real-time scheduling of demand responsive transit service - Final report. University of Southern California, Department of Industrial and Systems Engineering, Los Angeles.
3. Dessouky, M.M., Adam, S., 1998b. Real-time scheduling rules for demand responsive transit systems. Proceedings of the 1998 IEEE International Conference on Systems, Man and Cybernetics, New York, 2956-2961 vol. 3.
4. Dial, R.B., 1995. Autonomous Dial-a-Ride Transit: Introductory overview. Transportation Research 3C, 261-275.
5. 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.
6. Diana, M., Dessouky, M.M., 2004. A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research 38B, 539-557.
7. Fu, L., 1999a. Improving paratransit scheduling by accounting for dynamic and stochastic variations in travel time. Transportation Research Record 1666, Transportation Research Board, National Academic Press, Washington, D.C., 74-81.
8. Fu, L., 1999b. On-line and off-line routing and scheduling of dial-a-ride paratransit vehicles. Computer-aided Civil and Infrastructure Engineering 14, 309-319.
9. Fu, L., 2001. Simulation model for evaluating intelligent paratransit systems. Transportation Research Record 1760, Transportation Research Board, National Academic Press, Washington, D.C., 93-99.
10. Fu, L., 2002. Scheduling dial-a-ride paratransit under time varying, stochastic congestion. Transportation Research 36B, 485-506.
11. Fu, L. and Xu, Y. 2001. Potential effects of automatic vehicle location and computer-aided dispatch technology on paratransit performance. Transportation Research Record 1760, Transportation Research Board, National Academic Press, Washington, D.C., 107-113.
12. Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E., 1999. Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33, 381-390.
13. Horn, M.E.T., 2002. Fleet scheduling and dispatching for demand-responsive passenger services. Transportation Research 10C, 35-63.
14. Ichoua, S., Gendreau. M., Potvin, J.Y., 2000. Diversion issues in real-time vehicle dispatching. Transportation Science 34, 426-438.
15. Ichoua, S., Gendreau. M., Potvin, J.Y., 2003. Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144, 379-396.
16. Jaw, J.J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M., 1986. A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem. Transportation Research 20B, 243-257.
17. Jih, W.-r., Hsu, J.Y.-j., 1999. Dynamic vehicle routing using hybrid genetic algorithms. Proceedings of the 1999 IEEE International Conference on Robotics & Automation, Detroit, Michigan, 453-458.
18. Larsen, A., Madsen, O., Solomon, M., 2002. Partially dynamic vehicle routing - models and algorithms. Journal of the Operational Research Society 53, 637-646.
19. Madsen, O.B.G., Ravn, H.F., Rygaard, J.M., 1995. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research 60, 193-208.
20. Mitrović-Minić, S. and Laporte, G., 2004. Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research 38B, 635-655.
21. Mitrović-Minić, S., Krishnamurti, R. and Laporte, 2004. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transportation Research 38B, 669-685.
22. Powell, W., 1988. A comparative review of alternative algorithms for the dynamic vehicle allocation problem. Vehicle routing: methods and studies, B.L. Golden, A.A. Assad (eds.). North-Holland, Amsterdam, 249-291.
23. Powell, W., Jaillet, P., Odoni, A., 1995. Stochastic and dynamic networks and routing. Handbooks in Operations Research and Management Science, vol. 8: Network Routing, M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (eds.). North-Holland, Amsterdam, 141-295.
24. Psaraftis, H.N., 1988. Dynamic vehicle routing problems. Vehicle Routing: methods and studies, B.L. Golden, A.A. Assad (eds.). North-Holland, Amsterdam, 223-248.
25. Psaraftis, H.N., 1995. Dynamic vehicle routing: status and prospects. Annals of Operations Research 61, 143-164.
26. Regan, A.C., Mahmassani, H.S., Jaillet, P., 1996. Dynamic decision making for commercial fleet operations using real-time information. Transportation Research Record 1537, Transportation Research Board, National Academic Press, Washington, D.C., 91-97.
27. Savelsbergh, M.W.P., Sol, M., 1998. DRIVE: dynamic routing of independent vehicles. Operations Research 46, 474-490.
28. Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Operations Research 35, 254-265.
29. Teodorovich, D., Radivojevic, G., 2000. A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets and Systems 116, 23-33.
30. Wilson, N.H.M., Sussman, J.M., Higonnet, B.T. and Goodman, L.A., 1970. Simulation of a computer-aided routing system (CARS). Highway Research Record 318, Highway Research Board, Washington, D.C., 66-76.