{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T14:14:51Z","timestamp":1780668891686,"version":"3.54.1"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100020595","name":"National Science and Technology Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100020595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Advanced Engineering Informatics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.aei.2026.104798","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:32:20Z","timestamp":1778862740000},"page":"104798","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PD","title":["Conflict-free scheduling of twin automated stacking cranes considering container reshuffling using a discrete flower pollination algorithm"],"prefix":"10.1016","volume":"74","author":[{"given":"Chien-Chang","family":"Chou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8874-0836","authenticated-orcid":false,"given":"Hsien-Pin","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng-Hua","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tran Thi","family":"Bich Chau Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.aei.2026.104798_b0005","doi-asserted-by":"crossref","first-page":"48","DOI":"10.3390\/axioms10020048","article-title":"Efficiency assessment of seaport terminal operators using DEA Malmquist and epsilon-based measure models","volume":"10","author":"Wang","year":"2021","journal-title":"Axioms"},{"key":"10.1016\/j.aei.2026.104798_b0010","unstructured":"Supply Chain Today, 2021. Industry 4.0 digital port container terminal paper 2021. Retrieved from the link: https:\/\/www.supplychaintoday.com\/industry-4-0-digital-port-container-terminals\/."},{"key":"10.1016\/j.aei.2026.104798_b0015","unstructured":"M. Placek, \u201cGlobal container port throughput 2012-2027,\u201d 2023. Retrieved from the link: https:\/\/www.statista.com\/statistics\/913398\/container-throughput-worldwide\/."},{"key":"10.1016\/j.aei.2026.104798_b0020","series-title":"Port Economics, Management and Policy","author":"Notteboom","year":"2022"},{"key":"10.1016\/j.aei.2026.104798_b0025","unstructured":"I. Mecalux (2022). Automated stacker cranes: definition and applications. Blog - Logistics & Supply Chain Trends. 2022. Retrieved from the link: https:\/\/www.interlakemecalux.com\/blog\/automated-stacker-cranes."},{"key":"10.1016\/j.aei.2026.104798_b0030","unstructured":"M. Kavoosi, \u201cInnovative Metaheuristic Algorithms for Efficient Berth Scheduling at Marine Container Terminals,\u201d A doctoral dissertation of The Florida State University, 2019."},{"key":"10.1016\/j.aei.2026.104798_b0035","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101334","article-title":"A diffused memetic optimizer for reactive berth allocation and scheduling at marine container terminals in response to disruptions","volume":"80","author":"Dulebenets","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.aei.2026.104798_b0040","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.swevo.2015.11.002","article-title":"\u201cA HPSO for solving dynamic and discrete berth allocation problem and dynamic quay crane assignment problem simultaneously","volume":"27","author":"Hsu","year":"2016","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.aei.2026.104798_b0045","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.trc.2016.06.004","article-title":"Sequencing twin automated stacking cranes in a block at automated container terminal","volume":"69","author":"Hu","year":"2016","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"2019","key":"10.1016\/j.aei.2026.104798_b0050","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/j.cie.2018.12.039","article-title":"Scheduling cooperative twin automated stacking cranes in automated container terminals","volume":"8","author":"Han","year":"2019","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.aei.2026.104798_b0055","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10845-009-0304-8","article-title":"Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning","volume":"22","author":"Liang","year":"2011","journal-title":"J. Intell. Manuf."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0060","first-page":"111","article-title":"Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem","volume":"10","author":"Rouky","year":"2019","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"3","key":"10.1016\/j.aei.2026.104798_b0065","first-page":"348","article-title":"A decision-making system for container storage management in a seaport using the ant-colony optimization algorithm","volume":"17","author":"Amrani","year":"2018","journal-title":"Int. J. Manag. Decis. Mak."},{"issue":"10","key":"10.1016\/j.aei.2026.104798_b0070","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.3390\/jmse9101080","article-title":"Hybrid scheduling for multi-equipment at U-shape trafficked automated terminal based on chaos particle swarm optimization","volume":"9","author":"Li","year":"2021","journal-title":"J. Mar. Sci. Eng."},{"issue":"2","key":"10.1016\/j.aei.2026.104798_b0075","doi-asserted-by":"crossref","DOI":"10.1287\/trsc.1090.0298","article-title":"Sequencing two cooperating automated stacking cranes in a container terminal","volume":"44","author":"Vis","year":"2010","journal-title":"Transp. Sci."},{"key":"10.1016\/j.aei.2026.104798_b0080","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2024.102410","article-title":"Hybridizing WOA with PSO for coordinating material handling equipment in an automated container terminal considering energy consumption","volume":"60","author":"Hsu","year":"2024","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.aei.2026.104798_b0085","series-title":"International Conference on Unconventional Computing and Natural Computation","first-page":"240","article-title":"Flower pollination algorithm for global optimization","author":"Yang","year":"2012"},{"key":"10.1016\/j.aei.2026.104798_b0090","series-title":"Nature-Inspired Algorithms and Applied Optimization","first-page":"91","article-title":"Variants of the flower pollination algorithm: a review","author":"Alyasseri","year":"2018"},{"key":"10.1016\/j.aei.2026.104798_b0095","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/j.ijepes.2015.11.093","article-title":"Combined economic and emission dispatch solution using flower pollination algorithm","volume":"80","author":"Abdelaziz","year":"2016","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"2","key":"10.1016\/j.aei.2026.104798_b0100","first-page":"1009","article-title":"Flower pollination algorithm applied for different economic load dispatch problems","volume":"6","author":"Prathiba","year":"2014","journal-title":"Int. J. Eng. Technol (IJET)"},{"key":"10.1016\/j.aei.2026.104798_b0105","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.energy.2016.02.041","article-title":"Implementation of flower pollination algorithm for solving economic load dispatch and combined economic emission dispatch problems in power systems","volume":"101","author":"Abdelaziz","year":"2016","journal-title":"Energy"},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0110","first-page":"79","article-title":"Multi-objective optimal power flow problem using enhanced flower pollination algorithm","volume":"30","author":"Shilaja","year":"2017","journal-title":"Gazi Univ. J. Sci."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0115","article-title":"Optimal line flow in conventional power system using euclidean affine flower pollination algorithm","volume":"6","author":"Shilaja","year":"2016","journal-title":"Int. J. Renew. Energy Res. C"},{"key":"10.1016\/j.aei.2026.104798_b0120","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.asoc.2016.06.038","article-title":"A new approach for forecasting opec petroleum consumption based on neural network train by using flower pollination algorithm","volume":"48","author":"Chiroma","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.aei.2026.104798_b0125","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.enconman.2017.01.022","article-title":"A combined model based on ceemdan and modified flower pollination algorithm for wind speed forecasting","volume":"136","author":"Zhang","year":"2017","journal-title":"Energy Convers. Manage."},{"key":"10.1016\/j.aei.2026.104798_b0130","first-page":"1","article-title":"Improved cuckoo search and chaotic flower pollination optimization algorithm for maximizing area coverage in wireless sensor networks","author":"Binh","year":"2016","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.aei.2026.104798_b0135","first-page":"374","article-title":"Power system loss minimization using flower pollination algorithm (fpa)-a comparative study","author":"Sharma","year":"2017","journal-title":"Int. J. Adv. Res. Ideas Innov. Technol."},{"issue":"4","key":"10.1016\/j.aei.2026.104798_b0140","doi-asserted-by":"crossref","DOI":"10.1142\/S0218001416590102","article-title":"An improved flower pollination algorithm for optimal unmanned undersea vehicle path planning problem","volume":"30","author":"Zhou","year":"2016","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"10.1016\/j.aei.2026.104798_b0145","series-title":"Linear Antenna Array Optimization Using Flower Pollination Algorithm","first-page":"306","author":"Saxena","year":"2016"},{"key":"10.1016\/j.aei.2026.104798_b0150","article-title":"An improved flower pollination algorithm with adaboost algorithm for feature selection in text documents classification","author":"Majidpour","year":"2018","journal-title":"J. Adv. Comput. Res."},{"key":"10.1016\/j.aei.2026.104798_b0155","first-page":"1","article-title":"Assembly sequence optimization using a flower pollination algorithm-based approach","author":"Mishra","year":"2016","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.aei.2026.104798_b0160","doi-asserted-by":"crossref","unstructured":"M. Bensouyad, D.E. Saidouni, \u201cA hybrid discrete flower pollination algorithm for graph coloring problem,\u201d In: Proceedings of The International Conference on Engineering & MIS 2015, p. 22. ACM, 2015.","DOI":"10.1145\/2832987.2833022"},{"key":"10.1016\/j.aei.2026.104798_b0165","unstructured":"International Transport Forum, \u201cContainer Port Automation: Impacts and Implications,\u201d OECD Publishing, 2021. Retrieved from the link: https:\/\/www.itf-oecd.org\/sites\/default\/files\/docs\/container-port-automation.pdf."},{"key":"10.1016\/j.aei.2026.104798_b0170","first-page":"1","article-title":"Positioning a handshake bay for twin stacking cranes in an automated container terminal yard block","volume":"2022","author":"Hu","year":"2022","journal-title":"J. Adv. Transp."},{"issue":"3","key":"10.1016\/j.aei.2026.104798_b0175","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.apm.2004.09.009","article-title":"Yard crane scheduling in port container terminals","volume":"29","author":"Ng","year":"2005","journal-title":"Appl. Math Model."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0180","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.ejor.2003.11.025","article-title":"Crane scheduling in container yards with inter-crane interference","volume":"164","author":"Ng","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.aei.2026.104798_b0185","unstructured":"M.M. Kumar, S.N. Omkar, \u201cOptimization of yard crane scheduling using particle swarm optimization with genetic algorithm operators (PSOGAO), 2008."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0190","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.ejor.2008.08.019","article-title":"Discrete time model and algorithms for container yard crane scheduling","volume":"198","author":"Li","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0195","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.retrec.2012.11.001","article-title":"Modeling yard crane operators as reinforcement learning agents","volume":"42","author":"Fotuhi","year":"2013","journal-title":"Res. Transp. Econ."},{"issue":"3","key":"10.1016\/j.aei.2026.104798_b0200","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1287\/trsc.2014.0533","article-title":"Scheduling twin yard cranes in a container block","volume":"49","author":"Gharehgozli","year":"2013","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0205","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.aei.2014.09.003","article-title":"Yard crane scheduling in a container terminal for the trade-off between efficiency and energy consumption","volume":"29","author":"He","year":"2015","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.aei.2026.104798_b0210","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1016\/j.cie.2016.03.022","article-title":"Scheduling optimization of yard cranes with minimal energy consumption at container terminals,","volume":"113","author":"Sha","year":"2017","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.aei.2026.104798_b0215","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1260\/2046-0430.1.2.109","article-title":"An agent-based solution framework for inter-block yard crane scheduling problems","volume":"1","author":"Sharif","year":"2012","journal-title":"Int. J. Transp. Sci. Technol."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0220","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.ejor.2018.05.007","article-title":"Yard crane scheduling for container storage, retrieval, and relocation,","volume":"271","author":"Galle","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.aei.2026.104798_b0225","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.cie.2015.04.026","article-title":"Priority rules for twin automated stacking cranes that collaborate","volume":"89","author":"Carlo","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.aei.2026.104798_b0230","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.dam.2016.04.006","article-title":"Cooperative twin-crane scheduling","volume":"211","author":"Briskorn","year":"2016","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0235","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ejor.2016.08.041","article-title":"A generalized classification scheme for crane scheduling with interference","volume":"258","author":"Boysen","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0240","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ejor.2017.01.037","article-title":"A simulation study of the performance of twin automated stacking cranes at a seaport container terminal","volume":"261","author":"Gharehgozli","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.aei.2026.104798_b0245","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1016\/j.ejor.2017.12.040","article-title":"Stacking outbound barge containers in an automated deep-sea terminal","volume":"267","author":"Gharehgozli","year":"2018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.aei.2026.104798_b0250","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ejor.2018.07.043","article-title":"An exact solution approach for scheduling cooperative gantry cranes","volume":"273","author":"Kress","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.aei.2026.104798_b0255","article-title":"Twin-crane scheduling during seaside workload peaks with a dedicated handshake area","volume":"25","author":"Zey","year":"2021","journal-title":"J. Sched."},{"key":"10.1016\/j.aei.2026.104798_b0260","doi-asserted-by":"crossref","DOI":"10.1016\/j.aei.2023.102015","article-title":"A new solution approach for the twin yard crane scheduling problem in automated container terminals","volume":"57","author":"Oladugba","year":"2023","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.aei.2026.104798_b0265","unstructured":"L\u00e9vy, P. \u201cTh\u00e9orie de l'addition des variables al\u00e9atoires,\u201d This work by Paul L\u00e9vy is foundational to the theory of L\u00e9vy processes, of which L\u00e9vy Flight is a specific case, 1940."},{"issue":"15","key":"10.1016\/j.aei.2026.104798_b0270","doi-asserted-by":"crossref","first-page":"3288","DOI":"10.3390\/electronics12153288","article-title":"Deep reinforcement learning for dynamic twin automated stacking cranes scheduling problem","volume":"12","author":"Xin","year":"2023","journal-title":"Electronics"},{"key":"10.1016\/j.aei.2026.104798_b0275","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110271","article-title":"Scheduling of twin automatic stacking cranes and automated guided vehicle considering buffer mode on automated container terminal","volume":"193","author":"Zhu","year":"2024","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.aei.2026.104798_b0285","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2025.111344","article-title":"Scheduling twin automated stacking cranes for job assignment at automated container terminals","volume":"207","author":"Yin","year":"2025","journal-title":"Comput. Ind. Eng."}],"container-title":["Advanced Engineering Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034626004908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1474034626004908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T13:38:25Z","timestamp":1780666705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1474034626004908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":56,"alternative-id":["S1474034626004908"],"URL":"https:\/\/doi.org\/10.1016\/j.aei.2026.104798","relation":{},"ISSN":["1474-0346"],"issn-type":[{"value":"1474-0346","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Conflict-free scheduling of twin automated stacking cranes considering container reshuffling using a discrete flower pollination algorithm","name":"articletitle","label":"Article Title"},{"value":"Advanced Engineering Informatics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.aei.2026.104798","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":"104798"}}