{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:43:42Z","timestamp":1742913822336,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119958"},{"type":"electronic","value":"9783642119965"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-11996-5_43","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T17:47:42Z","timestamp":1295459262000},"page":"481-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Development of a Genetic Algorithm for the Maritime Transportation Planning of Car Carriers"],"prefix":"10.1007","author":[{"given":"Jae Un","family":"Jung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moo Hong","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyung Rim","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyun Soo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byung Joo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chang Hyun","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,20]]},"reference":[{"key":"43_CR1","first-page":"10","volume-title":"Exploring Problem-Specific Recombination Operators for Job Shop Scheduling, Proc. Fourth Int\u2019l Conf. on Genetic Algorithms","author":"S Bagchi","year":"1991","unstructured":"Bagchi, S., Uckun, S., Miyabe, Y., and Kawamura, K. (1991) Exploring Problem-Specific Recombination Operators for Job Shop Scheduling, Proc. Fourth Int\u2019l Conf. on Genetic Algorithms, Morgan Kaufmann, San Mateo, pp.10\u201317."},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","volume":"30","author":"BM Baker","year":"2003","unstructured":"Baker, B.M. and Ayechew, M.A. (2003) A genetic algorithm for the vehicle routing problem. Computers and Operations Research 30, 787\u2013800.","journal-title":"Computers and Operations Research"},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"JE Bell","year":"2004","unstructured":"Bell, J.E. and McMullen, P.R. (2004) Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics 18, 41\u201348.","journal-title":"Advanced Engineering Informatics"},{"key":"43_CR4","unstructured":"Davis, L. (1991) Oder-Based Genetic Algorithms and the Graph Coloring Problem, Handbook of Genetic Algorithms, Davis, L. (ed), van Nostrand Reinhold, New York, pp. 72\u201390."},{"key":"43_CR5","volume-title":"Genetic Algorithms and Engineering Design","author":"M Gen","year":"1997","unstructured":"Gen, M. and Cheng, R. (1997) Genetic Algorithms and Engineering Design, New York, John Wiley & Sons."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., and Laporte, G. (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276\u20131290.","journal-title":"Management Science"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"SC Ho","year":"2004","unstructured":"Ho, S.C. and Haugland, D. (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31, 1947\u20131964.","journal-title":"Computers & Operations Research"},{"key":"43_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte, G., Gendreau, M., Potvin, J.Y., and Semet, F. (2000) Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285\u2013300.","journal-title":"International Transactions in Operational Research"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra, J. and Kan, R. (1981) Complexity of vehicle routing and scheduling problems. Networks 11, 221\u2013227.","journal-title":"Networks"},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"LH Osman","year":"1993","unstructured":"Osman, L.H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operation Research 41, 421\u2013451.","journal-title":"Annals of Operation Research"},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park, B. J., Choi, H.R., and Kim, H.S. (2003) A hybrid GA for job shop scheduling problems. Computers and Industrial Engineering 45, 597\u2013613.","journal-title":"Computers and Industrial Engineering"},{"key":"43_CR12","doi-asserted-by":"crossref","first-page":"295","DOI":"10.5394\/KINPR.2008.32.4.295","volume":"32","author":"BJ Park","year":"2008","unstructured":"Park, B.J., Choi, H.R., Kim, H.S., and Jung, J.U. (2008) Maritime Transportation Planning Support System for a Car Shipping Company. Journal of Navigation and Port Research International Edition 32, 295\u2013304.","journal-title":"Journal of Navigation and Port Research International Edition"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D. and Ropke, S. (2007) A general heuristic for vehicle routing problems. Computers and Operations Research 34, 2403\u20132435.","journal-title":"Computers and Operations Research"}],"container-title":["Dynamics in Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11996-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T11:57:33Z","timestamp":1676635053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-11996-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642119958","9783642119965"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11996-5_43","relation":{},"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"20 January 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}