首页 > 最新文献

Swarm and Evolutionary Computation最新文献

英文 中文
An ensemble reinforcement learning-assisted deep learning framework for enhanced lung cancer diagnosis 用于增强肺癌诊断的集合强化学习辅助深度学习框架
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-15 DOI: 10.1016/j.swevo.2024.101767
Richa Jain, Parminder Singh, Avinash Kaur
Lung cancer ranks among the most lethal diseases, highlighting the necessity of early detection to facilitate timely therapeutic intervention. Deep learning has significantly improved lung cancer prediction by analyzing large healthcare datasets and making accurate decisions. This paper proposes a novel framework combining deep learning with integrated reinforcement learning to improve lung cancer diagnosis accuracy from CT scans. The data set utilized in this study consists of CT scans from healthy individuals and patients with various lung stages. We address class imbalance through elastic transformation and employ data augmentation techniques to enhance model generalization. For multi-class classification of lung tumors, five pre-trained convolutional neural network architectures (DenseNet201, EfficientNetB7, VGG16, MobileNet and VGG19) are used, and the models are refined by transfer learning. To further boost performance, we introduce a weighted average ensemble model “DEV-MV”, coupled with grid search hyperparameter optimization, achieving an impressive diagnostic accuracy of 99.40%. The integration of ensemble reinforcement learning also contributes to improved robustness and reliability in predictions. This approach represents a significant advancement in automated lung cancer detection, offering a highly accurate, scalable solution for early diagnosis.
肺癌是致死率最高的疾病之一,这凸显了早期检测以促进及时治疗干预的必要性。深度学习通过分析大型医疗数据集并做出准确决策,极大地改进了肺癌预测。本文提出了一种将深度学习与集成强化学习相结合的新型框架,以提高 CT 扫描的肺癌诊断准确率。本研究使用的数据集包括健康人和不同肺部分期患者的 CT 扫描图像。我们通过弹性变换来解决类不平衡问题,并采用数据增强技术来提高模型的泛化能力。对于肺部肿瘤的多类分类,我们使用了五种预先训练好的卷积神经网络架构(DenseNet201、EfficientNetB7、VGG16、MobileNet 和 VGG19),并通过迁移学习对模型进行了改进。为了进一步提高性能,我们引入了加权平均集合模型 "DEV-MV",并结合网格搜索超参数优化,使诊断准确率达到了令人印象深刻的 99.40%。集合强化学习的集成还有助于提高预测的稳健性和可靠性。这种方法代表了肺癌自动检测领域的重大进步,为早期诊断提供了一种高度准确、可扩展的解决方案。
{"title":"An ensemble reinforcement learning-assisted deep learning framework for enhanced lung cancer diagnosis","authors":"Richa Jain,&nbsp;Parminder Singh,&nbsp;Avinash Kaur","doi":"10.1016/j.swevo.2024.101767","DOIUrl":"10.1016/j.swevo.2024.101767","url":null,"abstract":"<div><div>Lung cancer ranks among the most lethal diseases, highlighting the necessity of early detection to facilitate timely therapeutic intervention. Deep learning has significantly improved lung cancer prediction by analyzing large healthcare datasets and making accurate decisions. This paper proposes a novel framework combining deep learning with integrated reinforcement learning to improve lung cancer diagnosis accuracy from CT scans. The data set utilized in this study consists of CT scans from healthy individuals and patients with various lung stages. We address class imbalance through elastic transformation and employ data augmentation techniques to enhance model generalization. For multi-class classification of lung tumors, five pre-trained convolutional neural network architectures (DenseNet201, EfficientNetB7, VGG16, MobileNet and VGG19) are used, and the models are refined by transfer learning. To further boost performance, we introduce a weighted average ensemble model “DEV-MV”, coupled with grid search hyperparameter optimization, achieving an impressive diagnostic accuracy of 99.40%. The integration of ensemble reinforcement learning also contributes to improved robustness and reliability in predictions. This approach represents a significant advancement in automated lung cancer detection, offering a highly accurate, scalable solution for early diagnosis.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101767"},"PeriodicalIF":8.2,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658391","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-population coevolutionary algorithm for a green multi-objective flexible job shop scheduling problem with automated guided vehicles and variable processing speed constraints 多目标灵活作业车间绿色调度问题的多群体协同进化算法,带自动导引车和可变处理速度约束
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-15 DOI: 10.1016/j.swevo.2024.101774
Chao Liu , Yuyan Han , Yuting Wang , Junqing Li , Yiping Liu
This study focuses on addressing a multi-objective Flexible Job Shop Scheduling Problem with Automated Guided Vehicles (FJSP-AGVs) and variable processing speed constraints. First, a position-based mixed integer linear programming model (MILP) is proposed to optimize simultaneously the maximum completion time and the total energy consumption. Then, we decompose FJSP-AGVs into four interrelated subproblems and design a Multi-Population Coevolutionary Algorithm (MCEA) to solve them. In MCEA, (1) The effective encoding and decoding methods are used to accurately reflect the characteristics of the problem, and generate feasible scheduling solutions. (2) A multi-rule-based heuristic is proposed to enrich the diversity of four populations. (3) A disjunctive graph is constructed to depict and obtain the critical path(s). On this basis, (4) two cooperative evolution strategies based on critical paths are proposed to facilitate collaborative evolution between different populations and improve the global search capability of the algorithm. Furthermore, (5) a consumption reduction strategy is proposed by reducing the processing speed of operations on non-critical paths while ensuring that it does not affect the makespan. Finally, we validate the effectiveness of MCEA by GD, and IGD, and set coverage metrics on the four typical benchmark datasets. Based on the average GD (IGD) metric across 65 instances, MCEA shows reductions of 77.63% (93.60%), 95.30% (97.27%), and 96.17%(97.89%) relative to EHA, EMOEA, and mop-BRKGA, respectively. The set coverage metric, MCEA outperforms EHA, EMOEA, and mop-BRKGA in 59, 64, and 64 instances, respectively. These results clearly indicate that MCEA can solve the FJSP-AGVs with variable processing speed constraints.
本研究的重点是解决带有自动导引车(FJSP-AGVs)和可变处理速度约束的多目标灵活作业车间调度问题。首先,我们提出了一个基于位置的混合整数线性规划模型(MILP),以同时优化最大完成时间和总能耗。然后,我们将 FJSP-AGV 分解为四个相互关联的子问题,并设计了一种多人群协同进化算法(MCEA)来解决这些问题。在 MCEA 中,(1) 采用有效的编码和解码方法,准确反映问题的特征,生成可行的调度方案。(2) 提出基于多规则的启发式,丰富四个种群的多样性。(3) 构建离析图来描述和获取关键路径。在此基础上,(4) 提出了两种基于临界路径的合作进化策略,以促进不同种群之间的合作进化,提高算法的全局搜索能力。此外,(5) 我们还提出了一种减少消耗的策略,即在确保不影响有效时间的前提下,降低非关键路径上操作的处理速度。最后,我们通过 GD 和 IGD 验证了 MCEA 的有效性,并在四个典型基准数据集上设置了覆盖率指标。基于 65 个实例的平均 GD (IGD) 指标,MCEA 与 EHA、EMOEA 和 mop-BRKGA 相比,分别降低了 77.63% (93.60%)、95.30% (97.27%) 和 96.17% (97.89%)。在集合覆盖率指标上,MCEA 在 59、64 和 64 个实例中的表现分别优于 EHA、EMOEA 和 mop-BRKGA。这些结果清楚地表明,MCEA 可以解决处理速度受限的 FJSP-AGV 问题。
{"title":"Multi-population coevolutionary algorithm for a green multi-objective flexible job shop scheduling problem with automated guided vehicles and variable processing speed constraints","authors":"Chao Liu ,&nbsp;Yuyan Han ,&nbsp;Yuting Wang ,&nbsp;Junqing Li ,&nbsp;Yiping Liu","doi":"10.1016/j.swevo.2024.101774","DOIUrl":"10.1016/j.swevo.2024.101774","url":null,"abstract":"<div><div>This study focuses on addressing a multi-objective Flexible Job Shop Scheduling Problem with Automated Guided Vehicles (FJSP-AGVs) and variable processing speed constraints. First, a position-based mixed integer linear programming model (MILP) is proposed to optimize simultaneously the maximum completion time and the total energy consumption. Then, we decompose FJSP-AGVs into four interrelated subproblems and design a Multi-Population Coevolutionary Algorithm (MCEA) to solve them. In MCEA, (1) The effective encoding and decoding methods are used to accurately reflect the characteristics of the problem, and generate feasible scheduling solutions. (2) A multi-rule-based heuristic is proposed to enrich the diversity of four populations. (3) A disjunctive graph is constructed to depict and obtain the critical path(s). On this basis, (4) two cooperative evolution strategies based on critical paths are proposed to facilitate collaborative evolution between different populations and improve the global search capability of the algorithm. Furthermore, (5) a consumption reduction strategy is proposed by reducing the processing speed of operations on non-critical paths while ensuring that it does not affect the makespan. Finally, we validate the effectiveness of MCEA by GD, and IGD, and set coverage metrics on the four typical benchmark datasets. Based on the average GD (IGD) metric across 65 instances, MCEA shows reductions of 77.63% (93.60%), 95.30% (97.27%), and 96.17%(97.89%) relative to EHA, EMOEA, and mop-BRKGA, respectively. The set coverage metric, MCEA outperforms EHA, EMOEA, and mop-BRKGA in 59, 64, and 64 instances, respectively. These results clearly indicate that MCEA can solve the FJSP-AGVs with variable processing speed constraints.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101774"},"PeriodicalIF":8.2,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658392","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
A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming 带批量流的高能效分布式异构混合流动车间调度的知识驱动多目标算法
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-14 DOI: 10.1016/j.swevo.2024.101771
Sanyan Chen, Xuewu Wang, Ye Wang, Xingsheng Gu
More enterprises are enhancing their productive capacity to keep up with the rapidly shifting market demands. Meanwhile, with increasing environmental consciousness, sustainable manufacturing has drawn greater attention. In this paper, the many-objective energy-efficient distributed heterogeneous hybrid flowshop scheduling problem with lot-streaming (DHHFSPLS) is investigated, where the number of sublots is variable. To settle this challenging issue, a mathematical model is established, and a knowledge-driven many-objective optimization evolutionary algorithm (KDMaOEA) is proposed for minimizing makespan, total earliness, total tardiness and total energy consumption. In the KDMaOEA, a knowledge-driven multiple populations collaborative search strategy is devised to strengthen exploitation capabilities. Specifically, the population is divided into five subpopulations, where four superior subpopulations are employed to facilitate the optimization of each objective and one inferior subpopulation learns from four superior subpopulations to effectively utilize the optimization knowledge. Furthermore, an adaptive switching-based environmental selection strategy is fulfilled to guarantee the distribution and convergence of the solution set. Finally, extensive numerical simulations are undertaken to verify the effectiveness of the KDMaOEA in solving the many-objective energy-efficient DHHFSPLS.
越来越多的企业正在提高生产能力,以适应快速变化的市场需求。与此同时,随着环保意识的增强,可持续生产也越来越受到重视。本文研究了具有批次流的多目标节能分布式异构混合流车间调度问题(DHHFSPLS),其中子批次的数量是可变的。为了解决这个具有挑战性的问题,本文建立了一个数学模型,并提出了一种知识驱动的多目标优化进化算法(KDMaOEA),用于最小化工期(makespan)、总提前率(total earliness)、总延迟率(total tardiness)和总能耗(total energy consumption)。在 KDMaOEA 中,设计了一种知识驱动的多种群协同搜索策略,以加强利用能力。具体来说,种群被分为五个子种群,其中四个优势子种群用于促进每个目标的优化,一个劣势子种群从四个优势子种群中学习,以有效利用优化知识。此外,还采用了基于自适应切换的环境选择策略,以保证解集的分布和收敛性。最后,大量的数值模拟验证了 KDMaOEA 在解决多目标高能效 DHHFSPLS 方面的有效性。
{"title":"A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming","authors":"Sanyan Chen,&nbsp;Xuewu Wang,&nbsp;Ye Wang,&nbsp;Xingsheng Gu","doi":"10.1016/j.swevo.2024.101771","DOIUrl":"10.1016/j.swevo.2024.101771","url":null,"abstract":"<div><div>More enterprises are enhancing their productive capacity to keep up with the rapidly shifting market demands. Meanwhile, with increasing environmental consciousness, sustainable manufacturing has drawn greater attention. In this paper, the many-objective energy-efficient distributed heterogeneous hybrid flowshop scheduling problem with lot-streaming (DHHFSPLS) is investigated, where the number of sublots is variable. To settle this challenging issue, a mathematical model is established, and a knowledge-driven many-objective optimization evolutionary algorithm (KDMaOEA) is proposed for minimizing makespan, total earliness, total tardiness and total energy consumption. In the KDMaOEA, a knowledge-driven multiple populations collaborative search strategy is devised to strengthen exploitation capabilities. Specifically, the population is divided into five subpopulations, where four superior subpopulations are employed to facilitate the optimization of each objective and one inferior subpopulation learns from four superior subpopulations to effectively utilize the optimization knowledge. Furthermore, an adaptive switching-based environmental selection strategy is fulfilled to guarantee the distribution and convergence of the solution set. Finally, extensive numerical simulations are undertaken to verify the effectiveness of the KDMaOEA in solving the many-objective energy-efficient DHHFSPLS.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101771"},"PeriodicalIF":8.2,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658389","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
Balancing heterogeneous assembly line with multi-skilled human-robot collaboration via Adaptive cooperative co-evolutionary algorithm 通过自适应合作协同进化算法平衡多技能人机协作的异构装配线
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-10 DOI: 10.1016/j.swevo.2024.101762
Bo Tian , Himanshu Kaul , Mukund Janardhanan
In human-centred manufacturing, deploying collaborative robots (cobots) is recognized as a promising strategy to enhance the inclusiveness and resilience of production systems. Despite notable progress, current production scheduling methods for human-robot collaboration (HRC) still fail to adequately accommodate workforce heterogeneity, significantly reducing their adoption and implementation. To address this gap, we introduce a novel model for the Assembly Line Worker Integration and Balancing Problem considering Multi-skilled Human-Robot Collaboration (ALWIBP-mHRC). This model aims to optimize task scheduling between semi-skilled workers and cobots, aiming to maximize productivity and minimize costs. It features a multi-skilled human-robot collaboration (mHRC) task assignment scheme that selects the optimal assembly/collaboration mode from seven scenarios, based on specific task requirements and resource-skill availability, thus maximizing resource-skill complementarity. To tackle the complexities of this problem, we propose an adaptive multi-objective cooperative co-evolutionary algorithm (a-MOCC) that incorporates a sub-problem decomposition and decoding framework tailored for ALWIBP-mHRC, enhanced by an adaptive evolutionary strategy based on Q-learning (Q-Coevolution). Experimental tests demonstrate the superior performance of the proposed method compared to other established metaheuristic algorithms across various instance sizes, underscoring its effectiveness in enhancing the productivity of production systems for semi-skilled workers. The findings are significant for investment decision-making and resource planning, as they highlight the strategic value of integrating cobots in large-scale heterogeneous workforce production. This work underscores the potential of cobots to mitigate skill gaps in assembly systems, laying the groundwork for future research and industrial strategies focused on enhancing productivity, inclusivity, and adaptability in a dynamically changing labour market.
在以人为本的制造业中,部署协作机器人(cobots)被认为是提高生产系统包容性和适应性的一种有前途的策略。尽管取得了显著进展,但目前的人机协作(HRC)生产调度方法仍未能充分考虑劳动力的异质性,从而大大降低了其采用和实施的可能性。为了弥补这一不足,我们针对考虑到多技能人机协作的装配线工人整合与平衡问题(ALWIBP-mHRC)引入了一个新模型。该模型旨在优化半熟练工人和机器人之间的任务调度,以实现生产率最大化和成本最小化。它采用多技能人机协作(mHRC)任务分配方案,根据具体任务要求和资源技能可用性,从七个方案中选择最佳装配/协作模式,从而最大限度地提高资源技能互补性。为了解决这一复杂问题,我们提出了一种自适应多目标合作协同进化算法(a-MOCC),该算法结合了为 ALWIBP-mHRC 量身定制的子问题分解和解码框架,并通过基于 Q-learning 的自适应进化策略(Q-Coevolution)进行了增强。实验测试表明,与其他成熟的元启发式算法相比,所提出的方法在不同的实例规模下都具有卓越的性能,突出了其在提高半熟练工人生产系统生产率方面的有效性。这些发现对投资决策和资源规划具有重要意义,因为它们凸显了在大规模异构劳动力生产中整合机器人的战略价值。这项研究强调了协作机器人在缓解装配系统技能差距方面的潜力,为未来的研究和工业战略奠定了基础,这些研究和战略的重点是在动态变化的劳动力市场中提高生产率、包容性和适应性。
{"title":"Balancing heterogeneous assembly line with multi-skilled human-robot collaboration via Adaptive cooperative co-evolutionary algorithm","authors":"Bo Tian ,&nbsp;Himanshu Kaul ,&nbsp;Mukund Janardhanan","doi":"10.1016/j.swevo.2024.101762","DOIUrl":"10.1016/j.swevo.2024.101762","url":null,"abstract":"<div><div>In human-centred manufacturing, deploying collaborative robots (cobots) is recognized as a promising strategy to enhance the inclusiveness and resilience of production systems. Despite notable progress, current production scheduling methods for human-robot collaboration (HRC) still fail to adequately accommodate workforce heterogeneity, significantly reducing their adoption and implementation. To address this gap, we introduce a novel model for the Assembly Line Worker Integration and Balancing Problem considering Multi-skilled Human-Robot Collaboration (ALWIBP-mHRC). This model aims to optimize task scheduling between semi-skilled workers and cobots, aiming to maximize productivity and minimize costs. It features a multi-skilled human-robot collaboration (mHRC) task assignment scheme that selects the optimal assembly/collaboration mode from seven scenarios, based on specific task requirements and resource-skill availability, thus maximizing resource-skill complementarity. To tackle the complexities of this problem, we propose an adaptive multi-objective cooperative co-evolutionary algorithm (a-MOCC) that incorporates a sub-problem decomposition and decoding framework tailored for ALWIBP-mHRC, enhanced by an adaptive evolutionary strategy based on Q-learning (Q-Coevolution). Experimental tests demonstrate the superior performance of the proposed method compared to other established metaheuristic algorithms across various instance sizes, underscoring its effectiveness in enhancing the productivity of production systems for semi-skilled workers. The findings are significant for investment decision-making and resource planning, as they highlight the strategic value of integrating cobots in large-scale heterogeneous workforce production. This work underscores the potential of cobots to mitigate skill gaps in assembly systems, laying the groundwork for future research and industrial strategies focused on enhancing productivity, inclusivity, and adaptability in a dynamically changing labour market.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101762"},"PeriodicalIF":8.2,"publicationDate":"2024-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658390","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
A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem 分布式混合流水车间调度问题的协作学习多代理强化学习方法
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-09 DOI: 10.1016/j.swevo.2024.101764
Yuanzhu Di , Libao Deng , Lili Zhang
As the increasing level of implementation of artificial intelligence technology in solving complex engineering optimization problems, various learning mechanisms, including deep learning (DL) and reinforcement learning (RL), have been developed for manufacturing scheduling. In this paper, a collaborative-learning multi-agent RL method (CL-MARL) is proposed for solving distributed hybrid flow-shop scheduling problem (DHFSP), minimizing both makespan and total energy consumption. First, the DHFSP is formulated as the Markov decision process, the features of machines and jobs are represented as state and observation matrixes according to their characteristics, the candidate operation set is used as action space, and a reward mechanism is designed based on the machine utilization. Next, a set of critic networks and actor networks, consist of recurrent neural networks and fully connected networks, are employed to map the states and observations into the output values. Then, a novel distance matching strategy is designed for each agent to select the most appropriate action at each scheduling step. Finally, the proposed CL-MARL model is trained through multi-agent deep deterministic policy gradient algorithm in collaborative-learning manner. The numerical results prove the effectiveness of the proposed multi-agent system, and the comparisons with existing algorithms demonstrate the high-potential of CL-MARL in solving DHFSP.
随着人工智能技术在解决复杂工程优化问题中的应用水平不断提高,包括深度学习(DL)和强化学习(RL)在内的各种学习机制已被开发用于生产调度。本文提出了一种协作学习多代理 RL 方法(CL-MARL),用于求解分布式混合流车间调度问题(DHFSP),使生产周期和总能耗最小。首先,将 DHFSP 拟定为马尔可夫决策过程,根据机器和作业的特征将其表示为状态矩阵和观测矩阵,将候选操作集作为行动空间,并根据机器利用率设计奖励机制。然后,采用一组由递归神经网络和全连接网络组成的批评者网络和行动者网络,将状态和观测值映射为输出值。然后,为每个代理设计了一种新颖的距离匹配策略,以便在每个调度步骤中选择最合适的行动。最后,通过协作学习方式的多代理深度确定性策略梯度算法来训练所提出的 CL-MARL 模型。数值结果证明了所提出的多代理系统的有效性,与现有算法的比较也证明了 CL-MARL 在解决 DHFSP 方面的巨大潜力。
{"title":"A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem","authors":"Yuanzhu Di ,&nbsp;Libao Deng ,&nbsp;Lili Zhang","doi":"10.1016/j.swevo.2024.101764","DOIUrl":"10.1016/j.swevo.2024.101764","url":null,"abstract":"<div><div>As the increasing level of implementation of artificial intelligence technology in solving complex engineering optimization problems, various learning mechanisms, including deep learning (DL) and reinforcement learning (RL), have been developed for manufacturing scheduling. In this paper, a collaborative-learning multi-agent RL method (CL-MARL) is proposed for solving distributed hybrid flow-shop scheduling problem (DHFSP), minimizing both makespan and total energy consumption. First, the DHFSP is formulated as the Markov decision process, the features of machines and jobs are represented as state and observation matrixes according to their characteristics, the candidate operation set is used as action space, and a reward mechanism is designed based on the machine utilization. Next, a set of critic networks and actor networks, consist of recurrent neural networks and fully connected networks, are employed to map the states and observations into the output values. Then, a novel distance matching strategy is designed for each agent to select the most appropriate action at each scheduling step. Finally, the proposed CL-MARL model is trained through multi-agent deep deterministic policy gradient algorithm in collaborative-learning manner. The numerical results prove the effectiveness of the proposed multi-agent system, and the comparisons with existing algorithms demonstrate the high-potential of CL-MARL in solving DHFSP.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101764"},"PeriodicalIF":8.2,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658384","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
MFWOA: Multifactorial Whale Optimization Algorithm MFWOA:多因素鲸鱼优化算法
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-09 DOI: 10.1016/j.swevo.2024.101768
Lei Ye , Hangqi Ding , Haoran Xu , Benhua Xiang , Yue Wu , Maoguo Gong
Multi-task optimization is an emerging research topic in the field of evolutionary computation, which can exploit the synergy between tasks to solve multiple optimization problems simultaneously and efficiently. However, the correlation and negative transfer problems between tasks are the main challenges faced by multi-task optimization. To this end, this paper proposes a new multi-task optimization algorithm, named Multifactorial Whale Optimization Algorithm (MFWOA). MFWOA uses the Whale Optimization Algorithm (WOA) as a search mechanism and designs an adaptive knowledge transfer strategy to effectively exploit the correlation between tasks. This strategy includes two ways: one is to exchange search experience by adding distance terms from other tasks; the other is to generate new random individuals or optimal individuals through crossover and mutation operations and use them to guide position updates. By combining these two methods, MFWOA can explore a wider area. In addition, in order to better balance the useful information transfer between and within tasks, MFWOA also designs a random mating probability parameter adaptive strategy. Experimental results show that MFWOA can achieve effective and efficient knowledge transfer, and outperforms other multi-task optimization algorithms in terms of convergence speed and accuracy. It is a promising multi-task optimization algorithm.
多任务优化是进化计算领域的一个新兴研究课题,它可以利用任务之间的协同作用,同时高效地解决多个优化问题。然而,任务间的相关性和负转移问题是多任务优化面临的主要挑战。为此,本文提出了一种新的多任务优化算法,命名为多因素鲸鱼优化算法(MFWOA)。MFWOA 使用鲸鱼优化算法(WOA)作为搜索机制,并设计了一种自适应知识转移策略,以有效利用任务之间的相关性。该策略包括两种方式:一种是通过添加其他任务的距离项来交流搜索经验;另一种是通过交叉和突变操作生成新的随机个体或最优个体,并利用它们来指导位置更新。通过结合这两种方法,MFWOA 可以探索更广阔的领域。此外,为了更好地平衡任务间和任务内的有用信息传递,MFWOA 还设计了随机交配概率参数自适应策略。实验结果表明,MFWOA 可以实现有效和高效的知识转移,并且在收敛速度和准确性方面优于其他多任务优化算法。它是一种很有前途的多任务优化算法。
{"title":"MFWOA: Multifactorial Whale Optimization Algorithm","authors":"Lei Ye ,&nbsp;Hangqi Ding ,&nbsp;Haoran Xu ,&nbsp;Benhua Xiang ,&nbsp;Yue Wu ,&nbsp;Maoguo Gong","doi":"10.1016/j.swevo.2024.101768","DOIUrl":"10.1016/j.swevo.2024.101768","url":null,"abstract":"<div><div>Multi-task optimization is an emerging research topic in the field of evolutionary computation, which can exploit the synergy between tasks to solve multiple optimization problems simultaneously and efficiently. However, the correlation and negative transfer problems between tasks are the main challenges faced by multi-task optimization. To this end, this paper proposes a new multi-task optimization algorithm, named Multifactorial Whale Optimization Algorithm (MFWOA). MFWOA uses the Whale Optimization Algorithm (WOA) as a search mechanism and designs an adaptive knowledge transfer strategy to effectively exploit the correlation between tasks. This strategy includes two ways: one is to exchange search experience by adding distance terms from other tasks; the other is to generate new random individuals or optimal individuals through crossover and mutation operations and use them to guide position updates. By combining these two methods, MFWOA can explore a wider area. In addition, in order to better balance the useful information transfer between and within tasks, MFWOA also designs a random mating probability parameter adaptive strategy. Experimental results show that MFWOA can achieve effective and efficient knowledge transfer, and outperforms other multi-task optimization algorithms in terms of convergence speed and accuracy. It is a promising multi-task optimization algorithm.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101768"},"PeriodicalIF":8.2,"publicationDate":"2024-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658388","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
Transferring knowledge by budget online learning for multiobjective multitasking optimization 通过预算在线学习转移知识,实现多目标多任务优化
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-07 DOI: 10.1016/j.swevo.2024.101765
Fuhao Gao , Lingling Huang , Weifeng Gao , Longyue Li , Shuqi Wang , Maoguo Gong , Ling Wang
Multiobjective multitasking optimization (MO-MTO) has attracted increasing attention in the evolutionary computation field. Evolutionary multitasking (EMT) algorithms can improve the overall performance of multiple multiobjective optimization tasks through transferring knowledge among tasks. Negative transfer resulting from the indeterminacy of the transferred knowledge may bring about the degradation of the algorithm performance. Identifying the valuable knowledge to transfer by learning the historical samples is a feasible way to reduce negative transfer. Taking this into account, this paper proposes a budget online learning based EMT algorithm for MO-MTO problems. Specifically, by regarding the historical transferred solutions as samples, a classifier would be trained to identified the valuable knowledge. The solutions which are considered containing valuable knowledge will have more opportunity to be transfer. For the samples arrive in the form of streaming data, the classifier would be updated in a budget online learning way during the evolution process to address the concept drift problem. Furthermore, the exceptional case that the classifier fails to identify the valuable knowledge is considered. Experimental results on two MO-MTO test suits show that the proposed algorithm achieves highly competitive performance compared with several traditional and state-of-the-art EMT methods.
多目标多任务优化(MO-MTO)在进化计算领域受到越来越多的关注。进化多任务(EMT)算法可以通过任务间的知识转移提高多个多目标优化任务的整体性能。由于转移知识的不确定性而导致的负转移可能会降低算法性能。通过学习历史样本来识别有价值的知识转移是减少负转移的可行方法。考虑到这一点,本文针对 MO-MTO 问题提出了一种基于预算在线学习的 EMT 算法。具体来说,将历史转移的解决方案视为样本,训练分类器来识别有价值的知识。被认为包含有价值知识的解决方案将有更多机会被转移。对于以流数据形式到达的样本,分类器将在演化过程中以预算在线学习的方式进行更新,以解决概念漂移问题。此外,还考虑了分类器无法识别有价值知识的特殊情况。在两套 MO-MTO 测试服上的实验结果表明,与几种传统和最先进的 EMT 方法相比,所提出的算法取得了极具竞争力的性能。
{"title":"Transferring knowledge by budget online learning for multiobjective multitasking optimization","authors":"Fuhao Gao ,&nbsp;Lingling Huang ,&nbsp;Weifeng Gao ,&nbsp;Longyue Li ,&nbsp;Shuqi Wang ,&nbsp;Maoguo Gong ,&nbsp;Ling Wang","doi":"10.1016/j.swevo.2024.101765","DOIUrl":"10.1016/j.swevo.2024.101765","url":null,"abstract":"<div><div>Multiobjective multitasking optimization (MO-MTO) has attracted increasing attention in the evolutionary computation field. Evolutionary multitasking (EMT) algorithms can improve the overall performance of multiple multiobjective optimization tasks through transferring knowledge among tasks. Negative transfer resulting from the indeterminacy of the transferred knowledge may bring about the degradation of the algorithm performance. Identifying the valuable knowledge to transfer by learning the historical samples is a feasible way to reduce negative transfer. Taking this into account, this paper proposes a budget online learning based EMT algorithm for MO-MTO problems. Specifically, by regarding the historical transferred solutions as samples, a classifier would be trained to identified the valuable knowledge. The solutions which are considered containing valuable knowledge will have more opportunity to be transfer. For the samples arrive in the form of streaming data, the classifier would be updated in a budget online learning way during the evolution process to address the concept drift problem. Furthermore, the exceptional case that the classifier fails to identify the valuable knowledge is considered. Experimental results on two MO-MTO test suits show that the proposed algorithm achieves highly competitive performance compared with several traditional and state-of-the-art EMT methods.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101765"},"PeriodicalIF":8.2,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658383","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-guided cross-sampling for large-scale evolutionary multi-objective optimization 大规模进化多目标优化的学习引导交叉采样
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-05 DOI: 10.1016/j.swevo.2024.101763
Haofan Wang , Li Chen , Xingxing Hao , Rong Qu , Wei Zhou , Dekui Wang , Wei Liu
When tackling large-scale multi-objective problems (LSMOPs), the computational budget could be wasted by traditional offspring generators that explore the search space in a nearly directionless manner, impairing the efficiency of many existing algorithms. To address this issue, this paper proposes a novel two-level large-scale multi-objective evolutionary algorithm called LMOEA-LGCS that incorporates neural network (NN) learning-guided cross-sampling for offspring generation in the first level and a layered competitive swarm optimizer in the second level. Specifically, in the first level, two NNs are trained online to learn promising vertical and horizontal search directions, respectively, against the Pareto Set, and then a batch of candidate solutions are sampled on the learned directions. The merit of learning two explicit search directions is to devote the employed NNs to concentrating on separate or even conflicting targets, i.e., the convergence and diversity of the population, thus achieving a good trade-off between them. In this way, the algorithm can thus explore adaptively towards more promising search directions that have the potential to facilitate the convergence of the population while maintaining a good diversity. In the second level, the layered competitive swarm optimizer is employed to perform a deeper optimization of the solutions generated in the first level across the entire search space to increase their diversity further. Comparisons with six state-of-the-art algorithms on three LSMOP benchmarks, i.e., the LSMOP, UF, and IMF, with 2-12 objectives and 500-8000 decision variables, and the real-world problem TREE demonstrate the advantages of the proposed algorithm.
在处理大规模多目标问题(LSMOPs)时,传统的子代生成器几乎是无方向地探索搜索空间,可能会浪费计算预算,从而影响许多现有算法的效率。为了解决这个问题,本文提出了一种新颖的两级大规模多目标进化算法 LMOEA-LGCS,它在第一级结合了神经网络(NN)学习引导的交叉采样用于子代生成,在第二级结合了分层竞争群优化器。具体来说,在第一层中,两个神经网络经过在线训练,分别根据帕累托集学习有前途的纵向和横向搜索方向,然后在所学方向上抽取一批候选解。学习两个明确搜索方向的好处在于,所使用的 NNs 可以专注于不同甚至相互冲突的目标,即群体的收敛性和多样性,从而在两者之间实现良好的权衡。这样,算法就能自适应地探索更有前景的搜索方向,这些方向有可能促进群体的收敛,同时保持良好的多样性。在第二层中,分层竞争性蜂群优化器被用于在整个搜索空间中对第一层中生成的解决方案进行更深入的优化,以进一步提高其多样性。在 2-12 个目标和 500-8000 个决策变量的三个 LSMOP 基准(即 LSMOP、UF 和 IMF)以及实际问题 TREE 上与六种最先进的算法进行比较,证明了所提算法的优势。
{"title":"Learning-guided cross-sampling for large-scale evolutionary multi-objective optimization","authors":"Haofan Wang ,&nbsp;Li Chen ,&nbsp;Xingxing Hao ,&nbsp;Rong Qu ,&nbsp;Wei Zhou ,&nbsp;Dekui Wang ,&nbsp;Wei Liu","doi":"10.1016/j.swevo.2024.101763","DOIUrl":"10.1016/j.swevo.2024.101763","url":null,"abstract":"<div><div>When tackling large-scale multi-objective problems (LSMOPs), the computational budget could be wasted by traditional offspring generators that explore the search space in a nearly directionless manner, impairing the efficiency of many existing algorithms. To address this issue, this paper proposes a novel two-level large-scale multi-objective evolutionary algorithm called LMOEA-LGCS that incorporates neural network (NN) learning-guided cross-sampling for offspring generation in the first level and a layered competitive swarm optimizer in the second level. Specifically, in the first level, two NNs are trained online to learn promising vertical and horizontal search directions, respectively, against the Pareto Set, and then a batch of candidate solutions are sampled on the learned directions. The merit of learning two explicit search directions is to devote the employed NNs to concentrating on separate or even conflicting targets, i.e., the convergence and diversity of the population, thus achieving a good trade-off between them. In this way, the algorithm can thus explore adaptively towards more promising search directions that have the potential to facilitate the convergence of the population while maintaining a good diversity. In the second level, the layered competitive swarm optimizer is employed to perform a deeper optimization of the solutions generated in the first level across the entire search space to increase their diversity further. Comparisons with six state-of-the-art algorithms on three LSMOP benchmarks, i.e., the LSMOP, UF, and IMF, with 2-12 objectives and 500-8000 decision variables, and the real-world problem TREE demonstrate the advantages of the proposed algorithm.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101763"},"PeriodicalIF":8.2,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142586621","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
Balance of exploration and exploitation: Non-cooperative game-driven evolutionary reinforcement learning 探索与开发的平衡:非合作博弈驱动的进化强化学习
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-04 DOI: 10.1016/j.swevo.2024.101759
Jin Yu, Ya Zhang, Changyin Sun
In a complex and dynamic environment, it becomes difficult to solve problems with a single policy updating mode. Although evolutionary reinforcement learning partially addresses this issue, it fails to consider the real-time status of the agent, resulting in inflexible policy updating modes that can negatively affect algorithm performance. To address this issue, we propose an evolutionary reinforcement learning based on non-cooperative games that leverages the benefits of various algorithms in cooperative and non-cooperative settings. Firstly, a competition framework is established between the evolutionary algorithm and reinforcement learning using a non-cooperative game. The policy updating mode is dynamically selected based on the game’s outcome, ensuring diverse algorithms through differentiated population evolution guided by Nash equilibrium. Secondly, the evolutionary algorithm collaborates with the non-cooperative game to establish a cooperative framework that balances exploration and convergence. Since the exploration of the evolutionary algorithm does not rely on the environment, it is used to guide the non-cooperative game, which helps the algorithm successfully overcome the local optimum. This synergy significantly enhances algorithm performance. Experimental results demonstrate that the proposed algorithm outperforms individual algorithms.
在复杂多变的环境中,单一的策略更新模式很难解决问题。虽然进化强化学习能部分解决这个问题,但它没有考虑到代理的实时状态,导致策略更新模式不灵活,从而对算法性能产生负面影响。为了解决这个问题,我们提出了一种基于非合作博弈的进化强化学习方法,它充分利用了合作和非合作环境中各种算法的优势。首先,利用非合作博弈在进化算法和强化学习之间建立一个竞争框架。根据博弈结果动态选择策略更新模式,通过纳什均衡指导下的种群差异化进化确保算法的多样性。其次,进化算法与非合作博弈合作,建立了一个兼顾探索和收敛的合作框架。由于进化算法的探索并不依赖于环境,它被用来指导非合作博弈,从而帮助算法成功克服局部最优。这种协同作用大大提高了算法性能。实验结果表明,所提出的算法优于单个算法。
{"title":"Balance of exploration and exploitation: Non-cooperative game-driven evolutionary reinforcement learning","authors":"Jin Yu,&nbsp;Ya Zhang,&nbsp;Changyin Sun","doi":"10.1016/j.swevo.2024.101759","DOIUrl":"10.1016/j.swevo.2024.101759","url":null,"abstract":"<div><div>In a complex and dynamic environment, it becomes difficult to solve problems with a single policy updating mode. Although evolutionary reinforcement learning partially addresses this issue, it fails to consider the real-time status of the agent, resulting in inflexible policy updating modes that can negatively affect algorithm performance. To address this issue, we propose an evolutionary reinforcement learning based on non-cooperative games that leverages the benefits of various algorithms in cooperative and non-cooperative settings. Firstly, a competition framework is established between the evolutionary algorithm and reinforcement learning using a non-cooperative game. The policy updating mode is dynamically selected based on the game’s outcome, ensuring diverse algorithms through differentiated population evolution guided by Nash equilibrium. Secondly, the evolutionary algorithm collaborates with the non-cooperative game to establish a cooperative framework that balances exploration and convergence. Since the exploration of the evolutionary algorithm does not rely on the environment, it is used to guide the non-cooperative game, which helps the algorithm successfully overcome the local optimum. This synergy significantly enhances algorithm performance. Experimental results demonstrate that the proposed algorithm outperforms individual algorithms.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101759"},"PeriodicalIF":8.2,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578127","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
A novel importance-guided particle swarm optimization based on MLP for solving large-scale feature selection problems 基于 MLP 的新型重要性引导粒子群优化技术,用于解决大规模特征选择问题
IF 8.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-11-04 DOI: 10.1016/j.swevo.2024.101760
Yu Xue, Chenyi Zhang
Feature selection is a crucial data preprocessing technique that effectively reduces the dataset size and enhances the performance of machine learning models. Evolutionary computation (EC) based feature selection has become one of the most important parts of feature selection methods. However, the performance of existing EC methods significantly decrease when dealing with datasets with thousands of dimensions. To address this issue, this paper proposes a novel method called importance-guided particle swarm optimization based on MLP (IGPSO) for feature selection. IGPSO utilizes a two stage trained neural network to learn a feature importance vector, which is then used as a guiding factor for population initialization and evolution. In the two stage of learning, the positive samples are used to learn the importance of useful features while the negative samples are used to identify the invalid features. Then the importance vector is generated combining the two category information. Finally, it is used to replace the acceleration factors and inertia weight in original binary PSO, which makes the individual acceleration factor and social acceleration factor are positively correlated with the importance values, while the inertia weight is negatively correlated with the importance value. Further more, IGPSO uses the flip probability to update the individuals. Experimental results on 24 datasets demonstrate that compared to other state-of-the-art algorithms, IGPSO can significantly reduce the number of features while maintaining satisfactory classification accuracy, thus achieving high-quality feature selection effects. In particular, compared with other state-of-the-art algorithms, there is an average reduction of 0.1 in the fitness value and an average increase of 6.7% in classification accuracy on large-scale datasets.
特征选择是一种重要的数据预处理技术,它能有效减少数据集的大小并提高机器学习模型的性能。基于进化计算(EC)的特征选择已成为特征选择方法中最重要的部分之一。然而,现有的进化计算方法在处理数千维度的数据集时性能明显下降。为了解决这个问题,本文提出了一种名为基于 MLP 的重要性引导粒子群优化(IGPSO)的新方法来进行特征选择。IGPSO 利用经过两阶段训练的神经网络来学习特征重要性向量,然后将其作为种群初始化和进化的指导因素。在两阶段学习中,正样本用于学习有用特征的重要性,而负样本用于识别无效特征。然后,结合两个类别的信息生成重要性向量。最后,用它来替换原始二元 PSO 中的加速因子和惯性权重,使得个体加速因子和社会加速因子与重要性值呈正相关,而惯性权重与重要性值呈负相关。此外,IGPSO 还使用翻转概率来更新个体。在 24 个数据集上的实验结果表明,与其他最先进的算法相比,IGPSO 可以在保持令人满意的分类准确性的同时显著减少特征数量,从而达到高质量的特征选择效果。特别是在大规模数据集上,与其他最先进的算法相比,适应度值平均降低了 0.1,分类准确率平均提高了 6.7%。
{"title":"A novel importance-guided particle swarm optimization based on MLP for solving large-scale feature selection problems","authors":"Yu Xue,&nbsp;Chenyi Zhang","doi":"10.1016/j.swevo.2024.101760","DOIUrl":"10.1016/j.swevo.2024.101760","url":null,"abstract":"<div><div>Feature selection is a crucial data preprocessing technique that effectively reduces the dataset size and enhances the performance of machine learning models. Evolutionary computation (EC) based feature selection has become one of the most important parts of feature selection methods. However, the performance of existing EC methods significantly decrease when dealing with datasets with thousands of dimensions. To address this issue, this paper proposes a novel method called importance-guided particle swarm optimization based on MLP (IGPSO) for feature selection. IGPSO utilizes a two stage trained neural network to learn a feature importance vector, which is then used as a guiding factor for population initialization and evolution. In the two stage of learning, the positive samples are used to learn the importance of useful features while the negative samples are used to identify the invalid features. Then the importance vector is generated combining the two category information. Finally, it is used to replace the acceleration factors and inertia weight in original binary PSO, which makes the individual acceleration factor and social acceleration factor are positively correlated with the importance values, while the inertia weight is negatively correlated with the importance value. Further more, IGPSO uses the flip probability to update the individuals. Experimental results on 24 datasets demonstrate that compared to other state-of-the-art algorithms, IGPSO can significantly reduce the number of features while maintaining satisfactory classification accuracy, thus achieving high-quality feature selection effects. In particular, compared with other state-of-the-art algorithms, there is an average reduction of 0.1 in the fitness value and an average increase of 6.7% in classification accuracy on large-scale datasets.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"91 ","pages":"Article 101760"},"PeriodicalIF":8.2,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142578126","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
期刊
Swarm and Evolutionary Computation
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1