{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:16:05Z","timestamp":1726514165670},"reference-count":39,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1016\/j.ejor.2019.11.055","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T01:10:56Z","timestamp":1574989856000},"page":"844-862","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Selecting algorithms for large berth allocation problems"],"prefix":"10.1016","volume":"283","author":[{"given":"Jakub","family":"Wawrzyniak","sequence":"first","affiliation":[]},{"given":"Maciej","family":"Drozdowski","sequence":"additional","affiliation":[]},{"given":"\u00c9ric","family":"Sanlaville","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0001","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/j.ejor.2009.05.031","article-title":"A survey of berth allocation and quay crane scheduling problems in container terminals","volume":"202","author":"Bierwirth","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0002","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.ejor.2014.12.030","article-title":"A follow-up survey of berth allocation and quay crane scheduling problems in container terminals","volume":"244","author":"Bierwirth","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2019.11.055_bib0003","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/s10951-015-0427-z","article-title":"On contiguous and non-contiguous parallel task scheduling","volume":"18","author":"B\u0142\u0105dek","year":"2015","journal-title":"Journal of Scheduling"},{"issue":"4","key":"10.1016\/j.ejor.2019.11.055_bib0004","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.tre.2010.11.016","article-title":"Models for the discrete berth allocation problem: A computational comparison","volume":"47","author":"Buhrkal","year":"2011","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"4","key":"10.1016\/j.ejor.2019.11.055_bib0005","doi-asserted-by":"crossref","first-page":"801","DOI":"10.2478\/v10175-012-0093-7","article-title":"Hyper-heuristics for cross-domain search","volume":"60","author":"Cichowicz","year":"2012","journal-title":"Bulletin of the Polish Academy of Sciences Technical Sciences"},{"key":"10.1016\/j.ejor.2019.11.055_bib0006","series-title":"Proceedings of the 23rd annual ACM symposium on theory of computing, STOC","first-page":"241","article-title":"Proof of the 4\/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling","author":"Coffman","year":"1991"},{"issue":"4","key":"10.1016\/j.ejor.2019.11.055_bib0007","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1287\/trsc.1050.0120","article-title":"Models and tabu search heuristics for the berth-allocation problem","volume":"39","author":"Cordeau","year":"2005","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.11.055_bib0008","unstructured":"Drozdowski, M., Wawrzyniak, J., & Sanlaville, E. (2019). Resources for algorithm selection for large berth allocation problem. http:\/\/www.cs.put.poznan.pl\/mdrozdowski\/asp-bap\/ [accessed 25.03.2019]."},{"issue":"7","key":"10.1016\/j.ejor.2019.11.055_bib0009","doi-asserted-by":"crossref","first-page":"100","DOI":"10.3390\/a11070100","article-title":"A self-adaptive evolutionary algorithm for the berth scheduling problem: Towards efficient parameter control","volume":"11","author":"Dulebenets","year":"2018","journal-title":"Algorithms"},{"key":"10.1016\/j.ejor.2019.11.055_sbref0009","series-title":"Automatic algorithm selection for complex simulation problems","author":"Ewald","year":"2010"},{"issue":"2","key":"10.1016\/j.ejor.2019.11.055_bib0011","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.trb.2009.07.003","article-title":"Modeling and solving the tactical berth allocation problem","volume":"44","author":"Giallombardo","year":"2010","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0012","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2006.12.057","article-title":"Variable neighborhood search for minimum cost berth allocation","volume":"191","author":"Hansen","year":"2008","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.11.055_bib0013","unstructured":"Hansen, P., & O\u011fguz, C. (2003). A note on formulations of the static and dynamic berth allocation problems. Technical Report G-2003-30, GERAD."},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0014","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/s10696-011-9120-5","article-title":"Strategic allocation of cyclically calling vessels for multi-terminal container operators","volume":"24","author":"Hendriks","year":"2012","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0015","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00291-010-0198-z","article-title":"Robust cyclic berth planning of container vessels","volume":"32","author":"Hendriks","year":"2010","journal-title":"OR Spectrum"},{"issue":"1","key":"10.1016\/j.ejor.2019.11.055_bib0016","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1017\/S1471068414000015","article-title":"Aspeed: Solver scheduling via answer set programming","volume":"15","author":"Hoos","year":"2015","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/j.ejor.2019.11.055_bib0017","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.tre.2014.09.013","article-title":"The strategic berth template problem","volume":"72","author":"Imai","year":"2014","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2019.11.055_bib0018","series-title":"Proceedings of the 17th International Conference on Principles and Oractice of Constraint Programming","first-page":"454","article-title":"Algorithm selection and scheduling","author":"Kadioglu","year":"2011"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0019","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","article-title":"Algorithm selection for combinatorial search problems: A survey","volume":"35","author":"Kotthoff","year":"2014","journal-title":"AI Magazine"},{"issue":"6","key":"10.1016\/j.ejor.2019.11.055_bib0020","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1016\/j.engappai.2012.06.001","article-title":"Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem","volume":"25","author":"Lalla-Ruiz","year":"2012","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"6","key":"10.1016\/j.ejor.2019.11.055_bib0021","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1016\/j.tre.2010.01.009","article-title":"The continuous berth allocation problem: A greedy randomized adaptive search solution","volume":"46","author":"Lee","year":"2010","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2019.11.055_bib0022","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2014.10.003","article-title":"Integrating tactical and operational berth allocation decisions via simulation-optimization","volume":"78","author":"Legato","year":"2014","journal-title":"Computers & Industrial Engineering"},{"issue":"11","key":"10.1016\/j.ejor.2019.11.055_bib0023","doi-asserted-by":"crossref","first-page":"3163","DOI":"10.1007\/s00521-016-2226-7","article-title":"Berth and quay crane coordinated scheduling using multi-objective chaos cloud particle swarm optimization algorithm","volume":"28","author":"Li","year":"2017","journal-title":"Neural Computing and Applications"},{"issue":"4","key":"10.1016\/j.ejor.2019.11.055_bib0024","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00291-006-0036-5","article-title":"Berth management in container terminal: the template design problem","volume":"28","author":"Moorthy","year":"2006","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2019.11.055_bib0025","series-title":"Proceedings of the irish conference on artificial intelligence and cognitive science","article-title":"Using case-based reasoning in an algorithm portfolio for constraint solving","author":"O\u2019Mahony","year":"2008"},{"key":"10.1016\/j.ejor.2019.11.055_sbref0024","series-title":"The algorithm selection problem","author":"Rice","year":"1975"},{"issue":"2","key":"10.1016\/j.ejor.2019.11.055_bib0027","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10489-013-0462-4","article-title":"A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds","volume":"40","author":"Rodriguez-Molins","year":"2014","journal-title":"Applied Intelligence"},{"key":"10.1016\/j.ejor.2019.11.055_bib0028","series-title":"The stochastic discrete berth allocation problem","first-page":"1","author":"Schepler","year":"2018"},{"key":"10.1016\/j.ejor.2019.11.055_bib0029","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tre.2016.12.002","article-title":"Global planning in a multi-terminal and multi-modal maritime container port","volume":"100","author":"Schepler","year":"2017","journal-title":"Transportation Research Part E"},{"issue":"1","key":"10.1016\/j.ejor.2019.11.055_bib0030","doi-asserted-by":"crossref","DOI":"10.1145\/1456650.1456656","article-title":"Cross-disciplinary perspectives on meta-learning for algorithm selection","volume":"41","author":"Smith-Miles","year":"2008","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/j.ejor.2019.11.055_bib0031","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","article-title":"Measuring instance difficulty for combinatorial optimization problems","volume":"39","author":"Smith-Miles","year":"2012","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.11.055_bib0032","first-page":"77","article-title":"Port competition in the northern range from le havre to hamburg","volume":"18","author":"Thorez","year":"2012","journal-title":"PROMET-Traffic&Transportation"},{"issue":"5","key":"10.1016\/j.ejor.2019.11.055_bib0033","first-page":"405","article-title":"Port privatization, efficiency and competitiveness: Some empirical evidence from container ports (terminals)","volume":"39","author":"Tongzon","year":"2005","journal-title":"Transportation Research Part A: Policy and Practice"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0034","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1057\/palgrave.mel.9100182","article-title":"Schedule unreliability in liner shipping: origins and consequences for the hinterland supply chain","volume":"9","author":"Vernimmen","year":"2007","journal-title":"Maritime Economics & Logistics"},{"key":"10.1016\/j.ejor.2019.11.055_bib0035","series-title":"Heuristics for long time horizon berth allocation problem","author":"Wawrzyniak","year":"2017"},{"issue":"6","key":"10.1016\/j.ejor.2019.11.055_bib0036","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1080\/03088830802469329","article-title":"Port and terminal selection by deep-sea container operators","volume":"35","author":"Wiegmans","year":"2008","journal-title":"Maritime Policy & Management"},{"issue":"3","key":"10.1016\/j.ejor.2019.11.055_bib0037","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.ejor.2015.05.079","article-title":"Tactical berth allocation under uncertainty","volume":"247","author":"Zhen","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.11.055_bib0038","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/trsc.1100.0364","article-title":"An integrated model for berth template and yard template planning in transshipment hubs","volume":"45","author":"Zhen","year":"2011","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.11.055_bib0039","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/j.trb.2017.10.008","article-title":"Daily berth planning in a tidal port with channel flow control","volume":"106","author":"Zhen","year":"2017","journal-title":"Transportation Research Part B: Methodological"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719309671?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719309671?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T11:16:03Z","timestamp":1656587763000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719309671"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["S0377221719309671"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.ejor.2019.11.055","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2020,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Selecting algorithms for large berth allocation problems","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.11.055","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
