{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:14:26Z","timestamp":1769282066687,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T00:00:00Z","timestamp":1721260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100017414","name":"Beijing Municipal Social Science Foundation","doi-asserted-by":"publisher","award":["4212035"],"award-info":[{"award-number":["4212035"]}],"id":[{"id":"10.13039\/100017414","id-type":"DOI","asserted-by":"publisher"}]},{"name":"North China University of Technology YuYou Talent Training Program","award":["KM202310009010"],"award-info":[{"award-number":["KM202310009010"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a chaotic optimal thermodynamic evolutionary algorithm (COTEA) designed to address the integrated scheduling problems of berth allocation, ship unloader scheduling, and yard allocation at bulk cargo terminals. Our proposed COTEA introduces a thermal transition crossover method that effectively circumvents local optima in the scheduling solution process. Additionally, the method innovatively combines a good point set with chaotic dynamics within an integrated initialization framework, thereby cultivating a robust and exploratory initial population for the optimization algorithm. To further enhance the selection process, our paper proposes a refined parental selection protocol that employs a quantified hypervolume contribution metric to discern superior candidate solutions. Postevolution, our algorithm employs a Cauchy inverse cumulative distribution-based neighborhood search to effectively explore and enhance the solution spaces, significantly accelerating the convergence speed during the scheduling solution process. The proposed method is adept at achieving multiobjective optimization, simultaneously improving the service level and reducing costs for bulk cargo terminals, which in turn boosts their competitiveness. The effectiveness of our COTEA is demonstrated through extensive numerical simulations.<\/jats:p>","DOI":"10.1007\/s40747-024-01452-w","type":"journal-article","created":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T06:01:46Z","timestamp":1721282506000},"page":"7435-7450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Intelligent bulk cargo terminal scheduling based on a novel chaotic-optimal thermodynamic evolutionary algorithm"],"prefix":"10.1007","volume":"10","author":[{"given":"Shida","family":"Liu","sequence":"first","affiliation":[]},{"given":"Qingsheng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xianlong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,18]]},"reference":[{"key":"1452_CR1","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10479-018-3125-3","volume":"291","author":"O Abou Kasm","year":"2020","unstructured":"Abou Kasm O, Diabat A, Cheng T (2020) The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study. Ann Oper Res 291:435\u2013461. https:\/\/doi.org\/10.1007\/s10479-018-3125-3","journal-title":"Ann Oper Res"},{"key":"1452_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10951-015-0436-y","volume":"19","author":"E Angelelli","year":"2016","unstructured":"Angelelli E, Kalinowski T, Kapoor R, Savelsbergh MW (2016) A reclaimer scheduling problem arising in coal stockyard management. J Sched 19:563\u2013582. https:\/\/doi.org\/10.1007\/s10951-015-0436-y","journal-title":"J Sched"},{"key":"1452_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1057\/mel.2014.20","volume":"17","author":"SAI Babu","year":"2015","unstructured":"Babu SAI, Pratap S, Lahoti G, Fernandes KJ, Tiwari MK, Mount M, Xiong Y (2015) Minimizing delay of ships in bulk terminals by simultaneous ship scheduling, stockyard planning and train scheduling. Marit Econ Logist 17:464\u2013492. https:\/\/doi.org\/10.1057\/mel.2014.20","journal-title":"Marit Econ Logist"},{"key":"1452_CR4","doi-asserted-by":"publisher","unstructured":"Bouzekri H, Alpan G, Giard V (2020) A dynamic hybrid berth allocation problem with routing constraints in bulk ports. In: IFIP International Conference on Advances in Production Management Systems, pp 250\u2013258. Springer . https:\/\/doi.org\/10.1007\/978-3-030-57993-7-29","DOI":"10.1007\/978-3-030-57993-7-29"},{"key":"1452_CR5","doi-asserted-by":"publisher","first-page":"105224","DOI":"10.1016\/j.cor.2021.105224","volume":"130","author":"RL Burdett","year":"2021","unstructured":"Burdett RL, Corry P, Eustace C (2021) Stockpile scheduling with geometry constraints in dry bulk terminals. Comput Oper Res 130:105224. https:\/\/doi.org\/10.1016\/j.cor.2021.105224","journal-title":"Comput Oper Res"},{"key":"1452_CR6","doi-asserted-by":"publisher","unstructured":"Carvalho AG, Araujo AF (2009) Improving nsga-ii with an adaptive mutation operator. In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, pp 2697\u20132700. https:\/\/doi.org\/10.1145\/1570256.1570387","DOI":"10.1145\/1570256.1570387"},{"key":"1452_CR7","doi-asserted-by":"crossref","unstructured":"Chang D, Lu H, Mi W (2010) Bulk terminal stockpile automatic modeling based on 3d scanning technology. In: 2010 International Conference on Future Information Technology and Management Engineering, vol.\u00a01, pp 67\u201370. IEEE","DOI":"10.1109\/FITME.2010.5655783"},{"key":"1452_CR8","doi-asserted-by":"publisher","first-page":"106174","DOI":"10.1016\/j.cor.2023.106174","volume":"153","author":"N Cheimanoff","year":"2023","unstructured":"Cheimanoff N, F\u00e9ni\u00e8s P, Kitri MN, Tchernev N (2023) Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem. Comput Oper Res 153:106174. https:\/\/doi.org\/10.1016\/j.cor.2023.106174","journal-title":"Comput Oper Res"},{"key":"1452_CR9","doi-asserted-by":"publisher","DOI":"10.1155\/2022\/8069796","author":"A D\u00e1vila de Le\u00f3n","year":"2022","unstructured":"D\u00e1vila de Le\u00f3n A, Lalla-Ruiz E, Meli\u00e1n-Batista B (2022) Disruption management approaches for berth scheduling in bulk terminals. J Adv Transp. https:\/\/doi.org\/10.1155\/2022\/8069796","journal-title":"J Adv Transp"},{"issue":"1","key":"1452_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10732-022-09506-3","volume":"29","author":"JLM de Andrade","year":"2023","unstructured":"de Andrade JLM, Menezes GC (2023) A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports. J Heuristics 29(1):39\u201376. https:\/\/doi.org\/10.1007\/s10732-022-09506-3","journal-title":"J Heuristics"},{"key":"1452_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.eswa.2017.06.010","volume":"87","author":"AD de Le\u00f3n","year":"2017","unstructured":"de Le\u00f3n AD, Lalla-Ruiz E, Meli\u00e1n-Batista B, Moreno-Vega JM (2017) A machine learning-based system for berth scheduling at bulk terminals. Expert Syst Appl 87:170\u2013182. https:\/\/doi.org\/10.1016\/j.eswa.2017.06.010","journal-title":"Expert Syst Appl"},{"key":"1452_CR12","doi-asserted-by":"publisher","unstructured":"de\u00a0Andrade JLM, Menezes GC (2021) An integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports: model and heuristics. In: Computational Logistics: 12th International Conference, ICCL 2021, Enschede, The Netherlands, September 27\u201329, 2021, Proceedings 12, pp 3\u201320. Springer. https:\/\/doi.org\/10.1007\/978-3-030-87672-2","DOI":"10.1007\/978-3-030-87672-2"},{"issue":"2","key":"1452_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: Nsga-ii. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"key":"1452_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10951-017-0510-8","volume":"20","author":"AT Ernst","year":"2017","unstructured":"Ernst AT, O\u011fuz C, Singh G, Taherkhani G (2017) Mathematical models for the berth allocation problem in dry bulk terminals. J Sched 20:459\u2013473. https:\/\/doi.org\/10.1007\/s10951-017-0510-8","journal-title":"J Sched"},{"issue":"01","key":"1452_CR15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1142\/S0218213011000097","volume":"20","author":"M Hamdan","year":"2011","unstructured":"Hamdan M (2011) A dynamic polynomial mutation for evolutionary multi-objective optimization algorithms. Int J Artif Intell Tools 20(01):209\u2013219. https:\/\/doi.org\/10.1142\/S0218213011000097","journal-title":"Int J Artif Intell Tools"},{"issue":"3","key":"1452_CR16","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.32604\/csse.2022.029230","volume":"43","author":"X Hu","year":"2022","unstructured":"Hu X, Ji S, Hua H, Zhou B, Hu G (2022) An improved genetic algorithm for berth scheduling at bulk terminal. Comput Syst Sci Eng 43(3):1285\u20131296. https:\/\/doi.org\/10.32604\/csse.2022.029230","journal-title":"Comput Syst Sci Eng"},{"issue":"1","key":"1452_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/atr.5670310107","volume":"31","author":"A Imai","year":"1997","unstructured":"Imai A, Nagaiwa K, Tat CW (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Transp 31(1):75\u201394. https:\/\/doi.org\/10.1002\/atr.5670310107","journal-title":"J Adv Transp"},{"issue":"4","key":"1452_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0191-2615(99)00057-0","volume":"35","author":"A Imai","year":"2001","unstructured":"Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transport Res Part B 35(4):401\u2013417. https:\/\/doi.org\/10.1016\/S0191-2615(99)00057-0","journal-title":"Transport Res Part B"},{"issue":"5","key":"1452_CR19","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/S0191-2615(02)00023-1","volume":"37","author":"A Imai","year":"2003","unstructured":"Imai A, Nishimura E, Papadimitriou S (2003) Berth allocation with service priority. Transport Res Part B 37(5):437\u2013457. https:\/\/doi.org\/10.1016\/S0191-2615(02)00023-1","journal-title":"Transport Res Part B"},{"issue":"1","key":"1452_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.3141\/2479-07","volume":"2479","author":"MZ Li","year":"2015","unstructured":"Li MZ, Jin JG, Lu CX (2015) Real-time disruption recovery for integrated berth allocation and crane assignment in container terminals. Transp Res Rec 2479(1):49\u201359. https:\/\/doi.org\/10.3141\/2479-07","journal-title":"Transp Res Rec"},{"key":"1452_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.trb.2020.10.010","volume":"143","author":"B Liu","year":"2021","unstructured":"Liu B, Li ZC, Sheng D, Wang Y (2021) Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel. Transp Res Part B 143:23\u201347. https:\/\/doi.org\/10.1016\/j.trb.2020.10.010","journal-title":"Transp Res Part B"},{"issue":"2","key":"1452_CR22","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0377-2217(00)00128-4","volume":"131","author":"E Nishimura","year":"2001","unstructured":"Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131(2):282\u2013292. https:\/\/doi.org\/10.1016\/S0377-2217(00)00128-4","journal-title":"Eur J Oper Res"},{"key":"1452_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00291-010-0209-0","volume":"32","author":"T Park","year":"2010","unstructured":"Park T, Choe R, Ok SM, Ryu KR (2010) Real-time scheduling for twin rmgs in an automated container yard. OR Spectrum 32:593\u2013615. https:\/\/doi.org\/10.1007\/s00291-010-0209-0","journal-title":"OR Spectrum"},{"issue":"6","key":"1452_CR24","doi-asserted-by":"publisher","first-page":"7451","DOI":"10.1007\/s40747-023-01135-y","volume":"9","author":"Z Peng","year":"2023","unstructured":"Peng Z, Song X, Song S, Stojanovic V (2023) Hysteresis quantified control for switched reaction-diffusion systems and its application. Complex Intell Syst 9(6):7451\u20137460. https:\/\/doi.org\/10.1007\/s40747-023-01135-y","journal-title":"Complex Intell Syst"},{"issue":"11","key":"1452_CR25","doi-asserted-by":"publisher","first-page":"14136","DOI":"10.1016\/j.eswa.2011.04.224","volume":"38","author":"B Raa","year":"2011","unstructured":"Raa B, Dullaert W, Van Schaeren R (2011) An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Syst Appl 38(11):14136\u201314147. https:\/\/doi.org\/10.1016\/j.eswa.2011.04.224","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1452_CR26","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.ejor.2021.03.016","volume":"295","author":"F Rodrigues","year":"2021","unstructured":"Rodrigues F, Agra A (2021) An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. Eur J Oper Res 295(2):499\u2013516. https:\/\/doi.org\/10.1016\/j.ejor.2021.03.016","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1452_CR27","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.ejor.2021.12.040","volume":"303","author":"F Rodrigues","year":"2022","unstructured":"Rodrigues F, Agra A (2022) Berth allocation and quay crane assignment\/scheduling problem under uncertainty: a survey. Eur J Oper Res 303(2):501\u2013524. https:\/\/doi.org\/10.1016\/j.ejor.2021.12.040","journal-title":"Eur J Oper Res"},{"key":"1452_CR28","doi-asserted-by":"publisher","first-page":"8997","DOI":"10.1007\/s11063-023-11189-1","volume":"55","author":"X Song","year":"2023","unstructured":"Song X, Wu N, Song S, Stojanovic V (2023) Switching-like event-triggered state estimation for reaction-diffusion neural networks against dos attacks. Neural Process Lett 55:8997\u20139018. https:\/\/doi.org\/10.1007\/s11063-023-11189-1","journal-title":"Neural Process Lett"},{"key":"1452_CR29","doi-asserted-by":"publisher","first-page":"101856","DOI":"10.1016\/j.tre.2020.101856","volume":"134","author":"D Sun","year":"2020","unstructured":"Sun D, Meng Y, Tang L, Liu J, Huang B, Yang J (2020) Storage space allocation problem at inland bulk material stockyard. Transp Res Part E 134:101856. https:\/\/doi.org\/10.1016\/j.tre.2020.101856","journal-title":"Transp Res Part E"},{"issue":"3","key":"1452_CR30","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2016.04.022","volume":"254","author":"YB T\u00fcrko\u011fullar\u0131","year":"2016","unstructured":"T\u00fcrko\u011fullar\u0131 YB, Ta\u015fk\u0131n ZC, Aras N, Alt\u0131nel \u0130K (2016) Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals. Eur J Oper Res 254(3):985\u20131001. https:\/\/doi.org\/10.1016\/j.ejor.2016.04.022","journal-title":"Eur J Oper Res"},{"key":"1452_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tre.2019.03.018","volume":"126","author":"O Unsal","year":"2019","unstructured":"Unsal O, Oguz C (2019) An exact algorithm for integrated planning of operations in dry bulk terminals. Transp Res Part E 126:103\u2013121. https:\/\/doi.org\/10.1016\/j.tre.2019.03.018","journal-title":"Transp Res Part E"},{"issue":"5","key":"1452_CR32","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1287\/trsc.2019.0946","volume":"54","author":"T Wang","year":"2020","unstructured":"Wang T, Du Y, Fang D, Li ZC (2020) Berth allocation and quay crane assignment for the trade-off between service efficiency and operating cost considering carbon emission taxation. Transp Sci 54(5):1307\u20131331. https:\/\/doi.org\/10.1287\/trsc.2019.0946","journal-title":"Transp Sci"},{"key":"1452_CR33","doi-asserted-by":"publisher","first-page":"102455","DOI":"10.1016\/j.omega.2021.102455","volume":"104","author":"X Xiang","year":"2021","unstructured":"Xiang X, Liu C (2021) An almost robust optimization model for integrated berth allocation and quay crane assignment problem. Omega 104:102455. https:\/\/doi.org\/10.1016\/j.omega.2021.102455","journal-title":"Omega"},{"key":"1452_CR34","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cie.2018.09.033","volume":"126","author":"X Xiang","year":"2018","unstructured":"Xiang X, Liu C, Miao L (2018) Reactive strategy for discrete berth allocation and quay crane assignment problems under uncertainty. Comput Ind Eng 126:196\u2013216. https:\/\/doi.org\/10.1016\/j.cie.2018.09.033","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1452_CR35","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1109\/TASE.2017.2784483","volume":"15","author":"J Xin","year":"2018","unstructured":"Xin J, Negenborn RR, Van Vianen T (2018) A hybrid dynamical approach for allocating materials in a dry bulk terminal. IEEE Trans Autom Sci Eng 15(3):1326\u20131336. https:\/\/doi.org\/10.1109\/TASE.2017.2784483","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"3","key":"1452_CR36","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1080\/0305215X.2018.1473390","volume":"51","author":"T Yu","year":"2019","unstructured":"Yu T, Qiang Z, Benfei Z (2019) A genetic algorithm based on spatiotemporal conflict between continuous berth-allocation and time-varying specific crane assignment. Eng Optim 51(3):390\u2013411. https:\/\/doi.org\/10.1080\/0305215X.2018.1473390","journal-title":"Eng Optim"},{"issue":"6","key":"1452_CR37","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"1452_CR38","doi-asserted-by":"publisher","unstructured":"Zhang Z, Song X, Sun X, Stojanovic V (2023) Hybrid-driven-based fuzzy secure filtering for nonlinear parabolic partial differential equation systems with cyber attacks. Int J Adapt Control Signal Process 37(2):380\u2013398. https:\/\/doi.org\/10.1002\/acs.3529","DOI":"10.1002\/acs.3529"},{"key":"1452_CR39","doi-asserted-by":"publisher","DOI":"10.3929\/ethz-a-004284029","author":"E Zitzler","year":"2001","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) Spea 2: Improving the strength pareto evolutionary algorithm. TIK Report. https:\/\/doi.org\/10.3929\/ethz-a-004284029","journal-title":"TIK Report"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01452-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01452-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01452-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T22:06:56Z","timestamp":1729116416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01452-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,18]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1452"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01452-w","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,18]]},"assertion":[{"value":"28 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}