{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:29:30Z","timestamp":1742927370438,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247682"},{"type":"electronic","value":"9783642247699"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24769-9_8","type":"book-chapter","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T11:13:38Z","timestamp":1318245218000},"page":"98-109","source":"Crossref","is-referenced-by-count":3,"title":["Solving Heterogeneous Fleet Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Jorge Alpedrinha","family":"Ramos","sequence":"first","affiliation":[]},{"given":"Lu\u00eds Paulo","family":"Reis","sequence":"additional","affiliation":[]},{"given":"Dulce","family":"Pedrosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bunte, S., Kliewer, N.: An overview on vehicle scheduling models. DSOR Arbeitspapiere \/ DSOR Working Papers (2006)"},{"key":"8_CR2","unstructured":"Freling, R., Paix\u00e3o, J.P., Wagelmans, A.: Models and Algorithms for Vehicle Scheduling (2004)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a0I (April 1997)","DOI":"10.1109\/4235.585892"},{"key":"8_CR4","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano. Italie (1992)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1002\/net.3230170302","volume":"17","author":"J.P. Paix\u00e3o","year":"1987","unstructured":"Paix\u00e3o, J.P., Branco, I.M.: A quasi-assignment algorithm for bus scheduling. Networks\u00a017, 249\u2013269 (1987), doi:10.1002\/net.3230170302","journal-title":"Networks"},{"key":"8_CR6","series-title":"Werkstatt Bionik und Evolutionstechnik","volume-title":"Evolutionsstrategie","author":"I. Rechenberg","year":"1994","unstructured":"Rechenberg, I.: Evolutionsstrategie. Werkstatt Bionik und Evolutionstechnik, vol.\u00a01. Frommann-Holzboog Verlag, Stuttgart (1994)"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenstra","year":"1981","unstructured":"Lenstra, J., Kahn, A.R.: Complexity of vehicle routing and scheduling problems. Networks\u00a011(2), 221\u2013227 (1981)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24769-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:06:08Z","timestamp":1554883568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24769-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247682","9783642247699"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24769-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}