A Branch-and-Cut Algorithm for the Multiple Depot 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
• Bianco L., Mingozzi A., Ricciardelli S. A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods and Software (1994) 3:163–194Crossref, Google Scholar
• Bodin L., Rosenfield D., Kydes A. UCOST: A micro approach to a transit planning problem. J. Urban Anal. (1978) 5:46–69Google Scholar
• Boschetti M. A., Mingozzi A. New benchmark results for the multiple depot crew scheduling problem. (2001) . Technical report DM-01-10, Dipartimento di Matematica, Universitá degli Studi di Bologna, Bologna, ItalyGoogle Scholar
• Carpaneto D., Dell’Amico M., Fischetti M., Toth P. A branch and bound algorithm for the multiple vehicle scheduling problem. Networks (1989) 19:531–548Crossref, Google Scholar
• Desaulniers G., Lavigne J., Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. (1998a) 111:479–494Crossref, Google Scholar
• Desaulniers G., Desrosiers J., Gamache M., Soumis F., Crainic T. G., Laporte G. Crew scheduling in air transportation. Fleet Management and Logistics (1998b) (Kluwer, Boston, MA) 169–185Crossref, Google 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 (1998c) (Kluwer, Boston, MA) 57–93Crossref, Google Scholar
• Desrosiers J., Dumas Y., Solomon M., Soumis F. Time constrained routing and scheduling. Handbooks in OR & MS (1995) 8:35–139Google Scholar
• Fischetti M., Lodi A., Martello S., Toth P. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. (2001a) 47:833–850Link, Google Scholar
• Fischetti M., Lodi A., Martello S., Toth P. Library of instances, multiple depot vehicle scheduling problem. (2001b) . Available at http://www.or.deis.unibo.it/research.htmlGoogle Scholar
• Forbes M. A., Holt J. N., Watts A. M. An exact algorithm for multiple depot bus scheduling. Eur. J. Oper. Res. (1994) 72:115–124Crossref, Google Scholar
• Jean A. Plans de coupure pour des problèmes de multiflots dans des graphes acycliques. (1996) . M.Sc. thesis, École Polytechnique de Montréal, Montréal, Québec, CanadaGoogle Scholar
• Kohl N., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. (1999) 33:101–116Link, Google Scholar
• Löbel A. Optimal vehicle scheduling in public transit. (1997) . Ph.D. thesis, Technische Universität Berlin, Berlin, GermanyGoogle Scholar
• Löbel A. Vehicle scheduling in public transit and Lagrangean pricing. Management Sci. (1998) 44:1637–1649Link, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Pulleyblank W. R., Edmonds J., Berge C., Ray-Chaudhuri D. Facets of 1-matching polyhedra. Hypergraph Seminar (1974) (Springer, Berlin, Germany) 214–242Crossref, Google Scholar
• Ribeiro C., Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. (1994) 42:41–52Link, Google Scholar