{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:19:03Z","timestamp":1778861943948,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0377-2217(97)00363-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:18:16Z","timestamp":1027617496000},"page":"479-494","source":"Crossref","is-referenced-by-count":100,"title":["Multi-depot vehicle scheduling problems with time windows and waiting costs"],"prefix":"10.1016","volume":"111","author":[{"given":"Guy","family":"Desaulniers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"June","family":"Lavigne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Soumis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00363-9_BIB1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230170303","article-title":"On some matching problems arising in vehicle scheduling models","volume":"17","author":"Bertossi","year":"1987","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/10556789408805563","article-title":"A set partitioning approach to the multiple depot vehicle scheduling problem","volume":"3","author":"Bianco","year":"1994","journal-title":"Optimization Methods and Software"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB3","doi-asserted-by":"crossref","unstructured":"Bianco, L., Mingozzi, A., Ricciardelli, S., 1995. An exact algorithm for combining vehicle trips. In: Daduna, J.R., Branco, I., Paix\u00e3o, J. (Eds.), Computer-aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 430, Springer, Berlin, pp. 145\u2013172","DOI":"10.1007\/978-3-642-57762-8_11"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB4","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","article-title":"A branch and bound algorithm for the multiple vehicle scheduling problem","volume":"19","author":"Carpaneto","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1287\/mnsc.39.1.115","article-title":"Heuristic algorithms for the multiple depot vehicle scheduling problem","volume":"39","author":"Dell'Amico","year":"1993","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB7","unstructured":"Desaulniers, G., Desrosiers, J., Ioachim, I., Solomon, M.M., Soumis, F., 1994. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Les Cahiers du GERAD G\u201394\u201346, \u00c9cole des Hautes \u00c9tudes Commerciales, Montr\u00e9al, Canada, H3T 2A7, forthcoming in: G. Laporte (Ed.) Fleet Management and Logistics"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB8","unstructured":"Desaulniers, G., Villeneuve, D., 1997. The shortest path problem with time windows and linear waiting costs. Les Cahiers du GERAD G\u201397\u201321, \u00c9cole des Hautes \u00c9tudes Commerciales, Montr\u00e9al, Canada, H3T 2A7"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB9","unstructured":"Desrochers, M., 1986. La fabrication d'horaires de travail pour les conducteurs d'autobus par une m\u00e9thode de g\u00e9n\u00e9ration de colonnes. Ph.D. Dissertation, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (in French)"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB10","first-page":"191","article-title":"A generalized permanent labeling algorithm for the shortest path problem with time windows","volume":"26","author":"Desrochers","year":"1988","journal-title":"INFOR"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB11","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F., 1995. Time constrained routing and scheduling. In: Ball, M.O., et al. (Eds.), Network Routing, Handbooks in Operations Research and Management Science 8, Elsevier Science, Amsterdam, 35\u2013139","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/trsc.24.2.145","article-title":"Optimizing the schedule for a fixed vehicle path with convex inconvenience costs","volume":"24","author":"Dumas","year":"1990","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(94)90334-4","article-title":"An exact algorithm for multiple depot bus scheduling","volume":"72","author":"Forbes","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB14","unstructured":"Ioachim, I., G\u00e9linas, S., Desrosiers, J., Soumis, F., 1994. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Les Cahiers du GERAD, G\u201394\u201324, \u00c9cole des Hautes \u00c9tudes Commerciales, Montr\u00e9al, Canada, H3T 2A7, forthcoming in Networks"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB15","doi-asserted-by":"crossref","unstructured":"Mesquita, M., Paix\u00e3o, J., 1992. Multiple depot vehicle scheduling problem: A new heuristic based on quasi-assignment algorithms. In: Desrochers M., Rousseau, J.-M. (Eds.), Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386, Springer, Berlin, pp. 167\u2013180","DOI":"10.1007\/978-3-642-85968-7_12"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB16","unstructured":"Mesquita, M., Paix\u00e3o, J., 1994. A multiplier adjustment method for the multi-depot vehicle scheduling problem. Triennial Symposium on Transportation Analysis, Capri, Italy, pp. 749\u2013762"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","article-title":"A column generation approach to the multiple depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB18","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/trsc.19.4.378","article-title":"Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling","volume":"19","author":"Sexton","year":"1985","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(97)00363-9_BIB19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1080\/01966324.1986.10737200","article-title":"Pickup and delivery of partial loads with time windows","volume":"6","author":"Sexton","year":"1986","journal-title":"American Journal of Mathematical and Management Sciences"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003639?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003639?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T04:44:55Z","timestamp":1578890695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0377221797003639"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00363-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}