{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:42Z","timestamp":1725575202473},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_38","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T16:14:27Z","timestamp":1295108067000},"page":"350-359","source":"Crossref","is-referenced-by-count":10,"title":["An Exact Algorithm for Multi Depot and Multi Period Vehicle Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Kyung Hwan","family":"Kang","sequence":"first","affiliation":[]},{"given":"Young Hoon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Byung Ki","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G.B. Danzig","year":"1959","unstructured":"Danzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science\u00a06, 80\u201391 (1959)","journal-title":"Management Science"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C. Malandraki","year":"1996","unstructured":"Malandraki, C., Dial, R.B.: A restricted dynamic programming heuristic algorithm for the traveling salesman problem. European Journal of Operational Research\u00a090, 45\u201355 (1996)","journal-title":"European Journal of Operational Research"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","volume":"5","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies\u00a05, 109\u2013122 (1997)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","volume":"118","author":"F. Liu","year":"1999","unstructured":"Liu, F., Shen, S.: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research\u00a0118, 485\u2013504 (1999)","journal-title":"European Journal of Operational Research"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"2037","DOI":"10.1016\/S0305-0548(03)00163-1","volume":"31","author":"J. Berger","year":"2004","unstructured":"Berger, J., Barkaoui, M.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers and Operations Research\u00a031, 2037\u20132053 (2004) (Article in press)","journal-title":"Computers and Operations Research"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0377-2217(89)90108-2","volume":"38","author":"G. Laporte","year":"1989","unstructured":"Laporte, G.: Integer programming formulations for the multi-depot vehicle routing problem. Comments on a paper by Kulkarni and Bhave. European Journal of Operational Research\u00a038, 228\u2013237 (1989)","journal-title":"European Journal of Operational Research"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J. Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research\u00a023, 229\u2013235 (1996)","journal-title":"Computers and Operations Research"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S. Salhi","year":"1997","unstructured":"Salhi, S., Sari, M.: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research\u00a0103, 95\u2013112 (1997)","journal-title":"European Journal of Operational Research"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0377-2217(93)90220-H","volume":"66","author":"S. Salhi","year":"1993","unstructured":"Salhi, S., Rand, G.K.: Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research\u00a066, 313\u2013330 (1993)","journal-title":"European Journal of Operational Research"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0167-739X(98)00034-X","volume":"14","author":"L.S. Ochi","year":"1998","unstructured":"Ochi, L.S.: A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems\u00a014, 285\u2013292 (1998)","journal-title":"Future Generation Computer Systems"},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, E.D.: A tabu search heuristics for the heterogeneous fleet vehicle routing problem. Computers and Operations Research\u00a026, 1153\u20131173 (1999)","journal-title":"Computers and Operations Research"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0360-8352(97)00275-1","volume":"34","author":"G. Mosheiov","year":"1998","unstructured":"Mosheiov, G.: Vehicle Routing with Pick-up and Delivery: Tour-Partitioning Heuristics. Computers and Industrial Engineering\u00a034, 669\u2013684 (1998)","journal-title":"Computers and Industrial Engineering"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0360-8352(02)00066-9","volume":"43","author":"H. Min","year":"2002","unstructured":"Min, H., Zhou, G.: Supply chain modeling: past, present and future. Computers and Industrial Engineering\u00a043, 231\u2013249 (2002)","journal-title":"Computers and Industrial Engineering"},{"key":"38_CR14","first-page":"421","volume":"27","author":"J. Kim","year":"1999","unstructured":"Kim, J., Kim, Y.: A decomposition approach to a multi-period vehicle scheduling problem. The International Journal of Management Science\u00a027, 421\u2013430 (1999)","journal-title":"The International Journal of Management Science"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J.Y. Yen","year":"1971","unstructured":"Yen, J.Y.: Finding the K shortest loopless paths in a network. Management Science\u00a017, 712\u2013716 (1971)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:09Z","timestamp":1619507169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11424925_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}