Innovative systems for the transportation disadvantaged: Toward more efficient and operationally usable planning tools

Transportation Planning and Technology

Volumn 27, Issue 4, 2004, Pages 315-331

  Diana, Marco ^a  

^a UNIVERSITÉ GUSTAVE EIFFEL   (France)

Author keywords

Demand responsive services; Public transport; Regret insertion heuristics; Routing and scheduling problems

Indexed keywords

AUTOMOBILES; COST BENEFIT ANALYSIS; HEURISTIC METHODS; URBAN PLANNING;

DEMAND RESPONSIVE SERVICES; PUBLIC TRANSPORT;

TRANSPORTATION;

ALGORITHM; INNOVATION; PLANNING METHOD; PUBLIC TRANSPORT; TRANSPORTATION PLANNING;

EID: 5444245205     PISSN: 03081060     EISSN: None     Source Type: Journal    
DOI: 10.1080/0308106042000263087     Document Type: Article

References (16)

1. Desrosiers, J., Dumas, Y. and Soumis, F. (1988) 'The multiple dial-a-ride problem', [i Lecture Notes in Economics and Mathematical Systems i] [b 308 b]: Computer-Aided Transit Scheduling (Springer-Verlag, Heidelberg).
2. Jaw, J.J., Odoni, A.R., Psaraftis, H.H. and Wilson, N.H.M. (1986) 'A heuristic algorithm for the multi-vehicle many-to-many advance request dial-a-ride problem', [i Transportation Research B i] [b 20, b] 243-257.
3. Solomon, M.M. (1987) 'Algorithms for the vehicle routing and scheduling problems with time windows constraints', [i Operations Research i] [b 35, b] 254-265.
4. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M. and Soumis, F. (2000) [i The VRP with pickup and delivery i] (Cahiers du GERAD G-2000-25, Ecole des Hautes Etudes Commerciales, Montréal).
5. Savelsbergah, M.W.P. and Sol, M. (1995) 'The general pickup and delivery problem', [i Transportation Science i] [b 29, b] 17-29.
6. Chiang, W.-C. and Russell, R.A. (1996) 'Simulated annealing metaheuristics for the vehicle routing problem with time windows', [i Annals of Operations Research i] [b 63, b] 3-27.
7. Toth, P. and Vigo, D. (1997) 'Heuristic algorithms for the Handicapped Persons Transportation Problem', [i Transportation Science i] [b 31, b] 60-71.
8. Potvin, J.Y. and Rousseau. J.M. (1993) 'A parallel route building algorithm for the vehicle routing and scheduling problem with time windows', [i European Journal of Operational Research i] [b 66, b] 331-340.
9. Kontoravdis. G. and Bard, J.F. (1995) 'A GRASP for the vehicle routing and scheduling problem with time windows', [i ORSA Journal of Computing i] [b 7, b] 10-23.
10. Liu, F.H. and Shen, S.Y. (1999) 'A route-neighborhood-based metaheuristic for vehicle routing problem with time windows', [i European Journal of Operational Research i] [b 118, b] 485-504.
11. Diana, M. and Dessouky. M. (2004) 'A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows', [i Transportation Research B, i] [b 38, b] 539-557.
12. Dumas, Y., Desrosiers. J. and Soumis, F. (1991) 'The pickup and delivery problem with time windows', [i European Journal of Operational Research i] [b 54, b] 7-22.
13. Madsen, O.B.G., Ravn, H.F. and Rygaard, J.M. (1995) 'A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives', [i Annals of Operations Research i] [b 60, b] 193-208.
14. Desrosiers, J., Dumas, Y., Solomon, M.M. and Soumis, F. (1995) 'Time constrained routing and scheduling', In: M.O. Ball, T.L. Magnanti, C.L. Monma and G.L. Nemhauser (Eds), [i Handbooks in Operations Research and Management Science, i] [b vol. 8 b]: Network Routing (North-Holland, Amsterdam), pp. 35-139.
15. Lu, Q. and Dessouky, M. (2004) 'An exact algorithm for the multiple vehicle pickup and delivery problem', [i Transportation Science, i] in press.
16. Diana, M. (2003) 'Methodologies for the tactical and strategic design of largescale advance-request and real-time demand responsive transit services', PhD thesis (Politecnico di Torino, Dipartimento, di Idraulica, Trasporti e Infrastrutture Civili, Torino).