{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T01:02:00Z","timestamp":1772931720639,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,11,20]],"date-time":"2017-11-20T00:00:00Z","timestamp":1511136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,20]],"date-time":"2017-11-20T00:00:00Z","timestamp":1511136000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15H02971"],"award-info":[{"award-number":["15H02971"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10479-017-2715-9","type":"journal-article","created":{"date-parts":[[2017,11,20]],"date-time":"2017-11-20T11:17:01Z","timestamp":1511176621000},"page":"391-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["A dynamic programming-based matheuristic for the dynamic berth allocation problem"],"prefix":"10.1007","volume":"286","author":[{"given":"Tatsushi","family":"Nishi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuya","family":"Okura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Lalla-Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,20]]},"reference":[{"key":"2715_CR1","doi-asserted-by":"publisher","first-page":"6536","DOI":"10.1016\/j.apm.2016.01.059","volume":"40","author":"H Bae","year":"2016","unstructured":"Bae, H., & Moon, I. (2016). Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Applied Mathematical Modeling, 40, 6536\u20136549.","journal-title":"Applied Mathematical Modeling"},{"key":"2715_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. (2011). Models for the discrete berth allocation problem: A computational comparison. Transportation Research Part E, 47, 461\u2013473.","journal-title":"Transportation Research Part E"},{"issue":"2","key":"2715_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10472-013-9339-9","volume":"69","author":"M Caserta","year":"2013","unstructured":"Caserta, M., & Vo\u00df, S. (2013). A math-heuristic Dantzig\u2013Wolfe algorithm for capacitated lot sizing. Annals of Mathematics and Artificial Intelligence, 69(2), 207\u2013224.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2715_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14, 52\u201367.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"2715_CR5","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. (2005). Models and tabu search heuristics for the berth allocation problem. Transportation Science, 39(4), 526\u2013538.","journal-title":"Transportation Science"},{"issue":"8","key":"2715_CR6","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"2715_CR7","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. (2012). Clustering search for the berth allocation problem. Expert Systems with Applications, 39(5), 5499\u20135505.","journal-title":"Expert Systems with Applications"},{"key":"2715_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0167-6377(03)00064-6","volume":"32","author":"A Grosso","year":"2004","unstructured":"Grosso, A., Croce, F. D., & Tadei, R. (2004). An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Operations Research Letters, 32, 68\u201372.","journal-title":"Operations Research Letters"},{"key":"2715_CR9","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","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, 35, 401\u2013417.","journal-title":"Transportation Research Part B"},{"key":"2715_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.asoc.2014.04.035","volume":"22","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., Gonz\u00e1lez-Velarde, J. L., Mel\u00edan-Batista, B., & Moreno-Vega, J. M. (2014). Biased random key genetic algorithm for the tactical berth allocation problem. Applied Soft Computing, 22, 60\u201376.","journal-title":"Applied Soft Computing"},{"key":"2715_CR11","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, M. (2012). Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem. Engineering Applications of Artificial Intelligence, 25, 1132\u20131141.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2715_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10472-014-9444-4","volume":"76","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz, E., & Vo\u00df, S. (2016). POPMUSIC as a matheuristic for the berth allocation problem. Annals of Mathematics and Artificial Intelligence, 76, 173\u2013189.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2715_CR13","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.cor.2016.01.002","volume":"70","author":"GR Mauri","year":"2016","unstructured":"Mauri, G. R., Ribeiro, G. M., Lorena, L. A. N., & Laporte, G. (2016). An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Computers and Operations Research, 70, 140\u2013154.","journal-title":"Computers and Operations Research"},{"key":"2715_CR14","doi-asserted-by":"publisher","first-page":"4778","DOI":"10.1080\/00207543.2013.774469","volume":"51","author":"T Nishi","year":"2013","unstructured":"Nishi, T., & Hiranaka, Y. (2013). Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness. International Journal of Production Research, 51, 4778\u20134796.","journal-title":"International Journal of Production Research"},{"key":"2715_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cor.2009.04.008","volume":"37","author":"T Nishi","year":"2010","unstructured":"Nishi, T., Hiranaka, Y., & Inuiguchi, M. (2010). Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness. Computers and Operations Research, 37, 189\u2013198.","journal-title":"Computers and Operations Research"},{"key":"2715_CR16","unstructured":"Potts, C. N., & Van de Velde, S. L. (1995). Dynasearch\u2014Iterative local improvement by dynamic programming: Part I, traveling salesman problem. Technical Report, University of Twente."},{"key":"2715_CR17","unstructured":"Saadaoui, Y., Umang, N., & Frejinger, E. (2016). A column generation framework for berth scheduling at port terminals. CIRRELT-2015-15. \nhttps:\/\/www.cirrelt.ca\/DocumentsTravail\/CIRRELT-2015-15.pdf\n\n. (Available on 2016)."},{"key":"2715_CR18","first-page":"551","volume":"35\u20133","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., & Vo\u00df, S. (2006). The corridor method: A dynamic programming inspired metaheuristic. Control and Cybernetics, 35\u20133, 551\u2013578.","journal-title":"Control and Cybernetics"},{"key":"2715_CR19","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/j.orl.2005.06.005","volume":"34","author":"F Sourd","year":"2006","unstructured":"Sourd, F. (2006). Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints. Operations Research Letters, 34, 591\u2013598.","journal-title":"Operations Research Letters"},{"key":"2715_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00291-003-0157-z","volume":"26","author":"D Steenken","year":"2004","unstructured":"Steenken, D., Vo\u00df, S., & Stahlbook, R. (2004). Container terminal operations and operations research\u2014A classification and literature review. OR Spectum, 26, 3\u201349.","journal-title":"OR Spectum"},{"key":"2715_CR21","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and Surveys in Metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard, E., & Vo\u00df, S. (2002). POPMUSIC\u2014Partial optimization metaheuristic under special intensification conditions. In C. Ribeiro & P. Hansen (Eds.), Essays and Surveys in Metaheuristics (pp. 613\u2013629). Boston, MA: Kluwer."},{"issue":"4","key":"2715_CR22","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"CJ Ting","year":"2014","unstructured":"Ting, C. J., Wu, K. C., & Chou, H. (2014). Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications, 41(4), 1543\u20131550.","journal-title":"Expert Systems with Applications"},{"key":"2715_CR23","unstructured":"UNCTAD. (2016). Review of maritime transport. \nhttp:\/\/unctad.org\/en\/PublicationsLibrary\/rmt2016_en.pdf\n\n. (Available on 2016)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2715-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2715-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2715-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:53:06Z","timestamp":1589730786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2715-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,20]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2715"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2715-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,20]]},"assertion":[{"value":"20 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}