A temporal-segmentation-and-fusion-based large-scale constrained multi-objective evolutionary algorithm for coal mine integrated energy systems dispatch
IF 8.2 1区 计算机科学Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Xuanxuan Ban , Jing Liang , Dunwei Gong , Yong Zhang , Yaonan Wang , Canyun Dai , Kangjia Qiao , Kunjie Yu
{"title":"A temporal-segmentation-and-fusion-based large-scale constrained multi-objective evolutionary algorithm for coal mine integrated energy systems dispatch","authors":"Xuanxuan Ban , Jing Liang , Dunwei Gong , Yong Zhang , Yaonan Wang , Canyun Dai , Kangjia Qiao , Kunjie Yu","doi":"10.1016/j.swevo.2025.101959","DOIUrl":null,"url":null,"abstract":"<div><div>Under the dual-carbon policy, the optimization of coal mine integrated energy systems (CMIESs) has garnered increasing attention from researchers. However, the characteristics of multiple optimization objectives, strong coupling constraints, and high-dimensional decision variables pose significant challenges for optimization methods. Existing constrained multi-objective optimization algorithms struggle to effectively solve such problems with multiple complex characteristics, and they are prone to getting stuck in local optima. To address this issue, this paper proposes a temporal-segmentation-and-fusion-based large-scale constrained multi-objective evolutionary algorithm, which divides the evolutionary process into two stages. In the subspace optimization stage, the large-scale space is divided into multiple smaller subspaces according to the problem’s temporal divisibility characteristics, then these subspaces are progressively integrated and optimized by using a portion of the computational resources. Once all subspaces are integrated, the original space optimization stage is activated, then the remaining computational resources are employed to search the original large-scale space. In addition, a differential evolution mutation strategy based on dynamic neighborhoods is studied, which effectively balances global exploration and local exploitation, guiding the population toward promising regions in the search space. Finally, the experimental results with several advanced evolutionary algorithms on an actual CMIES dispatch case demonstrate the efficiency of the proposed algorithm.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"96 ","pages":"Article 101959"},"PeriodicalIF":8.2000,"publicationDate":"2025-05-12","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/S2210650225001178","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
Under the dual-carbon policy, the optimization of coal mine integrated energy systems (CMIESs) has garnered increasing attention from researchers. However, the characteristics of multiple optimization objectives, strong coupling constraints, and high-dimensional decision variables pose significant challenges for optimization methods. Existing constrained multi-objective optimization algorithms struggle to effectively solve such problems with multiple complex characteristics, and they are prone to getting stuck in local optima. To address this issue, this paper proposes a temporal-segmentation-and-fusion-based large-scale constrained multi-objective evolutionary algorithm, which divides the evolutionary process into two stages. In the subspace optimization stage, the large-scale space is divided into multiple smaller subspaces according to the problem’s temporal divisibility characteristics, then these subspaces are progressively integrated and optimized by using a portion of the computational resources. Once all subspaces are integrated, the original space optimization stage is activated, then the remaining computational resources are employed to search the original large-scale space. In addition, a differential evolution mutation strategy based on dynamic neighborhoods is studied, which effectively balances global exploration and local exploitation, guiding the population toward promising regions in the search space. Finally, the experimental results with several advanced evolutionary algorithms on an actual CMIES dispatch case demonstrate the efficiency of the proposed algorithm.
期刊介绍:
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.