{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:19:11Z","timestamp":1778861951585,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10951-008-0072-x","type":"journal-article","created":{"date-parts":[[2008,7,11]],"date-time":"2008-07-11T17:14:07Z","timestamp":1215796447000},"page":"17-30","source":"Crossref","is-referenced-by-count":103,"title":["A comparison of five heuristics for the multiple depot vehicle scheduling problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Ann-Sophie","family":"Pepin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Huisman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"72_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows: theory, algorithms, and applications. Englewood Cliffs: Prentice Hall."},{"key":"72_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: column generation for solving huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"72_CR3","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230170303","volume":"17","author":"A. A. Bertossi","year":"1987","unstructured":"Bertossi, A. A., Carraresi, P., & Gallo, G. (1987). On some matching problems arising in vehicle scheduling models. Networks, 17, 271\u2013281.","journal-title":"Networks"},{"key":"72_CR4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L. Bodin","year":"1983","unstructured":"Bodin, L., Golden, B., Assad, A., & Ball, M. (1983). Routing and scheduling of vehicles and crews: the state of the art. Computers and Operations Research, 10, 63\u2013211.","journal-title":"Computers and Operations Research"},{"key":"72_CR5","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G. Carpaneto","year":"1989","unstructured":"Carpaneto, G., Dell\u2019Amico, M., Fischetti, M., & Toth, P. (1989). A\u00a0branch and bound algorithm for the multiple vehicle scheduling problem. Networks, 19, 531\u2013548.","journal-title":"Networks"},{"key":"72_CR6","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52, 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"key":"72_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G. B. Dantzig","year":"1960","unstructured":"Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8, 101\u2013111.","journal-title":"Operations Research"},{"key":"72_CR8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1287\/mnsc.39.1.115","volume":"39","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., Fischetti, M., & Toth, P. (1993). Heuristic algorithms for the multiple depot vehicle scheduling problem. Management Science, 39, 115\u2013125.","journal-title":"Management Science"},{"key":"72_CR9","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0927-0507(06)14002-5","volume-title":"Transportation","author":"G. Desaulniers","year":"2007","unstructured":"Desaulniers, G., & Hickman, M. (2007). Public transit. In G. Laporte & C. Barnhart (Eds.), Handbooks in operations research and management science: Vol.\u00a014. Transportation (pp. 69\u2013127). Amsterdam: Elsevier Science."},{"key":"72_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-1-4615-5755-5_3","volume-title":"Fleet management and logistics","author":"G. Desaulniers","year":"1998","unstructured":"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.\u00a0G.\u00a0Crainic & G. Laporte (Eds.), Fleet management and logistics (pp. 57\u201393). Norwell: Kluwer."},{"key":"72_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0377-2217(97)00363-9","volume":"111","author":"G. Desaulniers","year":"1998","unstructured":"Desaulniers, G., Lavigne, J., & Soumis, F. (1998b). Multi-depot vehicle scheduling problems with time windows and waiting costs. European Journal of Operational Research, 111, 479\u2013494.","journal-title":"European Journal of Operational Research"},{"key":"72_CR12","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","volume-title":"Network routing","author":"J. Desrosiers","year":"1995","unstructured":"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.\u00a08. Network routing (pp.\u00a035\u2013139). Amsterdam: Elsevier Science."},{"key":"72_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(94)90334-4","volume":"72","author":"M. A. Forbes","year":"1994","unstructured":"Forbes, M. A., Holt, J. N., & Watts, A. M. (1994). An exact algorithm for multiple depot bus scheduling. European Journal of Operational Research, 72, 115\u2013124.","journal-title":"European Journal of Operational Research"},{"key":"72_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/trsc.35.2.165.10135","volume":"35","author":"R. Freling","year":"2001","unstructured":"Freling, R., Wagelmans, A. P. M., & Paix\u00e3o, J. M. P. (2001). Models and algorithms for single-depot vehicle scheduling. Transportation Science, 35, 165\u2013180.","journal-title":"Transportation Science"},{"key":"72_CR15","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276\u20131290.","journal-title":"Management Science"},{"key":"72_CR16","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A. Geoffrion","year":"1974","unstructured":"Geoffrion, A. (1974). Lagrangian relaxations for integer programming. Mathematical Programming Study, 2, 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"72_CR17","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P. C. Gilmore","year":"1961","unstructured":"Gilmore, P. C., & Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9, 849\u2013859.","journal-title":"Operations Research"},{"key":"72_CR18","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F. (1986). Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13, 533\u2013549.","journal-title":"Computers and Operations Research"},{"key":"72_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"72_CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1050.0240","volume":"54","author":"A. Hadjar","year":"2006","unstructured":"Hadjar, A., Marcotte, O., & Soumis, F. (2006). A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Operations Research, 54, 130\u2013149.","journal-title":"Operations Research"},{"key":"72_CR21","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1287\/trsc.1040.0104","volume":"39","author":"D. Huisman","year":"2005","unstructured":"Huisman, D., Freling, R., & Wagelmans, A. P. M. (2005). Multiple-depot integrated vehicle and crew scheduling. Transportation Science, 39, 491\u2013502.","journal-title":"Transportation Science"},{"key":"72_CR22","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1016\/j.ejor.2005.02.030","volume":"175","author":"N. Kliewer","year":"2006","unstructured":"Kliewer, N., Mellouli, T., & Suhl, L. (2006). A time\u2013space network based exact optimization model for multi-depot bus scheduling. European Journal of Operational Research, 175, 1616\u20131627.","journal-title":"European Journal of Operational Research"},{"key":"72_CR23","unstructured":"Kokott, A., & L\u00f6bel, A. (1996). Lagrangean relaxations and subgradient methods for multiple-depot vehicle scheduling problems (ZIB-Report 96-22). Konrad-Zuse-Zentrum f\u00fcr Informationstecnik, Berlin."},{"key":"72_CR24","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-642-85968-7_13","volume-title":"Computer-aided transit scheduling","author":"A. Lamatsch","year":"1992","unstructured":"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.\u00a0386. Computer-aided transit scheduling (pp. 181\u2013195). Berlin: Springer."},{"key":"72_CR25","unstructured":"L\u00f6bel, A. (1997). Optimal vehicle scheduling in public transit. PhD thesis, Technische Universit\u00e4t Berlin, Germany."},{"key":"72_CR26","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1287\/mnsc.44.12.1637","volume":"44","author":"A. L\u00f6bel","year":"1998","unstructured":"L\u00f6bel, A. (1998). Vehicle scheduling in public transit and Lagrangian pricing. Management Science, 44, 1637\u20131649.","journal-title":"Management Science"},{"key":"72_CR27","series-title":"Handbooks in operations research and management science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0927-0507(05)80086-6","volume-title":"Operations research and the public sector","author":"A. R. Odoni","year":"1994","unstructured":"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.\u00a06. Operations research and the public sector (pp. 107\u2013150). Amsterdam: North-Holland."},{"key":"72_CR28","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-642-85968-7_12","volume-title":"Computer-aided transit scheduling","author":"M. Mesquita","year":"1992","unstructured":"Mesquita, M., & Paix\u00e3o, 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.\u00a0386. Computer-aided transit scheduling (pp. 167\u2013180). Berlin: Springer."},{"key":"72_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","volume":"42","author":"C. Ribeiro","year":"1994","unstructured":"Ribeiro, C., & Soumis, F. (1994). A column generation approach to the multiple depot vehicle scheduling problem. Operations Research, 42, 41\u201352.","journal-title":"Operations Research"},{"key":"72_CR30","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2004","unstructured":"Ropke, S., & Pisinger, D. (2004). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455\u2013472.","journal-title":"Transportation Science"},{"key":"72_CR31","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming, CP98","author":"P. Shaw","year":"1998","unstructured":"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\u2013431). New-York: Springer."},{"key":"72_CR32","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. D. Taillard","year":"1993","unstructured":"Taillard, E. D. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23, 661\u2013673.","journal-title":"Networks"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0072-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0072-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0072-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:41Z","timestamp":1559468381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0072-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["72"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0072-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,12]]}}}