A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

References

• Ahuja R.K., Magnanti T.L., Orlin J.B.Network Flows (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Alon N. Generating pseudo-random permutations and maximum flow algorithms. Inform. Processing Lett. (1990) 35:201–204Crossref, Google Scholar
• Ascheuer N., Fischetti M., Grötschel M. A polyhedral study of the asymmetric travelling salesman problem with time windows. Networks (2000) 36(2):69–79Crossref, Google Scholar
• Barnhart C., Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P., Vance P.H., Birge J.R., Murthy K.G. Branch-and-price: Column generation for solving huge integer programs. Mathematical Programming: State of the Art 1994 (1994) (The University of Michigan, Ann Arbor, MI) 186–207Google Scholar
• Beasley J.E., Cao B. A tree search algorithm for the crew scheduling problem. Eur. J. Oper. Res. (1996) 94:517–526Crossref, Google Scholar
• Beasley J.E. A dynamic programming based algorithm for the crew scheduling problem. Compute. Oper. Res. (1998) 25:567–582Crossref, Google Scholar
• Bianco L., Mingozzi A., Ricciardelli S. A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods Software (1994) 3:163–194Crossref, Google Scholar
• Caprara A., Fischetti M., Dell'Amico M., Maffioli F., Martello S. Branch-and-cut algorithms. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, U.K.) Google Scholar
• Carpaneto G., Martello S., Toth P., Simeone B., Toth P., Gallo G., Maffioli F., Pallottino S. Algorithms and codes for the assignment problem. FORTRAN Codes for Network Optimization (1988) (J.C. Baltzer, AG, Basel) Crossref, Google Scholar
• Carpaneto G., Dell'Amico M., Fischetti M., Toth P. A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks (1989) 19:531–548Crossref, Google Scholar
• Cheriyan J., Maheshwari S.N. Analysis of preflow push algorithms for maximum network flow. SIAM. J. Comput. (1989) 18:1057–1086Crossref, Google Scholar
• Dell'Amico M., Fischetti M., Toth P. Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Sci. (1993) 39(1):115–125Link, Google Scholar
• Desrosiers J., Dumas Y., Solomon M.M., Soumis F., Ball M.O., et al. Time constrained routing and scheduling. Handbooks in OR … MS (1995) 8(Elsevier Science)35–139Google Scholar
• Du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilisation dans le cadre de la gánáration de colonnes. Les Cahiers du GERAD (1997) . G-97-08Google Scholar
• Fischetti M., Toth P. A polyhedral approach to the asymmetric traveling salesman problem. Management Sci. (1997) 43:1520–1536Link, Google Scholar
• Fischetti M., Martello S., Toth P. The fixed job schedule problem with spread-time constraints. Oper. Res. (1987) 35:849–858Link, Google Scholar
• Fischetti M., Martello S., Toth P. The fixed job schedule problem with working-time constraints. Oper. Res. (1989) 37:395–403Link, Google Scholar
• Fischetti M., Martello S., Toth P., Vigo D.An LP-based heuristic approach to the crew scheduling problem (1998) Proc. TRISTAN III(San Juan, PR)Google Scholar
• Forbes M.A., Holt J.N., Watts A.M. An exact algorithm for the multiple depot bus scheduling problem. Eur. J. Oper. Res. (1994) 72(1):115–124Crossref, Google Scholar
• Goldberg A.V., Tarjan R.E. A new approach to the maximum flow problem. Proc. 18th ACM Sympos. Theory Comput. (1986) 136–146Full paper in J. ACM 35 1988,921-940Google Scholar
• Löbel A.Optimal vehicle schedule in public transport (1997) . Ph.D. dissertationGoogle Scholar
• Löbel A. Vehicle scheduling in public transit and Lagrangean pricing. Management Sci. (1998) 44(12):1637–1649Link, Google Scholar
• Lodi A.Algorithms for two-dimensional bin packing and assignment problem (2000) . Ph.D. dissertationGoogle Scholar
• Mingozzi A., Boschetti M., Ricciardelli S., Bianco L. A set partitioning approach to the crew scheduling problem. Oper. Res. (1999) 47:873–888Link, Google Scholar
• Padberg M.W., Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. (1991) 33:60–100Crossref, Google Scholar
• Reinelt M.Private communication (1997) Google Scholar
• Ribeiro C.C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. (1994) 42:41–52Link, Google Scholar
• Savelsbergh M.Private communication (1998) Google Scholar
• Soumis F., Dell'Amico M., Maffioli F., Martello S. Decomposition and column generation. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, U.K.) 115–126Google Scholar