{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T18:15:04Z","timestamp":1783188904498,"version":"3.54.6"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFB1710802"],"award-info":[{"award-number":["2020YFB1710802"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cie.2026.112092","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:29:35Z","timestamp":1778167775000},"page":"112092","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Robust optimization for the integrated berth allocation, quay crane assignment, and yard assignment problem"],"prefix":"10.1016","volume":"218","author":[{"given":"Yuxuan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chenhan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianguang","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuzhen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1803-8678","authenticated-orcid":false,"given":"Yu","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cie.2026.112092_b0005","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.ejor.2017.05.040","article-title":"MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem","volume":"264","author":"Agra","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112092_b0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2022.07.009","article-title":"Distributionally robust optimization for the berth allocation problem under uncertainty","volume":"164","author":"Agra","year":"2022","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.cie.2026.112092_b0015","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"},{"key":"10.1016\/j.cie.2026.112092_b0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2024.103456","article-title":"Integrated planning of berth allocation, quay crane assignment and yard assignment in multiple cooperative terminals","volume":"183","author":"Guo","year":"2024","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0025","first-page":"441","article-title":"Simultaneous berth allocation and yard planning at tactical level","volume":"35","author":"Hendriks","year":"2013","journal-title":"Spectr"},{"key":"10.1016\/j.cie.2026.112092_b0030","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.tre.2007.03.003","article-title":"The simultaneous berth and quay crane allocation problem","volume":"44","author":"Imai","year":"2008","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0035","article-title":"A prescriptive analytics approach to solve the continuous berth allocation and yard assignment problem using integrated carbon emissions policies","author":"Jauhar","year":"2023","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2026.112092_b0040","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.tre.2014.11.009","article-title":"Tactical berth and yard template design at container transshipment terminals: A column generation based approach","volume":"73","author":"Jin","year":"2015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0045","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.tre.2012.08.006","article-title":"Feeder vessel management at container transshipment terminals","volume":"49","author":"Lee","year":"2013","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0050","article-title":"Joint planning for yard storage space and home berths in container terminals","author":"Li","year":"2013","journal-title":"International Journal of Production Research"},{"key":"10.1016\/j.cie.2026.112092_b0055","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1080\/03088839.2022.2047816","article-title":"Green berth and yard space allocation under carbon tax policy in tidal ports","volume":"50","author":"Lin","year":"2023","journal-title":"Maritime Policy & Management"},{"key":"10.1016\/j.cie.2026.112092_b0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2019.11.008","article-title":"Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations","volume":"133","author":"Liu","year":"2020","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.ocecoaman.2024.107113","article-title":"Dynamic berth allocation under uncertainties based on deep reinforcement learning towards resilient ports","volume":"252","author":"Lv","year":"2024","journal-title":"Ocean and Coastal Management"},{"key":"10.1016\/j.cie.2026.112092_b0070","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10479-017-2577-1","article-title":"An integrated model for berth and yard planning in container terminals with multi-continuous berth layout","volume":"273","author":"Ma","year":"2019","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.cie.2026.112092_b0075","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.tre.2008.03.001","article-title":"Heuristics for the integration of crane productivity in the berth allocation problem","volume":"45","author":"Meisel","year":"2009","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0080","doi-asserted-by":"crossref","unstructured":"Moorthy, R., Teo, C.-P., 2007. Berth management in container terminal: The template design problem, in: Kim, K.H., G\u00fcnther, H.-O. (Eds.), Container Terminals and Cargo Systems: Design, Operations Management, and Logistics Control Issues. Springer, Berlin, Heidelberg, pp. 63\u201386. Doi: 10.1007\/978-3-540-49550-5_4.","DOI":"10.1007\/978-3-540-49550-5_4"},{"key":"10.1016\/j.cie.2026.112092_b0085","first-page":"1","article-title":"A scheduling method for Berth and Quay cranes","volume":"25","author":"Park","year":"2003","journal-title":"Spectr"},{"key":"10.1016\/j.cie.2026.112092_b0090","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.ejor.2013.08.015","article-title":"A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports","volume":"235","author":"Robenek","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112092_b0095","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.ejor.2021.12.040","article-title":"Berth allocation and quay crane assignment\/scheduling problem under uncertainty: A survey","volume":"303","author":"Rodrigues","year":"2022","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112092_b0100","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.ejor.2021.03.016","article-title":"An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times","volume":"295","author":"Rodrigues","year":"2021","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cie.2026.112092_b0105","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/opre.2019.1920","article-title":"Modeling and design of container terminal operations","volume":"68","author":"Roy","year":"2020","journal-title":"Operations Research"},{"key":"10.1016\/j.cie.2026.112092_b0110","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tre.2015.08.005","article-title":"Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy","volume":"83","author":"Tao","year":"2015","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0115","unstructured":"United Nations Conference on Trade and Development, 2025. Chapter 4: Port performance and maritime trade facilitation."},{"key":"10.1016\/j.cie.2026.112092_b0120","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.1120.0428","article-title":"An exact algorithm for the integrated planning of berth allocation and quay crane assignment","volume":"47","author":"Vacca","year":"2013","journal-title":"Transportation Science"},{"key":"10.1016\/j.cie.2026.112092_b0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.trb.2024.102923","article-title":"Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem","volume":"182","author":"Wang","year":"2024","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.cie.2026.112092_b0130","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1002\/nav.22159","article-title":"Robust optimization for the integrated berth allocation and quay crane assignment problem","volume":"71","author":"Wang","year":"2024","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.cie.2026.112092_b0135","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1287\/trsc.2018.0822","article-title":"Column generation for the integrated berth allocation, quay crane assignment, and yard assignment problem","volume":"52","author":"Wang","year":"2018","journal-title":"Transportation Science"},{"key":"10.1016\/j.cie.2026.112092_b0140","article-title":"An adaptive dynamic scheduling policy for the integrated optimization problem in automated transshipment hubs","volume":"1\u201315","author":"Xiang","year":"2023","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.1016\/j.cie.2026.112092_b0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102455","article-title":"An almost robust optimization model for integrated berth allocation and quay crane assignment problem","volume":"104","author":"Xiang","year":"2021","journal-title":"Omega"},{"key":"10.1016\/j.cie.2026.112092_b0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.omega.2021.102444","article-title":"An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time","volume":"103","author":"Xiang","year":"2021","journal-title":"Omega"},{"key":"10.1016\/j.cie.2026.112092_b0155","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cie.2018.09.033","article-title":"Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty","volume":"126","author":"Xiang","year":"2018","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/j.cie.2026.112092_b0160","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.tre.2017.07.006","article-title":"A bi-objective robust model for berth allocation scheduling under uncertainty","volume":"106","author":"Xiang","year":"2017","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.cie.2026.112092_b0165","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","article-title":"Solving two-stage robust optimization problems using a column-and-constraint generation method","volume":"41","author":"Zeng","year":"2013","journal-title":"Operations Research Letters"},{"key":"10.1016\/j.cie.2026.112092_b0170","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/S0191-2615(02)00089-9","article-title":"Storage space allocation in container terminals","volume":"37","author":"Zhang","year":"2003","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.cie.2026.112092_b0175","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"},{"key":"10.1016\/j.cie.2026.112092_b0180","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.cie.2026.112092_b0185","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2022.05.011","article-title":"Integrated berth and yard space allocation under uncertainty","volume":"162","author":"Zhen","year":"2022","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.cie.2026.112092_b0190","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S1874-8651(09)60001-6","article-title":"Study on berth and quay-crane allocation under stochastic environments in container terminal","volume":"28","author":"Zhou","year":"2008","journal-title":"Systems Engineering - Theory & Practice"},{"key":"10.1016\/j.cie.2026.112092_b0195","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1287\/mnsc.2020.3898","article-title":"Joint Estimation and Robustness Optimization","volume":"68","author":"Zhu","year":"2022","journal-title":"Management Science"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226002937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835226002937?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:15:49Z","timestamp":1783185349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835226002937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":39,"alternative-id":["S0360835226002937"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2026.112092","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust optimization for the integrated berth allocation, quay crane assignment, and yard assignment problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2026.112092","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"112092"}}