A Robust Solution Approach to the Dynamic Vehicle Scheduling Problem

References

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