A robust solution approach to the dynamic vehicle scheduling problem

Transportation Science

Volumn 38, Issue 4, 2004, Pages 447-458

  Huisman, Dennis ^a   Freling, Richard ^a   Wagelmans, Albert P M ^a  

^a ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Dynamic scheduling; Public transport; Stochastic travel times; Vehicle scheduling

Indexed keywords

HEURISTIC METHODS; MASS TRANSPORTATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING; SENSITIVITY ANALYSIS;

DYNAMIC SCHEDULING; PUBLIC TRANSPORT; STOCHASTIC TRAVEL TIMES; VEHICLE SCHEDULING;

OPERATIONS RESEARCH;

EID: 10644286621     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.1030.0069     Document Type: Article

References (17)

1. Bertossi, A. A., P. Carraresi, G. Gallo. 1987. On some matching problems arising in vehicle scheduling models. Networks 17 271-281.
2. Daduna, J. R., M. Mojsilovic, P. Schütze. 1993. Practical experiences using an interactive optimization procedure for vehicle scheduling. D.-Z. Du, P. M. Pardalos, eds. Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific, Singapore, 37-52.
3. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science, Vol. 8. Network Routing, North-Holland, Amsterdam, The Netherlands, 35-139.
4. Freling, R., J. M. Pinto Paixão, A. P. M. Wagelmans. 2001. Models and algorithms for single-depot vehicle scheduling. Transportation Sci. 35 165-180.
5. Haase, K., G. Desaulniers, J. Desrosiers. 2001. Simultaneous vehicle and crew scheduling in urban mass transit systems. Transportation Sci. 35 286-303.
6. Ichoua, S., M. Gendreau, J.-Y. Potvin. 2000. Diversion issues in real-time vehicle dispatching. Transportation Sci. 34 426-438.
7. Lamatsch, A. 1992. An approach to vehicle scheduling with depot capacity constraints. M. Desrochers, J.-M. Rousseau, eds. Computer-Aided Transit Scheduling. Springer Verlag, Berlin, Germany, 181-195.
8. Laporte, G., F. V. Louveaux. 1998. Solving stochastic routing problems with the integer L-shaped method. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Boston, MA, 159-167.
9. Löbel, A. 1997. Optimal vehicle scheduling in public transit. Unpublished doctoral dissertation, Technische Universität Berlin, Berlin, Germany.
10. Madsen, O. B. G., H. F. Ravn, J. M. Rygaard. 1995. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives. Ann. Oper. Res. 60 193-208.
11. Mesquita, M., J. Paixão. 1999. Exact algorithms for the multiple-depot vehicle scheduling problem based on multicommodity network flow type formulations. N. H. M. Wilson, ed. Computer-Aided Transit Scheduling. Springer Verlag, Berlin, Germany, 223-246.
12. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. M. O. Ball, T. L. Magnanti, C. L. Monma,
13. G. L. Nemhauser, eds. Handbooks in Operations Research and Management Science, Vol. 8. Network Routing, North-Holland, Amsterdam, The Netherlands, 141-295.
14. Powell, W. B., M. T. Towns, A. Marar. 2000. On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of noncompliance. Transportation Sci. 34 67-85.
15. Ribeiro, C. C., F. Soumis. 1994. A column generation approach to the multiple-depot vehicle scheduling problem. Operations Res. 42 41-52.
16. Sleator, D. D., R. E. Tarjan. 1985. Amortized efficiency of list update and paging rules. Com. ACM 28 202-208.
17. Yen, J. W., J. R. Birge. 2002. A stochastic programming approach to the airline crew scheduling problem. Technical report, Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL.