Li-Sha Xu , Yi-Ming Wang , Ting Huang , Yue-Jiao Gong , Jing Liu
{"title":"Incremental learning-enhanced ensemble surrogate-assisted evolutionary algorithm for lifelong berth allocation and quay crane assignment problems","authors":"Li-Sha Xu , Yi-Ming Wang , Ting Huang , Yue-Jiao Gong , Jing Liu","doi":"10.1016/j.swevo.2025.102133","DOIUrl":null,"url":null,"abstract":"<div><div>The berth allocation and quay crane assignment problem (BACAP) is a critical challenge in maritime transport, especially in lifelong scenarios that are rarely addressed in the current literature but essential for practical applications. The Lifelong BACAP (LBACAP) presents new challenges, such as the uncertain arrival of vessels, limited resources, and inter-dependencies between vessels. To address these challenges, we propose an incremental learning-enhanced ensemble surrogate-assisted evolutionary algorithm, named IL-ESAEA, with three core designs. (1) The adaptive rolling-horizon strategy divides the LBACAP into consecutive time windows, each corresponding to an interconnected sub-LBACAP. (2) The ensemble surrogate-assisted evolutionary algorithm (ESAEA) approximates the computationally intensive and intricately designed decoding method for optimization, reducing computational costs while maintaining robust search capabilities for solving various BACAPs. (3) The incremental learning mechanism identifies connections between sub-LBACAPs in successive time windows, utilizing historical decisions to guide the optimization effectively. Experimental results demonstrate that IL-ESAEA consistently outperforms state-of-the-art algorithms and provides superior solutions with increased computational efficiency over time. This highlights the strong competitive edge of IL-ESAEA in solving LBACAPs.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"98 ","pages":"Article 102133"},"PeriodicalIF":8.5000,"publicationDate":"2025-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002913","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
The berth allocation and quay crane assignment problem (BACAP) is a critical challenge in maritime transport, especially in lifelong scenarios that are rarely addressed in the current literature but essential for practical applications. The Lifelong BACAP (LBACAP) presents new challenges, such as the uncertain arrival of vessels, limited resources, and inter-dependencies between vessels. To address these challenges, we propose an incremental learning-enhanced ensemble surrogate-assisted evolutionary algorithm, named IL-ESAEA, with three core designs. (1) The adaptive rolling-horizon strategy divides the LBACAP into consecutive time windows, each corresponding to an interconnected sub-LBACAP. (2) The ensemble surrogate-assisted evolutionary algorithm (ESAEA) approximates the computationally intensive and intricately designed decoding method for optimization, reducing computational costs while maintaining robust search capabilities for solving various BACAPs. (3) The incremental learning mechanism identifies connections between sub-LBACAPs in successive time windows, utilizing historical decisions to guide the optimization effectively. Experimental results demonstrate that IL-ESAEA consistently outperforms state-of-the-art algorithms and provides superior solutions with increased computational efficiency over time. This highlights the strong competitive edge of IL-ESAEA in solving LBACAPs.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.