Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems

References

  • Ball M., Bodin L., Dial R. A matching based heuristic for scheduling mass transit crews and vehicles. Transportation Sci. (1983) 17:4–31LinkGoogle Scholar
  • Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329LinkGoogle Scholar
  • Bertossi A. A., Carraresi P., Gallo G. On some matching problems arising in vehicle scheduling models. Networks (1989) 17:271–281CrossrefGoogle Scholar
  • Dell'Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. (1993) 39:115–125LinkGoogle Scholar
  • Desaulniers G., Desrosiers J., Dumas Y., Marc S., Rioux B., Solomon M. M., Soumis F. Crew Pairing at Air France. Eur. J. Oper. Res. (1997) 97:245–259CrossrefGoogle Scholar
  • Desaulniers G., Desrosiers J., Ioachim I., Solomon M. M., Soumis F., Villeneuve D., Crainic T. G., Laporte G. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Fleet Management and Logistics (1998) (Kluwer, Norwell, MA) 57–93CrossrefGoogle Scholar
  • Desrochers M. La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes. (1986) (Universitéde Montréal, Montréal, Canada (In French.)) . Ph.D. thesisGoogle Scholar
  • Desrochers M., Gilbert J., Sauvé M., Soumis F., Desrochers M., Rousseau J.-M. CREW-OPT: Subproblem modeling in a column generation approach to urban crew scheduling. Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386 (1992) (Springer-Verlag, Berlin, Germany) 395–406CrossrefGoogle Scholar
  • Desrochers M., Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Sci. (1989) 23:1–13LinkGoogle Scholar
  • Desrosiers J., Dumas Y., Solomon M. M., Soumis F., Ball et al M. O. Time constrained routing and scheduling. Network Routing. Handbooks in Operations Research and Management Science 8 (1995) (Elsevier Science,Amsterdam, The Netherlands)35–139Google Scholar
  • Desrosiers J., Soumis F., Desrochers M. Routing with time windows by column generation. Networks (1984) 14:545–565CrossrefGoogle Scholar
  • Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. Eur. J. Oper. Res. (1991) 54:7–22CrossrefGoogle Scholar
  • du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilized column generation. Discrete Math. (1999) 194:229–237CrossrefGoogle Scholar
  • Fischetti M., Martello S., Toth P. The fixed job schedule problem with working-time constraints. Oper. Res. (1989) 37:395–403LinkGoogle Scholar
  • Ford L., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Freling R. Models and techniques for integrating vehicle and crew scheduling. Tinbergen Inst. Res. Ser. 157 (1997) (Amsterdam). Thesis PublishersGoogle Scholar
  • Freling R., Boender G., Paixão A. An integrated approach to vehicle and crew scheduling. (1995) (Erasmus University, Rotterdam, The Netherlands). Report 9503/AGoogle Scholar
  • Freling R., Wagelmans A. P. M., Paixão A., Wilson N. H. M. An overview of models and techniques for integrating vehicle and crew scheduling. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 471 (1999) (Springer, Berlin, Germany) 441–460CrossrefGoogle Scholar
  • Gamache M., Soumis F., Marquis G., Desrosiers J. A column generation approach for large scale aircrew rostering problems. Oper. Res. (1999) 47:247–263LinkGoogle Scholar
  • Gamache M., Soumis F., Villeneuve D., Desrosiers J., Gélinas E. The preferential bidding system at Air Canada. Transportation Sci. (1998) 32:246–255LinkGoogle Scholar
  • Haase K., Friberg C., Wilson N. H. M. An exact branch and cut algorithm for the vehicle and crew scheduling problem. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 471 (1999) (Springer, Berlin, Germany) 63–80Google Scholar
  • Hoffman K. L., Padberg M. Solving airline crew scheduling problems by branch-and-cut. Management Sci. (1993) 39:657–682LinkGoogle Scholar
  • Klabjan D. Topics in airline crew scheduling and large optimization. (2000) (Georgia Institute of Technology, Atlanta, GA) . Ph.D. thesisGoogle Scholar
  • Löbel A., Wilson N. H. M. Recent computational developments for large-scale multiple-depot vehicle scheduling problems. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 471 (1999) (Springer, Berlin, Germany) 193–220CrossrefGoogle Scholar
  • Mingozzi A., Boschetti M., Ricciardelli S., Bianco L. A set partitioning approach to the crew scheduling problem. Oper. Res. (1999) 47:873–888LinkGoogle Scholar
  • Patrikalakis I., Xerocostas D., Desrochers M., Rousseau J.-M. A new decomposition scheme of the urban public transport scheduling problem. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 386 (1992) (Springer-Verlag, Berlin, Germany) 407–425CrossrefGoogle Scholar
  • Ribeiro C. C., Soumis F. A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. (1994) 42:41–52LinkGoogle Scholar
  • Ryan D. M., Foster B. A., Wren A. An integer programming approach to scheduling. Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling (1981) (North-Holland, Amsterdam, The Netherlands)269–280Google Scholar
  • Tosini E., Vercellis C., Daduna J. R., Wren A. An interactive system for extra-urban vehicle and crew scheduling problems. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems 308 (1988) (Springer-Verlag, Berlin, Germany) 41–53CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.