A branch-and-cut algorithm for the multiple depot vehicle scheduling problem

Operations Research

Volumn 54, Issue 1, 2006, Pages 130-149

  Hadjar, Ahmed ^a   Marcotte, Odile ^b   Soumis, François ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

Networks graphs, multicommodity: multicommodity formulation; Programming, integer, algorithms, cutting plane facet: branch and cut algorithm for the MDVSP; Transportation, scheduling, vehicles: multiple depot vehicle scheduling problem

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

NETWORKS/GRAPHS, MULTICOMMODITY: MULTICOMMODITY FORMULATION; PROGRAMMING, INTEGER, ALGORITHMS, CUTTING PLANE/FACET: BRANCH-AND-CUT ALGORITHM FOR THE MDVSP; TRANSPORTATION, SCHEDULING, VEHICLES: MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM;

ALGORITHMS;

EID: 33644523064     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.1050.0240     Document Type: Article

References (19)

1. Bertossi, A. A., P. Carraresi, G. Gallo. 1987. On some matching problems arising in vehicle scheduling models. Networks 17 271-281.
2. Bianco, L., A. Mingozzi, S. Ricciardelli. 1994. A set partitioning approach to the multiple depot vehicle scheduling problem. Optim. Methods and Software 3 163-194.
3. Bodin, L., D. Rosenfleld, A. Kydes. 1978. UCOST: A micro approach to a transit planning problem. J. Urban Anal. 5 46-69.
4. Boschetti, M. A., A. Mingozzi. 2001. New benchmark results for the multiple depot crew scheduling problem. Technical report DM-01-10, Dipartimento di Matematica, Universitá degli Studi di Bologna, Bologna, Italy.
5. Carpaneto, D., M. Dell'Amico, M. Fischetti, P. Toth. 1989. A branch and bound algorithm for the multiple vehicle scheduling problem. Networks 19 531-548.
6. Desaulniers, G., J. Lavigne, F. Soumis. 1998a. Multi-depot vehicle scheduling problems with time windows and waiting costs. Eur. J. Oper. Res. 111 479-494.
7. Desaulniers, G., J. Desrosiers, M. Gamache, F. Soumis. 1998b. Crew scheduling in air transportation. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Boston, MA, 169-185.
8. Desaulniers, G., J. Desrosiers, I. Ioachim, M. M. Solomon, F. Soumis, D. Villeneuve. 1998c. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. T. G. Crainic, G. Laporte, eds. Fleet Management and Logistics. Kluwer, Boston, MA, 57-93.
9. Desrosiers, J., Y. Dumas, M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. Handbooks in OR & MS 8 35-139.
10. Fischetti, M., A. Lodi, S. Martello, P. Toth. 2001a. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Sci. 47 833-850.
11. Fischetti, M., A. Lodi, S. Martello, P. Toth. 2001b. Library of instances, multiple depot vehicle scheduling problem. Available at http://www.or.deis.unibo.it/research.html.
12. Forbes, M. A., J. N. Holt, A. M. Watts. 1994. An exact algorithm for multiple depot bus scheduling. Eur. J. Oper. Res. 72 115-124.
13. Jean, A. 1996. Plans de coupure pour des problèmes de multiflots dans des graphes acycliques. M. Sc. thesis, École Polytechnique de Montréal, Montréal, Québec, Canada.
14. Kohi, N., J. Desrosiers, O. B. G. Madsen, M. M. Solomon, F. Soumis. 1999. 2-path cuts for the vehicle routing problem with time windows. Transportation Sci. 33 101-116.
15. Löbel, A. 1997. Optimal vehicle scheduling in public transit. Ph.D. thesis, Technische Universität Berlin, Berlin, Germany.
16. Löbel, A. 1998. Vehicle scheduling in public transit and Lagrangean pricing. Management Sci. 441637-1649.
17. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
18. Pulleyblank, W. R., J. Edmonds. 1974. Facets of 1-matching polyhedra. C. Berge, D. Ray-Chaudhuri, eds. Hypergraph Seminar. Springer, Berlin, Germany, 214-242.
19. Ribeiro, C., F. Soumis. 1994. A column generation approach to the multiple depot vehicle scheduling problem. Oper. Res. 42 41-52.