{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T04:11:30Z","timestamp":1773547890772,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T00:00:00Z","timestamp":1441929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00edgico","doi-asserted-by":"publisher","award":["301453\/2013-6"],"award-info":[{"award-number":["301453\/2013-6"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11590-015-0944-x","type":"journal-article","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T11:27:00Z","timestamp":1441970820000},"page":"1449-1461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Pablo Cristini","family":"Guedes","sequence":"first","affiliation":[]},{"given":"William Prigol","family":"Lopes","sequence":"additional","affiliation":[]},{"given":"Leonardo Rosa","family":"Rohde","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Borenstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,11]]},"reference":[{"issue":"3","key":"944_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/net.3230170303","volume":"17","author":"AA Bertossi","year":"1987","unstructured":"Bertossi, A.A., Carraresi, P., Gallo, G.: On some matching problems arising in vehicle scheduling models. Networks 17(3), 271\u2013281 (1987)","journal-title":"Networks"},{"issue":"5","key":"944_CR2","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.: A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5), 531\u2013548 (1989)","journal-title":"Networks"},{"issue":"1\u20132","key":"944_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and codes for dense assignment problems: the state of the art. Discrete Appl. Math. 100(1\u20132), 17\u201348 (2000)","journal-title":"Discrete Appl. Math."},{"key":"944_CR4","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Hickman, M.D.: Public transit. In Barnhart, C., Laporte, B. (eds.) Handbooks in Operations Research and Management Science, Transportation, pp. 69\u2013127. North-Holland, Amsterdam (2007)","DOI":"10.1016\/S0927-0507(06)14002-5"},{"issue":"1","key":"944_CR5","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.: A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. Oper. Res. 54(1), 130\u2013149 (2006)","journal-title":"Oper. Res."},{"issue":"4","key":"944_CR6","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.: Multiple-depot integrated vehicle and crew scheduling. Transp. Sci. 39(4), 491\u2013502 (2005)","journal-title":"Transp. Sci."},{"issue":"4","key":"944_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987)","journal-title":"Computing"},{"issue":"3","key":"944_CR8","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.: A time-space network based exact optimization model for multi-depot bus scheduling. Eur. J. Oper. Res. 175(3), 1616\u20131627 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"944_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.cie.2008.11.028","volume":"51","author":"B Laurent","year":"2009","unstructured":"Laurent, B., Hao, J.L.: Iterated local search for the multiple depot vehicle scheduling problem. Comput. Ind. Eng. 51, 277\u2013286 (2009)","journal-title":"Comput. Ind. Eng."},{"issue":"12","key":"944_CR10","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.: Vehicle scheduling in public transit and Lagrangean pricing. Manag. Sci. 44(12), 1637\u20131649 (1998)","journal-title":"Manag. Sci."},{"issue":"6","key":"944_CR11","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007\u20131023 (2005)","journal-title":"Oper. Res."},{"key":"944_CR12","doi-asserted-by":"publisher","unstructured":"Otsuki, T., Aihara, K.: New variable depth local search for multiple depot vehicle scheduling problems. J. Heuristics, 1\u201319 (2014). doi: 10.1007\/s10732-014-9264-z (ISSN 1381-1231)","DOI":"10.1007\/s10732-014-9264-z"},{"key":"944_CR13","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.cor.2005.05.011","volume":"34","author":"A Oukil","year":"2007","unstructured":"Oukil, A., Ben Amor, H., Desrosiers, J.: Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems. Comput. Oper. Res. 34, 817\u2013834 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"944_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1002\/net.3230170302","volume":"17","author":"JM Paix\u00e3o","year":"1987","unstructured":"Paix\u00e3o, J.M., Branco, I.: A quasi-assignment algorithm for bus scheduling. Networks 17(3), 249\u2013269 (1987)","journal-title":"Networks"},{"issue":"1","key":"944_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-008-0072-x","volume":"12","author":"A-S Pepin","year":"2009","unstructured":"Pepin, A.-S., Desaulniers, G., Hertz, A., Huisman, D.: A comparison of five heuristics for the multiple depot vehicle scheduling problem. J. Sched. 12(1), 17\u201330 (2009)","journal-title":"J. Sched."},{"issue":"1","key":"944_CR16","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","volume":"42","author":"CC Ribeiro","year":"1994","unstructured":"Ribeiro, C.C., Soumis, F.: A column generation approach to the multiple-depot vehicle scheduling problem. Oper. Res. 42(1), 41\u201352 (1994)","journal-title":"Oper. Res."},{"key":"944_CR17","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley, Chichester (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0944-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0944-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0944-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T07:14:28Z","timestamp":1567149268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0944-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,11]]},"references-count":17,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["944"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0944-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,11]]}}}