{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:57:28Z","timestamp":1725577048075},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119958"},{"type":"electronic","value":"9783642119965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-11996-5_42","type":"book-chapter","created":{"date-parts":[[2011,1,19]],"date-time":"2011-01-19T17:47:42Z","timestamp":1295459262000},"page":"469-480","source":"Crossref","is-referenced-by-count":0,"title":["Resolution of the Berth Allocation Problem through a Heuristic Model Based on Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Vanina Macowski Durski","family":"Silva","sequence":"first","affiliation":[]},{"given":"Ant\u00f4nio G.","family":"Novaes","sequence":"additional","affiliation":[]},{"given":"Ant\u00f4nio S\u00e9rgio","family":"Coelho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,20]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/1520-6750(199402)41:1<1::AID-NAV3220410102>3.0.CO;2-L","volume":"41","author":"G G Brown","year":"1994","unstructured":"Brown G G, Lawphongpanich S, Thurman K P (1994) Optimizing ship berthing. Naval Research Logistics 41:1\u201315.","journal-title":"Naval Research Logistics"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Brown G G, Cormican K J, Lawphongpanich S, Widdis D B (1997) Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44.","DOI":"10.1002\/(SICI)1520-6750(199706)44:4<301::AID-NAV2>3.0.CO;2-A"},{"key":"42_CR3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00291-003-0140-8","volume":"26","author":"Y Guan","year":"2004","unstructured":"Guan Y, Cheung R K (2004) The berth allocation problem: models and solutions methods. OR Spectrum 26:75\u201392.","journal-title":"OR Spectrum"},{"key":"42_CR4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"3","author":"A Imai","year":"2001","unstructured":"Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transportation Research Part B 3:401\u2013417.","journal-title":"Transportation Research Part B"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0191-2615(02)00023-1","volume":"37","author":"A Imai","year":"2003","unstructured":"Imai A, Nishimura E, Papadimitriou S (2003) Berth allocation with service priority. Transportation Research Part B 37:437\u2013457.","journal-title":"Transportation Research Part B"},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/S0191-2615(02)00027-9","volume":"37","author":"K H Kim","year":"2003","unstructured":"Kim K H, Moon K C (2003) Berth scheduling by simulated annealing. Transportation Research Part B 37:541\u2013560.","journal-title":"Transportation Research Part B"},{"key":"42_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(98)00010-8","volume":"22","author":"A Lim","year":"1998","unstructured":"Lim A (1998) The berth planning problem. Operations Research Letters 22:105\u2013110.","journal-title":"Operations Research Letters"},{"key":"42_CR9","unstructured":"Moon K C (2000) A mathematical model and a heuristic algorithm for berth planning. Brain Korea 21 Logistics Team, July."},{"key":"42_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.14488\/1676-1901.v6i3.631","volume":"6","author":"F M Mulato","year":"2006","unstructured":"Mulato F M, Oliveira M M B de (2006) O impacto de um sistema de agendamento antecipado de docas para carga e descarga na gest\u00e3o da cadeia de suprimentos. Revista Produ\u00e7\u00e3o Online 6:3\u201396, set.\/dez.","journal-title":"Revista Produ\u00e7\u00e3o Online"},{"key":"42_CR11","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 131:282\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"42_CR12","first-page":"85","volume":"7","author":"V M Silva","year":"2007","unstructured":"Silva, V M D, Coelho, A S (2007) Uma vis\u00e3o sobre o problema de aloca\u00e7\u00e3o de ber\u00e7os. Revista Produ\u00e7\u00e3o Online 7:2:85\u201398.","journal-title":"Revista Produ\u00e7\u00e3o Online"},{"key":"42_CR13","unstructured":"Silva, V M D, Coelho, A S (2008) Modelo heur\u00edstico para a resolu\u00e7\u00e3o de um problema operacional portu\u00e1rio utilizando algoritmos gen\u00e9ticos. Actas del XV Congreso Panamericano de Inginieria Transito y Transporte (PANAM). Cartagena das Indias."}],"container-title":["Dynamics in Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11996-5_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:01:35Z","timestamp":1619784095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11996-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642119958","9783642119965"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11996-5_42","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}