{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:50Z","timestamp":1725490130506},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_17","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:39:15Z","timestamp":1187681955000},"page":"197-201","source":"Crossref","is-referenced-by-count":2,"title":["A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Beno\u00eet","family":"Laurent","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1002\/net.3230170303","volume":"17","author":"A. Bertossi","year":"1987","unstructured":"Bertossi, A., Carraresi, P., Gallo, G.: On some matching problems arising in vehicle scheduling models. Networks\u00a017, 271\u2013281 (1987)","journal-title":"Networks"},{"key":"17_CR2","first-page":"107","volume-title":"Models in urban and air transportation","author":"A.R. Odoni","year":"1994","unstructured":"Odoni, A.R., Rousseau, J.M., Wilson, N.H.: Models in urban and air transportation, vol.\u00a06, pp. 107\u2013150. Elsevier Science, North-Holland, Amsterdam (1994)"},{"key":"17_CR3","first-page":"69","volume-title":"Public transit","author":"G. Desaulniers","year":"2007","unstructured":"Desaulniers, G., Hickman, M.: Public transit, pp. 69\u2013120. Elsevier Science, North-Holland, Amsterdam (2007)"},{"unstructured":"Pepin, A.S., Desaulniers, G., Hertz, A., Huisman, D.: Comparison of heuristic approaches for the multiple vehicle scheduling problem. Technical Report EI2006-34, Economie Institute, Erasmus University Rotterdam, Rotterdam (2006)","key":"17_CR4"},{"issue":"1-3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics\u00a065(1-3), 223\u2013253 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G. Carpenato","year":"1989","unstructured":"Carpenato, G., Dell\u2019Amico, M., Fischetti, M., Toth, P.: A branch and bound algorihm for the multiple depot vehicle scheduling problem. Networks\u00a019, 531\u2013548 (1989)","journal-title":"Networks"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms\u00a05(1), 65\u201389 (2006)","journal-title":"Journal of Mathematical Modeling and Algorithms"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:27:47Z","timestamp":1619519267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_17","relation":{},"subject":[]}}