Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows

Computers and Operations Research

Volumn 36, Issue 7, 2009, Pages 2160-2172

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

^a INSTITUTE FOR RESEARCH IN IMMUNOLOGY AND CANCER   (Canada)

^b GERAD   (Canada)

Author keywords

Branch and bound; Branch and price; Column generation; Time windows; Vehicle scheduling; Window reduction

Indexed keywords

LINEAR PROGRAMMING; SCHEDULING; VEHICLE ROUTING; VEHICLES;

BRANCH AND BOUND; BRANCH AND PRICE; COLUMN GENERATION; TIME WINDOWS; VEHICLE SCHEDULING;

WINDOWS;

EID: 57649210752     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.08.010     Document Type: Article

References (18)

1. Bertossi A.A., Carraresi P., and Gallo G. On some matching problems arising in vehicle scheduling models. Networks 17 (1987) 271-281
2. Savelsbergh M.W.P. Local search in routing problems with time windows. Annals of Operations Research 4 (1985) 285-305
3. Bodin L., Rosenfield D., and Kydes A. UCOST: a micro approach to a transit planning problem. Journal of Urban Analysis 5 (1978) 46-69
4. Desrosiers J, Dumas Y, Salomon M, Soumis F. Time constrained routing and scheduling. In: Handbooks in operations research and management science, vol. 8, 1995. p. 35-139.
5. Carpaneto D., Dell'amico M., Fischetti M., and Toth P. A branch and bound algorithm for the multiple vehicle scheduling problem. Networks 19 (1989) 531-548
6. Ribeiro C., and Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Operations Research 42 (1994) 41-52
7. Bianco L., Mingozzi A., and Ricciardelli S. A set partitioning approach to the multiple depot vehicle scheduling problem. Optimization Methods and Software 3 (1994) 163-194
8. Forbes M.A., Holt J.N., and Watts A.M. An exact algorithm for multiple depot bus scheduling. European Journal of Operations Research 72 (1994) 115-124
9. Löbel A. Vehicle scheduling in public transit and Lagrangean pricing. Management Science 44 (1998) 1637-1649
10. Fischetti M., Lodi A., Martello S., and Toth P. A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science 47 (2001) 833-850
11. Hadjar A., Marcotte O., and Soumis F. A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Operations Research 54 1 (2006) 130-149
12. Mingozzi A., Bianco L., and Ricciardelli S. An exact algorithm for combining vehicle trips. In: Duduna J.R., Branco I., and Paixão J. (Eds). Computer-aided transit scheduling. Lecture notes in economics and mathematical systems (1995), Springer, Berlin 145-172
13. Desaulniers G., Lavigne J., and Soumis F. Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operations Research 111 (1998) 479-494
14. Mingozzi A., Boschetti M.A., Ricciardelli S., and Bianco L. A set partitioning approach to the crew scheduling problem. Operations Research 47 (1999) 873-888
15. Irnich S, Desauliniers G, Desrosiers J, Hadjar A. Path reduction costs for eliminating arcs. Les Cahiers du GERAD G-2007-79, HEC Montréal, Canada, 2007.
16. Walker W.E. A method for obtaining the optimal dual solution to a linear program using the Dantzig-Wolfe decomposition. Operations Research 17 (1969) 368-370
17. Desaulniers G., Desrosiers J., Gamache M., and Soumis F. Crew scheduling in air transportation. In: Crainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer Academic Publishers, Boston 169-185
18. Desaulniers G., Desrosiers J., Ioachim I., Solomon M., Soumis F., and Villeneuve D. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer Academic Publishers, Boston 57-93