{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T12:21:24Z","timestamp":1772886084508,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T00:00:00Z","timestamp":1621555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10489-021-02420-4","type":"journal-article","created":{"date-parts":[[2021,5,21]],"date-time":"2021-05-21T10:02:42Z","timestamp":1621591362000},"page":"1406-1434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The impact of time windows constraints on metaheuristics implementation: a study for the Discrete and Dynamic Berth Allocation Problem"],"prefix":"10.1007","volume":"52","author":[{"given":"Fl\u00e1via","family":"Barbosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priscila C. Berbert","family":"Rampazzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anibal Tavares","family":"de Azevedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akebo","family":"Yamakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,21]]},"reference":[{"issue":"1","key":"2420_CR1","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","volume":"264","author":"A Agra","year":"2018","unstructured":"Agra A, Oliveira M (2018) Mip approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur J Oper Res 264(1):138\u2013148","journal-title":"Eur J Oper Res"},{"key":"2420_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 1: basic algorithms and operators, vol 1. CRC press","DOI":"10.1201\/9781420034349"},{"key":"2420_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Fogel DB, Michalewicz Z (2000) Evolutionary computation 2: advanced algorithms and operators, vol 1. CRC press","DOI":"10.1201\/9781420034349"},{"key":"2420_CR4","unstructured":"Banks J (2005) Discrete event system simulation. Prentice Hall"},{"issue":"4","key":"2420_CR5","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.cie.2010.12.018","volume":"60","author":"VH Barros","year":"2011","unstructured":"Barros VH, Costa TS, Oliveira AC, Lorena LA (2011) Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering 60(4):606\u2013613","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"2420_CR6","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: Logistics and Transportation Review 47(4):461\u2013473","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"3","key":"2420_CR7","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/TITS.2019.2910283","volume":"21","author":"RT Cahyono","year":"2019","unstructured":"Cahyono RT, Flonk EJ, Jayawardhana B (2019) Discrete-event systems modeling and the model predictive allocation algorithm for integrated berth and quay crane allocation. IEEE Trans Intell Transp Syst 21 (3):1321\u20131331","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"2420_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.eswa.2017.07.028","volume":"89","author":"JF Correcher","year":"2017","unstructured":"Correcher JF, Alvarez-Valdes R (2017) A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem. Expert Syst Appl 89:112\u2013128","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2420_CR9","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.ejor.2018.07.019","volume":"272","author":"JF Correcher","year":"2019","unstructured":"Correcher JF, Van den Bossche T, Alvarez-Valdes R, Berghe GV (2019) The berth allocation problem in terminals with irregular layouts. Eur J Oper Res 272(3):1096\u20131108","journal-title":"Eur J Oper Res"},{"key":"2420_CR10","volume-title":"Particle swarm optimization","author":"KL Du","year":"2016","unstructured":"Du KL, Swamy MNS (2016) Particle swarm optimization. Springer International Publishing, Cham"},{"issue":"4","key":"2420_CR11","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1287\/trsc.2014.0568","volume":"49","author":"Y Du","year":"2015","unstructured":"Du Y, Chen Q, Lam JSL, Xu Y, Cao JX (2015) Modeling the impacts of tides and the virtual arrival policy in berth allocation. Transp Sci 49(4):939\u2013956","journal-title":"Transp Sci"},{"key":"2420_CR12","unstructured":"Eberhart, Shi Y (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 congress on evolutionary computation (IEEE Cat.No.01TH8546). vol 1, pp 81\u201386"},{"key":"2420_CR13","doi-asserted-by":"crossref","unstructured":"Eberhart RC, Shi Y (1998) Comparison between genetic algorithms and particle swarm optimization. Springer Berlin Heidelberg","DOI":"10.1007\/BFb0040812"},{"issue":"21","key":"2420_CR14","doi-asserted-by":"publisher","first-page":"7356","DOI":"10.1016\/j.eswa.2015.05.018","volume":"42","author":"P Frojan","year":"2015","unstructured":"Frojan P, Correcher JF, Alvarez-Valdes R, Koulouris G, Tamarit JM (2015) The continuous berth allocation problem in a container terminal with multiple quays. Expert Syst Appl 42(21):7356\u20137366","journal-title":"Expert Syst Appl"},{"key":"2420_CR15","volume-title":"Genetic algorithms in search, optimization and machine learning, 1 edn.","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning, 1 edn. Addison-Wesley, Reading"},{"key":"2420_CR16","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.swevo.2015.11.002","volume":"27","author":"HP Hsu","year":"2016","unstructured":"Hsu HP (2016) A HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously. Swarm and Evolutionary Computation 27:156\u2013168","journal-title":"Swarm and Evolutionary Computation"},{"issue":"5","key":"2420_CR17","doi-asserted-by":"publisher","first-page":"764","DOI":"10.3390\/math8050764","volume":"8","author":"HP Hsu","year":"2020","unstructured":"Hsu HP, Wang CN (2020) Resources planning for container terminal in a maritime supply chain using multiple particle swarms optimization (mpso). Mathematics 8(5):764","journal-title":"Mathematics"},{"issue":"6","key":"2420_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s12046-019-1128-7","volume":"44","author":"BC Jos","year":"2019","unstructured":"Jos BC, Harimanikandan M, Rajendran C, Ziegler H (2019) Minimum cost berth allocation problem in maritime logistics: new mixed integer programming models. Sadhana 44(6):149","journal-title":"Sadhana"},{"key":"2420_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1108\/MABR-08-2019-0032","volume":"5","author":"M Kavoosi","year":"2019","unstructured":"Kavoosi M, Dulebenets MA, Abioye O, Pasha J, Theophilus O, Wang H, Kampmann R, Mikijeljevic M (2019) Berth scheduling at marine container terminals: a universal island-based metaheuristic approach. Maritime Business Review 5:1","journal-title":"Maritime Business Review"},{"key":"2420_CR20","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 JL, Meli\u00e1n-Batista B, Moreno-Vega JM (2014) Biased random key genetic algorithm for the tactical berth allocation problem. Appl Soft Comput 22:60\u201376","journal-title":"Appl Soft Comput"},{"issue":"4","key":"2420_CR21","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/s10696-017-9298-2","volume":"30","author":"SW Lin","year":"2018","unstructured":"Lin SW, Ting CJ, Wu KC (2018) Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem. Flex Serv Manuf J 30(4):740\u2013763","journal-title":"Flex Serv Manuf J"},{"issue":"2","key":"2420_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1287\/trsc.1120.0419","volume":"47","author":"F Meisel","year":"2013","unstructured":"Meisel F, Bierwirth C (2013) A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transp Sci 47(2):131\u2013147","journal-title":"Transp Sci"},{"key":"2420_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic algorithms + data structures = evolution programs, 3rd edn.","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z (1996) Genetic algorithms + data structures = evolution programs, 3rd edn. Springer, Berlin"},{"issue":"1","key":"2420_CR24","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10479-017-2715-9","volume":"286","author":"T Nishi","year":"2020","unstructured":"Nishi T, Okura T, Lalla-Ruiz E, Vo\u00df S (2020) A dynamic programming-based matheuristic for the dynamic berth allocation problem. Annals Oper Res 286(1):391\u2013410","journal-title":"Annals Oper Res"},{"issue":"11","key":"2420_CR25","first-page":"14136","volume":"38","author":"B Raa","year":"2011","unstructured":"Raa B, Dullaert W, Schaeren RV (2011) An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Syst Appl 38(11):14136\u201314147","journal-title":"Expert Syst Appl"},{"issue":"3","key":"2420_CR26","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1016\/j.ejor.2014.02.059","volume":"237","author":"E Silva","year":"2014","unstructured":"Silva E, Oliveira JF, Wascher G (2014) 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems. Eur J Oper Res 237(3):846\u2013856","journal-title":"Eur J Oper Res"},{"key":"2420_CR27","doi-asserted-by":"crossref","unstructured":"Tavakkoli-Moghaddam R, Fatemi-Anaraki S, Abdolhamidi D, Vahedi-Nouri B (2019) Integrated waterway scheduling, berth allocation and quay crane assignment problem by using a hybrid flow shop concept. In: 2019 international conference on industrial engineering and systems management (IESM). IEEE, pp 1\u20135","DOI":"10.1109\/IESM45758.2019.8948202"},{"issue":"4, Part 1","key":"2420_CR28","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.eswa.2013.08.051","volume":"41","author":"CJ Ting","year":"2014","unstructured":"Ting CJ, Wu KC, Chou H (2014) Particle swarm optimization algorithm for the berth allocation problem. Expert Systems with Applications 41(4, Part 1):1543\u20131550","journal-title":"Expert Systems with Applications"},{"key":"2420_CR29","unstructured":"UNCTAD (2016) United nations conference on trade and development - review of maritime transport"}],"updated-by":[{"DOI":"10.1007\/s10489-021-02571-4","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000}}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02420-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02420-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T01:09:49Z","timestamp":1642986589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02420-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,21]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["2420"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02420-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,21]]},"assertion":[{"value":"6 March 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2021","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10489-021-02571-4","URL":"https:\/\/doi.org\/10.1007\/s10489-021-02571-4","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}