{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T17:28:37Z","timestamp":1784222917411,"version":"3.55.0"},"reference-count":43,"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\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2022ZD0119303"],"award-info":[{"award-number":["2022ZD0119303"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013076","name":"National Major Science and Technology Projects of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013076","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cor.2026.107475","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T17:09:46Z","timestamp":1774285786000},"page":"107475","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A multi-objective approach for the integrated allocation of quay cranes, internal trucks, and yard cranes in container terminal considering actual handling efficiency"],"prefix":"10.1016","volume":"192","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2996-9088","authenticated-orcid":false,"given":"Mengyu","family":"Tang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weixuan","family":"Niu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxin","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suikai","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiayu","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2026.107475_b0005","doi-asserted-by":"crossref","first-page":"8564","DOI":"10.1109\/TITS.2021.3083598","article-title":"Simultaneous allocation and scheduling of quay cranes, yard cranes, and trucks in dynamical integrated container terminal operations","volume":"23","author":"Cahyono","year":"2022","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"10.1016\/j.cor.2026.107475_b0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2021.102449","article-title":"Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals","volume":"154","author":"Chargui","year":"2021","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"key":"10.1016\/j.cor.2026.107475_b0015","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1504\/IJBIC.2013.057172","article-title":"A novel genetic algorithm to solve travelling salesman problem and blocking flow shop scheduling problem","volume":"5","author":"Chowdhury","year":"2013","journal-title":"IJBIC"},{"key":"10.1016\/j.cor.2026.107475_b0020","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.eswa.2017.07.028","article-title":"A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem","volume":"89","author":"Correcher","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107475_b0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106468","article-title":"The berth allocation and quay crane assignment problem with crane travel and setup times","volume":"162","author":"Correcher","year":"2024","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.cor.2026.107475_b0030","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Computat."},{"issue":"4","key":"10.1016\/j.cor.2026.107475_b0035","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints","volume":"18","author":"Deb","year":"2014","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.cor.2026.107475_b0040","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1057\/s41274-017-0184-9","article-title":"Multi-objective optimization of the integrated problem of location assignment and straddle carrier scheduling in maritime container terminal at import","volume":"69","author":"Dkhil","year":"2018","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.cor.2026.107475_b0045","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.promfg.2020.02.097","article-title":"Batch energy scheduling problem with no-wait\/blocking constraints for the general flow-shop problem","volume":"42","author":"Ferretti","year":"2020","journal-title":"Procedia Manuf."},{"key":"10.1016\/j.cor.2026.107475_b0050","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":"Transp. Res. B Methodol."},{"key":"10.1016\/j.cor.2026.107475_b0055","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.cor.2026.107475_b0060","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TII.2021.3056425","article-title":"Multiobjective optimization of energy-efficient JOB-shop scheduling with dynamic reference point-based fuzzy relative entropy","volume":"18","author":"He","year":"2022","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10.1016\/j.cor.2026.107475_b0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2023.104429","article-title":"Integrated optimization of container allocation and yard cranes dispatched under delayed transshipment","volume":"158","author":"Hu","year":"2024","journal-title":"Transp. Res. Part C Emerging Technol."},{"key":"10.1016\/j.cor.2026.107475_b0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100742","article-title":"An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Huang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.cor.2026.107475_b0075","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tre.2015.06.008","article-title":"Integrated berth allocation and quay crane assignment problem: set partitioning models and computational results","volume":"81","author":"Iris","year":"2015","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"key":"10.1016\/j.cor.2026.107475_b0080","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.trb.2016.12.014","article-title":"A branch-and-price method for integrated yard crane deployment and container allocation in transshipment yards","volume":"98","author":"Jiang","year":"2017","journal-title":"Transp. Res. B Methodol."},{"key":"10.1016\/j.cor.2026.107475_b0085","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1287\/trsc.2014.0527","article-title":"Storage yard management in maritime container terminals","volume":"50","author":"Jin","year":"2016","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107475_b0090","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.cor.2026.107475_b0095","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.3390\/su12083202","article-title":"Energy-efficient and integrated allocation of berths, quay cranes, and internal trucks in container terminals","volume":"12","author":"Karam","year":"2020","journal-title":"Sustainability"},{"key":"10.1016\/j.cor.2026.107475_b0100","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1504\/IJLSM.2016.075665","article-title":"A lagrangian relaxation approach for the integrated quay crane and internal truck assignment in container terminals","volume":"24","author":"Karam","year":"2016","journal-title":"IJLSM"},{"key":"10.1016\/j.cor.2026.107475_b0105","doi-asserted-by":"crossref","first-page":"10721","DOI":"10.1109\/TCYB.2021.3069184","article-title":"Many-objective evolutionary algorithm with reference point-based fuzzy correlation entropy for energy-efficient job shop scheduling with limited workers","volume":"52","author":"Li","year":"2022","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.cor.2026.107475_b0110","doi-asserted-by":"crossref","first-page":"1650","DOI":"10.3390\/jmse10111650","article-title":"Collaborative optimization of yard crane deployment and inbound truck arrivals with vessel-dependent time windows","volume":"10","author":"Ma","year":"2022","journal-title":"JMSE"},{"key":"10.1016\/j.cor.2026.107475_b0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106672","article-title":"Integrated continuous berth allocation and quay crane assignment and scheduling problem with time-dependent physical constraints in container terminals","volume":"147","author":"Malekahmadi","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107475_b0120","doi-asserted-by":"crossref","first-page":"3684","DOI":"10.1109\/TITS.2024.3521218","article-title":"Integrated optimization on double-side cantilever yard crane scheduling and green vehicle path planning at U-shaped yard","volume":"26","author":"Peng","year":"2025","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"10.1016\/j.cor.2026.107475_b0125","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2011.04.224","article-title":"An enriched model for the integrated berth allocation and quay crane assignment problem","author":"Raa","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107475_b0130","first-page":"25","volume":"ijmt 10","author":"Sharifi","year":"2023","journal-title":"A New Multi-Objective Model for Berth Allocation and Quay Crane Assignment Problem with Speed Optimization and Air Emission Considerations."},{"key":"10.1016\/j.cor.2026.107475_b0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.oceaneng.2025.122484","article-title":"A sequential optimization method for joint allocation of berth and yard with cluster stacking strategy in container terminals","volume":"341","author":"Tang","year":"2025","journal-title":"Ocean Eng."},{"key":"10.1016\/j.cor.2026.107475_b0140","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.cor.2026.107475_b0145","unstructured":"United Nations Conference on Trade and Development (UNCTAD). Review of maritime transport. United Nations Conference on Trade and Development (UNCTAD); 2017. Available from, https:\/\/unctad.org\/system\/files\/official-docum ent\/rmt2017_en.pdf ."},{"key":"10.1016\/j.cor.2026.107475_b0150","unstructured":"United Nations Conference on Trade and Development (UNCTAD). Review of maritime transport. United Nations Conference on Trade and Development (UNCTAD); 2024. Available from, https:\/\/unctad.org\/publication\/review-maritime-transport-2024."},{"key":"10.1016\/j.cor.2026.107475_b0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.115617","article-title":"An extended formulation of moldable task scheduling problem and its application to quay crane assignments","volume":"185","author":"Unsal","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cor.2026.107475_b0160","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.knosys.2018.09.025","article-title":"Bi-objective optimization for integrating quay crane and internal truck assignment with challenges of trucks sharing","volume":"163","author":"Vahdani","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.cor.2026.107475_b0165","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":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107475_b0170","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2022.102657","article-title":"A cluster-based yard template design integrated with yard crane deployment using a placement heuristic","volume":"160","author":"Wang","year":"2022","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"key":"10.1016\/j.cor.2026.107475_b0175","doi-asserted-by":"crossref","unstructured":"Xiao, L., He, M., Sun, P., Laportec, G., 2024. The integrated planning of berth allocation, quay crane assignment, and pilotage scheduling. doi:10.2139\/ssrn.4772856.","DOI":"10.2139\/ssrn.4772856"},{"key":"10.1016\/j.cor.2026.107475_b0180","doi-asserted-by":"crossref","first-page":"258","DOI":"10.2355\/isijinternational.ISIJINT-2020-258","article-title":"A novel genetic simulated annealing algorithm for no-wait hybrid flowshop problem with unrelated parallel machines","volume":"61","author":"Xuan","year":"2021","journal-title":"ISIJ Int."},{"key":"10.1016\/j.cor.2026.107475_b0185","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2022.102651","article-title":"Collaboration of vessel speed optimization with berth allocation and quay crane assignment considering vessel service differentiation","volume":"160","author":"Yu","year":"2022","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"key":"10.1016\/j.cor.2026.107475_b0190","doi-asserted-by":"crossref","first-page":"16869","DOI":"10.3390\/su142416869","article-title":"Optimization of resource allocation in automated container terminals","volume":"14","author":"Zhang","year":"2022","journal-title":"Sustainability"},{"key":"10.1016\/j.cor.2026.107475_b0195","doi-asserted-by":"crossref","DOI":"10.1016\/j.oceaneng.2023.114196","article-title":"Ship traffic optimization method for solving the approach channel and lock co-scheduling problem of the three Gorges Dam on the Yangzi River","volume":"276","author":"Zhang","year":"2023","journal-title":"Ocean Eng."},{"key":"10.1016\/j.cor.2026.107475_b0200","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":"Transp. Sci."},{"key":"10.1016\/j.cor.2026.107475_b0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110019","article-title":"A time-varying competitive swarm optimizer for integrated flight recovery with multi-objective and priority considerations","volume":"190","author":"Zhong","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.cor.2026.107475_b0210","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ejor.2017.08.022","article-title":"A fitness assignment strategy based on the grey and entropy parallel analysis and its application to MOEA","volume":"265","author":"Zhu","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.cor.2026.107475_b0215","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Computat."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054826000936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T11:23:45Z","timestamp":1776684225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054826000936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":43,"alternative-id":["S0305054826000936"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2026.107475","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A multi-objective approach for the integrated allocation of quay cranes, internal trucks, and yard cranes in container terminal considering actual handling efficiency","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2026.107475","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":"107475"}}