Swarm and Evolutionary Computation最新文献_第3页

A dimensionality reduction assisted evolutionary algorithm for high-dimensional expensive multi/many-objective optimization 用于高维昂贵多目标优化的降维辅助进化算法

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-16 DOI: 10.1016/j.swevo.2024.101729

{"title":"A dimensionality reduction assisted evolutionary algorithm for high-dimensional expensive multi/many-objective optimization","authors":"","doi":"10.1016/j.swevo.2024.101729","DOIUrl":"10.1016/j.swevo.2024.101729","url":null,"abstract":"<div><p>Surrogate-assisted multi/many-objective evolutionary algorithms (SA-MOEAs) have shown significant progress in tackling expensive optimization problems. However, existing research primarily focuses on low-dimensional optimization problems. The main reason lies in the fact that some surrogate techniques used in SA-MOEAs, such as the Kriging model, are not applicable for exploring high-dimensional decision space. This paper introduces a surrogate-assisted multi-objective evolutionary algorithm with dimensionality reduction to address high-dimensional expensive optimization problems. The proposed algorithm includes two key insights. Firstly, we propose a dimensionality reduction framework containing three different feature extraction algorithms and a feature drift strategy to map the high-dimensional decision space into a low-dimensional decision space; this strategy helps to improve the robustness of surrogates. Secondly, we propose a sub-region search strategy to define a series of promising sub-regions in the high-dimensional decision space; this strategy helps to improve the exploration ability of the proposed SA-MOEA. Experimental results demonstrate the effectiveness of our proposed algorithm in comparison to several state-of-the-art algorithms.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142244170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Multi-strategy particle swarm optimization with adaptive forgetting for base station layout 基站布局的多策略粒子群优化与自适应遗忘

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-14 DOI: 10.1016/j.swevo.2024.101737

{"title":"Multi-strategy particle swarm optimization with adaptive forgetting for base station layout","authors":"","doi":"10.1016/j.swevo.2024.101737","DOIUrl":"10.1016/j.swevo.2024.101737","url":null,"abstract":"<div><p>With the advent of 6G communication technology, user expectations for service quality have correspondingly risen. This is particularly evident in rural areas, where the challenge of ensuring signal coverage across diverse terrains is pressing. Consequently, the intelligent placement of base stations becomes a critical issue. To address this, our paper conducts a comprehensive analysis of terrain environments and village distributions in rural settings and develops a sophisticated objective function. We introduce a novel approach termed Multi-strategy Particle Swarm Optimization with Adaptive Forgetting (AFMPSO), designed to optimize the layout of base stations. This algorithm incorporates a forgetting mechanism and a center-of-mass traction strategy, which enable particles to update their positions responsively and maintain optimal individual information. Such features effectively prevent premature convergence and the risk of entrapment in local optima, thereby enhancing the efficacy of traditional particle swarm optimization techniques. In the IEEE Congress on Evolutionary Computation (CEC) 2022, AFMPSO was benchmarked against other particle swarm variants and the year’s winning algorithm. It demonstrated superior optimization capabilities. Further, our experiments utilizing both fixed and randomly configured village models revealed that AFMPSO achieved a signal coverage rate exceeding 90% in both setups, underscoring its substantial advantages and practical applicability in enhancing base station coverage. This research not only delivers an effective technical solution but also establishes a robust foundation for the future development of intelligent base station layouts.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Surrogate-assisted push and pull search for expensive constrained multi-objective optimization problems 针对昂贵的受限多目标优化问题的代理辅助推拉搜索

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-14 DOI: 10.1016/j.swevo.2024.101728

{"title":"Surrogate-assisted push and pull search for expensive constrained multi-objective optimization problems","authors":"","doi":"10.1016/j.swevo.2024.101728","DOIUrl":"10.1016/j.swevo.2024.101728","url":null,"abstract":"<div><p>In many real-world engineering optimizations, a large number of objective and constraint function values often need to be obtained through simulation software or physical experiments, which incurs significant computational costs and/or time expenses. These problems are known as expensive constraint multi-objective optimization problems (ECMOPs). This paper combines the push and pull search (PPS) framework and proposes a surrogate-assisted evolutionary algorithm to solve ECMOPs through Bayesian active learning, naming it the surrogate-assisted PPS (SA-PPS). Specifically, during the push search stage, candidate solutions are selected based on two indicators: hypervolume improvement and objective uncertainty. These aim to quickly guide the population towards the unconstrained Pareto front while ensuring diversity. During the pull search stage, the population is partitioned into many subregions through reference vectors, and different selection strategies are assigned to each subregion based on its state, aiming to guide the population towards the constrained Pareto front while ensuring diversity. Furthermore, we introduce a batch data selection strategy that utilizes Bayesian active learning to enable the surrogate model to focus on regions of interest in the pull search stage. Extensive experimental results have shown that the proposed SA-PPS algorithm exhibits superior convergence and diversity compared to 9 state-of-the-art algorithms across a variety of benchmark problems and a real-world optimization problem.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232292","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Hybrid loading situation vehicle routing problem in the context of agricultural harvesting: A reconstructed MOEA/D with parallel populations 农业收割背景下的混合装载情况车辆路由问题：具有并行群体的重构 MOEA/D

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-12 DOI: 10.1016/j.swevo.2024.101730

{"title":"Hybrid loading situation vehicle routing problem in the context of agricultural harvesting: A reconstructed MOEA/D with parallel populations","authors":"","doi":"10.1016/j.swevo.2024.101730","DOIUrl":"10.1016/j.swevo.2024.101730","url":null,"abstract":"<div><p>With the increasing level of agricultural automation, the combination of agriculture and intelligent vehicle technology is propelling the development of smart agriculture. Although this technology has already been applied widely for various agricultural production tasks, inefficient vehicle scheduling still hasn't been resolved satisfactorily. Oriented towards agricultural harvesting scenarios, a hybrid loading situation vehicle routing problem (HLSVRP) model is proposed to minimize total energy consumption and maximum completion time. A reconstructed multi-objective evolutionary algorithm based on decomposition (R-MOEA/D) is developed to solve the problem. Eight solution representations tailored specifically to the problem are introduced by R-MOEA/D, allowing an extensive exploration of the solution space. A modified Clarke & Wright (MCW) heuristic is designed to generate a high-quality initial population. A novel problem-specific parallel population updating mechanism based on the four crossover and two mutation combinations is also provided to improve the exploration ability. A collaborative search strategy is employed to facilitate cooperation among parallel populations. Finally, a series of comparative experiments conducted on various task scales and vehicle scales verify the effectiveness of the proposed algorithmic components and the exceptional performance for solving HLSVRP.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142172050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Learning to search promising regions by space partitioning for evolutionary methods 通过进化方法的空间分区学习搜索有希望的区域

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-11 DOI: 10.1016/j.swevo.2024.101726

{"title":"Learning to search promising regions by space partitioning for evolutionary methods","authors":"","doi":"10.1016/j.swevo.2024.101726","DOIUrl":"10.1016/j.swevo.2024.101726","url":null,"abstract":"<div><p>To alleviate the premature, many evolutionary computation algorithms try to balance the exploitation and exploration by controlling the population diversity. However, randomly diversifying a population cannot always guarantee that an algorithm exploits or explores promising regions. To address this issue, a general framework is proposed in this paper for learning promising regions that are made up of subspaces to guide where to exploit and explore by two reinforcement learning systems. The learning mechanism is as follows: (1) To enhance the efficiency of exploitation, an exploitative reinforcement learning system is constructed to estimate the exploitative potential values of subspaces. Accordingly, basins of attraction are approximated by clustering subspaces and historical solutions are selected within the same basin of attraction to generate new solutions. (2) To efficiently explore the solution space, an explorative reinforcement learning system is established to estimate the explorative potential values of subspaces. Accordingly, algorithms are guided to explore subspaces with higher explorative potential values, promoting the discovery of unexploited promising basins of attraction. The framework is implemented into three conventional evolutionary algorithms, and the mechanism and effectiveness of the implemented algorithms are investigated by comprehensive experimental studies. The experimental results show that the proposed algorithms have competitive performances over the other twelve popular evolutionary algorithms.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142168412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Combining meta-heuristics and Q-learning for scheduling lot-streaming hybrid flow shops with consistent sublots 结合元启发式和 Q-learning 方法，为具有一致子批次的批量流混合流动车间进行调度

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-11 DOI: 10.1016/j.swevo.2024.101731

引用次数: 0

Coevolutionary multitasking for constrained multiobjective optimization 受限多目标优化的协同进化多任务处理

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-07 DOI: 10.1016/j.swevo.2024.101727

{"title":"Coevolutionary multitasking for constrained multiobjective optimization","authors":"","doi":"10.1016/j.swevo.2024.101727","DOIUrl":"10.1016/j.swevo.2024.101727","url":null,"abstract":"<div><p>Addressing the challenges of constrained multiobjective optimization problems (CMOPs) with evolutionary algorithms requires balancing constraint satisfaction and optimization objectives. Coevolutionary multitasking (CEMT) offers a promising strategy by leveraging synergies from distinct, complementary tasks. The primary challenge in CEMT frameworks is constructing suitable auxiliary tasks that effectively complement the main CMOP task. In this paper, we propose an adaptive CEMT framework (ACEMT), which customizes two adaptive auxiliary tasks to enhance CMOP-solving efficiency. The first auxiliary task dynamically narrows constraint boundaries, facilitating exploration in regions with smaller feasible spaces. The second task focuses specifically on individual constraints, continuously adapting to expedite convergence and uncover optimal regions. In solving the main CMOP task, this dual-auxiliary-task strategy not only improves search thoroughness but also clarifies the balance between constraints and objectives. Concretely, ACEMT incorporates an adaptive constraint relaxation technique for the first auxiliary task and a specialized constraint selection strategy for the second. These innovations foster effective knowledge transfer and task synergy, addressing the key challenge of auxiliary task construction in CEMT frameworks. Extensive experiments on three benchmark suites and real-world applications demonstrate ACEMT’s superior performance compared to state-of-the-art constrained evolutionary algorithms. ACEMT sets a new standard in CMOP-solving by strategically constructing and adapting auxiliary tasks, representing a significant advancement in this research direction.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data UniBFS：适用于高维数据的新型统一解驱动二元特征选择算法

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-06 DOI: 10.1016/j.swevo.2024.101715

{"title":"UniBFS: A novel uniform-solution-driven binary feature selection algorithm for high-dimensional data","authors":"","doi":"10.1016/j.swevo.2024.101715","DOIUrl":"10.1016/j.swevo.2024.101715","url":null,"abstract":"<div><p>Feature selection (FS) is a crucial technique in machine learning and data mining, serving a variety of purposes such as simplifying model construction, facilitating knowledge discovery, improving computational efficiency, and reducing memory consumption. Despite its importance, the constantly increasing search space of high-dimensional datasets poses significant challenges to FS methods, including issues like the \"curse of dimensionality,\" susceptibility to local optima, and high computational and memory costs. To overcome these challenges, a new FS algorithm named Uniform-solution-driven Binary Feature Selection (UniBFS) has been developed in this study. UniBFS exploits the inherent characteristic of binary algorithms-binary coding-to search the entire problem space for identifying relevant features while avoiding irrelevant ones. To improve the effectiveness and efficiency of the UniBFS algorithm, Redundant Features Elimination algorithm (RFE) is presented in this paper. RFE performs a local search in a very small subspace of the solutions obtained by UniBFS in different stages, and removes the redundant features which do not increase the classification accuracy. Moreover, the study proposes a hybrid algorithm that combines UniBFS with two filter-based FS methods, ReliefF and Fisher, to identify pertinent features during the global search phase. The proposed algorithms are evaluated on 30 high-dimensional datasets ranging from 2000 to 54676 dimensions, and their effectiveness and efficiency are compared with state-of-the-art techniques, demonstrating their superiority.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2210650224002530/pdfft?md5=8dd201c098f02846dd90beaa107d5c3f&pid=1-s2.0-S2210650224002530-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IOT device type identification using magnetized Hopfield neural network with tuna swarm optimization algorithm 利用磁化 Hopfield 神经网络和金枪鱼群优化算法识别物联网设备类型

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-05 DOI: 10.1016/j.swevo.2024.101653

{"title":"IOT device type identification using magnetized Hopfield neural network with tuna swarm optimization algorithm","authors":"","doi":"10.1016/j.swevo.2024.101653","DOIUrl":"10.1016/j.swevo.2024.101653","url":null,"abstract":"<div><p>Internet of Things (IoT) networks consist of physical devices connected to the Internet, embedded with actuators, sensors, and communication components that exchange data. To enhance IoT security, accurately identifying and assessing the safety of connected devices is essential. To improve IoT security, this research proposes the IoT Device Type Identification utilizing Memristor-based Magnetized Hopfield Neural Network with Tuna Swarm Optimization Algorithm (IOT-DTI-MHNN-TSOA). It includes data collection, feature extraction, IoT device type identification. In data collection, an actual network traffic dataset amassed through 10 various IoT device categories is used. In the feature extraction phase, optimal features such as TCP packets' time-to-live by server, packets' inter-arrival time by client, packets' inter-arrival time by server, TCP packets' time-to-live by client, packets' inter-arrival time, packet size, number of bytes sent and received, packet size by client, and total number of packets are extracted using a 2-Dimensional Flexible Analytic Wavelet Transform (2D-FAWT). These extracting features are provided to the IoT device type identification phase. In this phase, a Memristor-based Magnetized Hopfield Neural Network (MHNN) method is employed to perceive the categories of IoT device as known/seen or unknown/unseen categories. The Tuna Swarm Optimization Algorithm (TSOA) enhances the weight parameters of MHNN. The efficacy of the IOT-DTI-MHNN-TSOA classification framework is assessed using performance metrics, like precision, accuracy, F1-score, sensitivity, specificity, error rate, computational time, ROC, Computational Complexity. The IOT-DTI-MHNN-TSOA method provides higher accuracy of 99.97 %, higher sensitivity of 99.95 %, and higher precision of 99.92 % compared to the existing models.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142151810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization 用于多模式多目标优化的具有均衡多样性和收敛性的算术优化算法

IF 8.2 1区计算机科学

Swarm and Evolutionary Computation Pub Date : 2024-09-04 DOI: 10.1016/j.swevo.2024.101724

{"title":"An arithmetic optimization algorithm with balanced diversity and convergence for multimodal multiobjective optimization","authors":"","doi":"10.1016/j.swevo.2024.101724","DOIUrl":"10.1016/j.swevo.2024.101724","url":null,"abstract":"<div><p>Multimodal multiobjective optimization problems are widely prevalent in real life. Addressing these challenges is crucial as they directly impact the efficiency and effectiveness of solutions across various domains. This paper proposes a novel Multi-Modal Multi-Objective Arithmetic Optimization Algorithm (MMOP-AOA), aimed at achieving a high balance between diversity and convergence in both decision and objective spaces. Arithmetic Optimization Algorithm (AOA) is a highly competitive metaheuristic optimization algorithm with strong exploration and exploitation capabilities. MMOP-AOA extends the AOA for the first time to solve multimodal multiobjective problems, with the following ideas: Firstly, a new exploration and exploitation strategy (NBC<img>NEE) is designed based on the characteristics of AOA.The strategy utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs). Secondly, a convergence and diversity balance mechanism (CDBM) is developed. This mechanism involves comparing the convergence indicator and diversity indicator to select different mutation strategies. Thirdly, an improved crowding distance (ICD) is proposed to address the deficiencies of existing special crowding distance measures. The effectiveness of CDBM and ICD is demonstrated in the paper through experiments on 22 benchmark functions from CEC-2019 and a real-world problem of signal timing optimization at road intersections. The research also reveals that compared to four other advanced multimodal multiobjective optimization algorithms, MMOP-AOA exhibits superior search capability and stability. Furthermore, MMOP-AOA utilizes Neighborhood-Based Clustering (NBC) to partition the decision space into multiple clusters, aiding MMOP-AOA in capturing more equivalent Pareto subsets (ePSs) and provides a theoretical framework for other metaheuristic optimization algorithms to tackle multimodal multiobjective problems.</p></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":null,"pages":null},"PeriodicalIF":8.2,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142137366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0