Pub Date : 2024-11-15DOI: 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.
{"title":"An ensemble reinforcement learning-assisted deep learning framework for enhanced lung cancer diagnosis","authors":"Richa Jain, Parminder Singh, 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}
Pub Date : 2024-11-15DOI: 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.
{"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 , Yuyan Han , Yuting Wang , Junqing Li , 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}
Pub Date : 2024-11-14DOI: 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.
{"title":"A knowledge-driven many-objective algorithm for energy-efficient distributed heterogeneous hybrid flowshop scheduling with lot-streaming","authors":"Sanyan Chen, Xuewu Wang, Ye Wang, 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}
Pub Date : 2024-11-10DOI: 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.
{"title":"Balancing heterogeneous assembly line with multi-skilled human-robot collaboration via Adaptive cooperative co-evolutionary algorithm","authors":"Bo Tian , Himanshu Kaul , 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}
Pub Date : 2024-11-09DOI: 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.
{"title":"A collaborative-learning multi-agent reinforcement learning method for distributed hybrid flow shop scheduling problem","authors":"Yuanzhu Di , Libao Deng , 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}
Pub Date : 2024-11-09DOI: 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.
{"title":"MFWOA: Multifactorial Whale Optimization Algorithm","authors":"Lei Ye , Hangqi Ding , Haoran Xu , Benhua Xiang , Yue Wu , 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}
Pub Date : 2024-11-07DOI: 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.
{"title":"Transferring knowledge by budget online learning for multiobjective multitasking optimization","authors":"Fuhao Gao , Lingling Huang , Weifeng Gao , Longyue Li , Shuqi Wang , Maoguo Gong , 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}
Pub Date : 2024-11-05DOI: 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.
{"title":"Learning-guided cross-sampling for large-scale evolutionary multi-objective optimization","authors":"Haofan Wang , Li Chen , Xingxing Hao , Rong Qu , Wei Zhou , Dekui Wang , 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}
Pub Date : 2024-11-04DOI: 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, Ya Zhang, 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}
Pub Date : 2024-11-04DOI: 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.
{"title":"A novel importance-guided particle swarm optimization based on MLP for solving large-scale feature selection problems","authors":"Yu Xue, 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}