{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T11:08:05Z","timestamp":1794481685347,"version":"4.9.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319095837","type":"print"},{"value":"9783319095844","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-09584-4_20","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T08:00:41Z","timestamp":1406793641000},"page":"218-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a Matheuristic Approach for the Berth Allocation Problem"],"prefix":"10.1007","author":[{"given":"Eduardo An\u00edbal","family":"Lalla-Ruiz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","volume":"202","author":"C Bierwirth","year":"2010","unstructured":"Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202(3), 615\u2013627 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","volume":"47","author":"K Buhrkal","year":"2011","unstructured":"Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., Lusby, R.: Models for the discrete berth allocation problem: a computational comparison. Transp. Res. Part E 47(4), 461\u2013473 (2011)","journal-title":"Transp. Res. Part E"},{"key":"20_CR3","unstructured":"Christensen, C.G., Holst, C.T.: Berth allocation in container terminals. Master\u2019s thesis, Technical University of Denmark (2008)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J.F., Laporte, G., Legato, P., Moccia, L.: Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 39, 526\u2013538 (2005)","journal-title":"Transp. Sci."},{"issue":"5","key":"20_CR5","doi-asserted-by":"publisher","first-page":"5499","DOI":"10.1016\/j.eswa.2011.11.072","volume":"39","author":"RM de Oliveira","year":"2012","unstructured":"de Oliveira, R.M., Mauri, G.R., Lorena, L.A.N.: Clustering search for the berth allocation problem. Expert Syst. Appl. 39(5), 5499\u20135505 (2012)","journal-title":"Expert Syst. Appl."},{"issue":"6","key":"20_CR6","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1016\/j.engappai.2012.06.001","volume":"25","author":"E Lalla-Ruiz","year":"2012","unstructured":"Lalla-Ruiz, E., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Eng. Appl. Artif. Intell. 25(6), 1132\u20131141 (2012)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"20_CR7","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551\u2013578 (2006)","journal-title":"Control Cybern."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"T Ching-Jung","year":"2014","unstructured":"Ching-Jung, T., Kun-Chih, W., Hao, C.: Particle swarm optimization algorithm for the berth allocation problem. Expert Syst. Appl. 41, 1543\u20131550 (2014)","journal-title":"Expert Syst. Appl."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"\u00c9 Taillard","year":"2002","unstructured":"Taillard, \u00c9., Vo\u00df, S.: POPMUSIC - partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Kluwer, Boston (2002)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09584-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:40:52Z","timestamp":1676853652000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09584-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095837","9783319095844"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09584-4_20","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-09584-4","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}