A comparison of five heuristics for the multiple depot vehicle scheduling problem

Journal of Scheduling

Volumn 12, Issue 1, 2009, Pages 17-30

  Pepin, Ann Sophie ^a   Desaulniers, Guy ^b   Hertz, Alain ^b   Huisman, Dennis ^c  

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

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

^c ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Branch and cut; Column generation; Heuristics; Lagrangian heuristic; Large neighborhood search; Multiple depot; Tabu search; Vehicle scheduling

Indexed keywords

BRANCH-AND-CUT; COLUMN GENERATION; HEURISTICS; LAGRANGIAN HEURISTIC; LARGE NEIGHBORHOOD SEARCH; MULTIPLE DEPOT; VEHICLE SCHEDULING;

COMPUTATIONAL METHODS; HEURISTIC ALGORITHMS; LAGRANGE MULTIPLIERS; SCHEDULING; TABU SEARCH; VEHICLES;

HEURISTIC METHODS;

EID: 60349130126     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-008-0072-x     Document Type: Article

References (32)

1. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice Hall.
2. C. Barnhart E. L. Johnson G. L. Nemhauser M. W. P. Savelsbergh P. H. Vance 1998 Branch-and-price: column generation for solving huge integer programs Operations Research 46 316 329
3. A. A. Bertossi P. Carraresi G. Gallo 1987 On some matching problems arising in vehicle scheduling models Networks 17 271 281
4. L. Bodin B. Golden A. Assad M. Ball 1983 Routing and scheduling of vehicles and crews: the state of the art Computers and Operations Research 10 63 211
5. G. Carpaneto M. Dell'Amico M. Fischetti P. Toth 1989 A branch and bound algorithm for the multiple vehicle scheduling problem Networks 19 531 548
6. J.-F. Cordeau G. Laporte A. Mercier 2001 A unified tabu search heuristic for vehicle routing problems with time windows Journal of the Operational Research Society 52 928 936
7. G. B. Dantzig P. Wolfe 1960 Decomposition principle for linear programs Operations Research 8 101 111
8. M. Dell'Amico M. Fischetti P. Toth 1993 Heuristic algorithms for the multiple depot vehicle scheduling problem Management Science 39 115 125
9. Desaulniers, G., & Hickman, M. (2007). Public transit. In G. Laporte & C. Barnhart (Eds.), Handbooks in operations research and management science: Vol. 14. Transportation (pp. 69-127). Amsterdam: Elsevier Science.
10. Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M. M., & Soumis, F. (1998a). A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics (pp. 57-93). Norwell: Kluwer.
11. G. Desaulniers J. Lavigne F. Soumis 1998 Multi-depot vehicle scheduling problems with time windows and waiting costs European Journal of Operational Research 111 479 494
12. Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995). Time constrained routing and scheduling. In M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Handbooks in operations research and management science: Vol. 8. Network routing (pp. 35-139). Amsterdam: Elsevier Science.
13. M. A. Forbes J. N. Holt A. M. Watts 1994 An exact algorithm for multiple depot bus scheduling European Journal of Operational Research 72 115 124
14. R. Freling A. P. M. Wagelmans J. M. P. Paixão 2001 Models and algorithms for single-depot vehicle scheduling Transportation Science 35 165 180
15. M. Gendreau A. Hertz G. Laporte 1994 A tabu search heuristic for the vehicle routing problem Management Science 40 1276 1290
16. A. Geoffrion 1974 Lagrangian relaxations for integer programming Mathematical Programming Study 2 82 114
17. P. C. Gilmore R. E. Gomory 1961 A linear programming approach to the cutting-stock problem Operations Research 9 849 859
18. F. Glover 1986 Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 533 549
19. Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic.
20. A. Hadjar O. Marcotte F. Soumis 2006 A branch-and-cut algorithm for the multiple depot vehicle scheduling problem Operations Research 54 130 149
21. D. Huisman R. Freling A. P. M. Wagelmans 2005 Multiple-depot integrated vehicle and crew scheduling Transportation Science 39 491 502
22. N. Kliewer T. Mellouli L. Suhl 2006 A time-space network based exact optimization model for multi-depot bus scheduling European Journal of Operational Research 175 1616 1627
23. Kokott, A., & Löbel, A. (1996). Lagrangean relaxations and subgradient methods for multiple-depot vehicle scheduling problems (ZIB-Report 96-22). Konrad-Zuse-Zentrum für Informationstecnik, Berlin.
24. Lamatsch, A. (1992). An approach to vehicle scheduling with depot capacity constraints. In M. Desrochers & J.-M. Rousseau (Eds.), Lecture notes in economics and mathematical systems: Vol. 386. Computer-aided transit scheduling (pp. 181-195). Berlin: Springer.
25. Löbel, A. (1997). Optimal vehicle scheduling in public transit. PhD thesis, Technische Universität Berlin, Germany.
26. A. Löbel 1998 Vehicle scheduling in public transit and Lagrangian pricing Management Science 44 1637 1649
27. Odoni, A. R., Rousseau, J.-M., & Wilson, N. H. M. (1994). Models in urban and air transportation. In S. M. Pollock, M. H. Rothkopf, & A. Barnett (Eds.), Handbooks in operations research and management science: Vol. 6. Operations research and the public sector (pp. 107-150). Amsterdam: North-Holland.
28. Mesquita, M., & Paixão, J. (1992). Multiple depot vehicle scheduling problem: a new heuristic based on quasi-assignment algorithms. In M. Desrochers & J.-M. Rousseau (Eds.), Lecture notes in economics and mathematical systems: Vol. 386. Computer-aided transit scheduling (pp. 167-180). Berlin: Springer.
29. C. Ribeiro F. Soumis 1994 A column generation approach to the multiple depot vehicle scheduling problem Operations Research 42 41 52
30. S. Ropke D. Pisinger 2004 An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows Transportation Science 40 455 472
31. Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J.-F. Puget (Eds.), Lecture notes in computer science. Principles and practice of constraint programming, CP98 (pp. 417-431). New-York: Springer.
32. E. D. Taillard 1993 Parallel iterative search methods for vehicle routing problems Networks 23 661 673