{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:28:26Z","timestamp":1768696106962,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s12293-019-00292-3","type":"journal-article","created":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T07:02:48Z","timestamp":1565247768000},"page":"51-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":67,"title":["An Adaptive Island Evolutionary Algorithm for the berth scheduling problem"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8456-9736","authenticated-orcid":false,"given":"Maxim A.","family":"Dulebenets","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"292_CR1","volume-title":"Review of maritime transport 2017","author":"UNCTAD","year":"2017","unstructured":"UNCTAD (2017) Review of maritime transport 2017. United Nations Conference on Trade and Development, New York"},{"key":"292_CR2","unstructured":"Journal of Commerce (2015) Largest container ships on order to rise 13 percent by 2020. \nwww.joc.com\n\n. Accessed 06 Jan 2018"},{"issue":"3","key":"292_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","volume":"244","author":"C Bierwirth","year":"2015","unstructured":"Bierwirth C, Meisel F (2015) A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 244(3):675\u2013689","journal-title":"Eur J Oper Res"},{"issue":"2","key":"292_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1108\/MABR-02-2017-0010","volume":"2","author":"A Dadashi","year":"2017","unstructured":"Dadashi A, Dulebenets MA, Golias MM, Sheikholeslami A (2017) A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations. Marit Bus Rev 2(2):142\u2013157","journal-title":"Marit Bus Rev"},{"key":"292_CR5","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.cor.2013.07.018","volume":"41","author":"M Golias","year":"2014","unstructured":"Golias M, Portal MI, Konur D, Kaisar E, Kolomvos G (2014) Robust berth scheduling at marine container terminals via hierarchical optimization. Comput Oper Res 41:412\u2013422","journal-title":"Comput Oper Res"},{"issue":"21","key":"292_CR6","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 J, Alvarez-Valdes R, Koulouris G, Tamarit J (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"},{"issue":"4","key":"292_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1108\/MABR-04-2017-0012","volume":"2","author":"MA Dulebenets","year":"2017","unstructured":"Dulebenets MA (2017) A novel memetic algorithm with a deterministic parameter control for efficient berth scheduling at marine container terminals. Marit Bus Rev 2(4):302\u2013330","journal-title":"Marit Bus Rev"},{"issue":"1","key":"292_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TITS.2017.2688132","volume":"19","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets MA (2018) Application of evolutionary computation for berth scheduling at marine container terminals: parameter tuning versus parameter control. IEEE Trans Intell Transp Syst 19(1):25\u201337","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"7","key":"292_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a11070100","volume":"11","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets MA, Kavoosi M, Abioye OF, Pasha J (2018) A self-adaptive evolutionary algorithm for the berth scheduling problem: towards efficient parameter control. Algorithms 11(7):1\u201335","journal-title":"Algorithms"},{"key":"292_CR10","doi-asserted-by":"publisher","first-page":"8131","DOI":"10.1109\/ACCESS.2017.2693030","volume":"5","author":"MA Dulebenets","year":"2017","unstructured":"Dulebenets MA, Moses R, Ozguven EE, Vanli A (2017) Minimizing carbon dioxide emissions due to container handling at marine container terminals via hybrid evolutionary algorithms. IEEE Access 5:8131\u20138147","journal-title":"IEEE Access"},{"issue":"1","key":"292_CR11","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tre.2006.05.002","volume":"44","author":"A Imai","year":"2008","unstructured":"Imai A, Nishimura E, Paradimitriou S (2008) Berthing ships at a multi-user container terminal with a limited quay capacity. Transp Res Part E 44(1):136\u2013151","journal-title":"Transp Res Part E"},{"key":"292_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.engappai.2017.11.009","volume":"69","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets MA, Golias M, Mishra S (2018) A collaborative agreement for berth allocation under excessive demand. Eng Appl Artif Intell 69:76\u201392","journal-title":"Eng Appl Artif Intell"},{"issue":"1\u20134","key":"292_CR13","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00170-012-4186-0","volume":"65","author":"J Karafa","year":"2013","unstructured":"Karafa J, Golias M, Ivey S, Saharidis G, Leonardos N (2013) The berth allocation problem with stochastic vessel handling times. Int J Adv Manuf Technol 65(1\u20134):473\u2013484","journal-title":"Int J Adv Manuf Technol"},{"key":"292_CR14","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.cie.2015.04.035","volume":"89","author":"Z Hu","year":"2015","unstructured":"Hu Z (2015) Multi-objective genetic algorithm for berth allocation problem considering daytime preference. Comput Ind Eng 89:2\u201314","journal-title":"Comput Ind Eng"},{"issue":"1","key":"292_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10479-010-0820-0","volume":"192","author":"Y Xu","year":"2011","unstructured":"Xu Y, Chen Q, Quan X (2011) Robust berth scheduling with uncertain vessel delay and handling time. Ann Oper Res 192(1):123\u2013140","journal-title":"Ann Oper Res"},{"issue":"4","key":"292_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1057\/jors.2015.78","volume":"67","author":"S Emde","year":"2016","unstructured":"Emde S, Boysen N (2016) Berth allocation in container terminals that service feeder ships and deep-sea vessels. J Oper Res Soc 67(4):551\u2013563","journal-title":"J Oper Res Soc"},{"issue":"6","key":"292_CR17","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","volume":"46","author":"D Lee","year":"2010","unstructured":"Lee D, Chen J, Cao J (2010) The continuous Berth Allocation Problem: a greedy randomized adaptive search solution. Transp Res Part E 46(6):1017\u20131029","journal-title":"Transp Res Part E"},{"issue":"4","key":"292_CR18","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1287\/trsc.1050.0120","volume":"39","author":"J Cordeau","year":"2005","unstructured":"Cordeau J, Laporte G, Legato P, Moccia L (2005) Models and Tabu Search heuristics for the berth allocation problem. Transp Sci 39(4):526\u2013538","journal-title":"Transp Sci"},{"issue":"6","key":"292_CR19","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, Melian-Batista B, Moreno-Vega J (2012) Artificial intelligence hybrid heuristic based on Tabu search for the dynamic berth allocation problem. Eng Appl Artif Intell 25(6):1132\u20131141","journal-title":"Eng Appl Artif Intell"},{"key":"292_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tre.2014.09.013","volume":"72","author":"A Imai","year":"2014","unstructured":"Imai A, Yamakawa Y, Huang K (2014) The strategic berth template problem. Transp Res Part E 72:77\u2013100","journal-title":"Transp Res Part E"},{"issue":"333\u2013350","key":"292_CR21","first-page":"16","volume":"116","author":"C Cheong","year":"2008","unstructured":"Cheong C, Tan K (2008) A multi-objective multi-colony ant algorithm for solving the berth allocation problem. Stud Comput Intell 116(333\u2013350):16","journal-title":"Stud Comput Intell"},{"issue":"3","key":"292_CR22","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","volume":"191","author":"P Hansen","year":"2008","unstructured":"Hansen P, Oguz C, Mladenovic N (2008) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3):636\u2013649","journal-title":"Eur J Oper Res"},{"key":"292_CR23","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.cor.2016.01.002","volume":"70","author":"G Mauri","year":"2016","unstructured":"Mauri G, Ribeiro G, Lorena L, Laporte G (2016) An adaptive large neighborhood search for the discrete and continuous berth allocation problem. Comput Oper Res 70:140\u2013154","journal-title":"Comput Oper Res"},{"key":"292_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to evolutionary computing","author":"AE Eiben","year":"2015","unstructured":"Eiben AE, Smith JE (2015) Introduction to evolutionary computing. Springer, Berlin"},{"issue":"1","key":"292_CR25","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ijtst.2017.09.003","volume":"7","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets MA (2018) Green vessel scheduling in liner shipping: modeling carbon dioxide emission costs in sea and at ports of call. Int J Transp Sci Technol 7(1):26\u201344","journal-title":"Int J Transp Sci Technol"},{"key":"292_CR26","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ijpe.2017.10.027","volume":"196","author":"MA Dulebenets","year":"2018","unstructured":"Dulebenets MA (2018) A comprehensive multi-objective optimization model for the vessel scheduling problem in liner shipping. Int J Prod Econ 196:293\u2013318","journal-title":"Int J Prod Econ"},{"issue":"1","key":"292_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1109\/TITS.2018.2801823","volume":"20","author":"MA Dulebenets","year":"2019","unstructured":"Dulebenets MA (2019) Minimizing the total liner shipping route service costs via application of an efficient collaborative agreement. IEEE Trans Intell Transp Syst 20(1):123\u2013136","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"292_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12293-010-0040-9","volume":"2","author":"W Jakob","year":"2010","unstructured":"Jakob W (2010) A general cost-benefit-based adaptation framework for multimeme algorithms. Memet Comput 2(3):201\u2013218","journal-title":"Memet Comput"},{"issue":"4","key":"292_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s12293-011-0071-x","volume":"3","author":"S Muthuswamy","year":"2011","unstructured":"Muthuswamy S, Lam S (2011) Discrete particle swarm optimization for the team orienteering problem. Memet Comput 3(4):287\u2013303","journal-title":"Memet Comput"},{"issue":"4","key":"292_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s12293-013-0120-8","volume":"5","author":"A LaTorre","year":"2013","unstructured":"LaTorre A, Muelas S, Pe\u00f1a J (2013) Evaluating the multiple offspring sampling framework on complex continuous optimization functions. Memet Comput 5(4):295\u2013309","journal-title":"Memet Comput"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00292-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-019-00292-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-019-00292-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T23:29:30Z","timestamp":1596756570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-019-00292-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["292"],"URL":"https:\/\/doi.org\/10.1007\/s12293-019-00292-3","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,8]]},"assertion":[{"value":"19 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}