Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.T...Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at http://gffzz188fe103f8f1460asu0pc5bcqvpbc696n.ffgz.tsg.suse.edu.cn/saeidsheikhi/Painted-Wolf-Optimization.展开更多
Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapid...Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapidly and efficiently due to its memory residence,high time and space complexity.In ELM,the hidden layer typically necessitates a huge number of nodes.Furthermore,there is no certainty that the arrangement of weights and biases within the hidden layer is optimal.To solve this problem,the traditional ELM has been hybridized with swarm intelligence optimization techniques.This paper displays five proposed hybrid Algorithms“Salp Swarm Algorithm(SSA-ELM),Grasshopper Algorithm(GOA-ELM),Grey Wolf Algorithm(GWO-ELM),Whale optimizationAlgorithm(WOA-ELM)andMoth Flame Optimization(MFO-ELM)”.These five optimizers are hybridized with standard ELM methodology for resolving the tumor type classification using gene expression data.The proposed models applied to the predication of electricity loading data,that describes the energy use of a single residence over a fouryear period.In the hidden layer,Swarm algorithms are used to pick a smaller number of nodes to speed up the execution of ELM.The best weights and preferences were calculated by these algorithms for the hidden layer.Experimental results demonstrated that the proposed MFO-ELM achieved 98.13%accuracy and this is the highest model in accuracy in tumor type classification gene expression data.While in predication,the proposed GOA-ELM achieved 0.397which is least RMSE compared to the other models.展开更多
Detecting communities in real and complex networks is a highly contested topic in network analysis.Although many metaheuristic-based algorithms for community detection have been proposed,they still cannot effectively ...Detecting communities in real and complex networks is a highly contested topic in network analysis.Although many metaheuristic-based algorithms for community detection have been proposed,they still cannot effectively fulfill large-scale and real-world networks.Thus,this paper presents a new discrete version of the Improved Grey Wolf Optimizer(I-GWO)algorithm named DI-GWOCD for effectively detecting communities of different networks.In the proposed DI-GWOCD algorithm,I-GWO is first armed using a local search strategy to discover and improve nodes placed in improper communities and increase its ability to search for a better solution.Then a novel Binary Distance Vector(BDV)is introduced to calculate the wolves’distances and adapt I-GWO for solving the discrete community detection problem.The performance of the proposed DI-GWOCD was evaluated in terms of modularity,NMI,and the number of detected communities conducted by some well-known real-world network datasets.The experimental results were compared with the state-of-the-art algorithms and statistically analyzed using the Friedman and Wilcoxon tests.The comparison and the statistical analysis show that the proposed DI-GWOCD can detect the communities with higher quality than other comparative algorithms.展开更多
Location information plays an important role in most of the applications in Wireless Sensor Network(WSN).Recently,many localization techniques have been proposed,while most of these deals with two Dimensional applicat...Location information plays an important role in most of the applications in Wireless Sensor Network(WSN).Recently,many localization techniques have been proposed,while most of these deals with two Dimensional applications.Whereas,in Three Dimensional applications the task is complex and there are large variations in the altitude levels.In these 3D environments,the sensors are placed in mountains for tracking and deployed in air for monitoring pollution level.For such applications,2D localization models are not reliable.Due to this,the design of 3D localization systems in WSNs faces new challenges.In this paper,in order to find unknown nodes in Three-Dimensional environment,only single anchor node is used.In the simulation-based environment,the nodes with unknown locations are moving at middle&lower layers whereas the top layer is equipped with single anchor node.A novel soft computing technique namely Adaptive Plant Propagation Algorithm(APPA)is introduced to obtain the optimized locations of these mobile nodes.Thesemobile target nodes are heterogeneous and deployed in an anisotropic environment having an Irregularity(Degree of Irregularity(DOI))value set to 0.01.The simulation results present that proposed APPAalgorithm outperforms as tested among other meta-heuristic optimization techniques in terms of localization error,computational time,and the located sensor nodes.展开更多
针对无人机在复杂环境下的三维路径规划问题,集成传统的粒子群优化(particle swarm optimization,PSO)算法和灰狼优化(grey wolf optimization,GWO)算法,提出了一种PSO-GWO复合算法。首先,采用了非线性控制参数和加权自适应的个体位置...针对无人机在复杂环境下的三维路径规划问题,集成传统的粒子群优化(particle swarm optimization,PSO)算法和灰狼优化(grey wolf optimization,GWO)算法,提出了一种PSO-GWO复合算法。首先,采用了非线性控制参数和加权自适应的个体位置更新策略来平衡算法的全局搜索能力和局部搜索能力;然后,使用随机指导策略来增加解的多样性;最后,使用B样条曲线平滑所生成的飞行路径,使路径更适用于无人机。实验结果表明,PSO-GWO复合算法可以生成一条安全可行的路径,其性能明显优于GWO算法和其他改进GWO算法。展开更多
针对层状复合材料损伤的定性定量检测问题,集成传统粒子群优化(Particle Swarm Optimization,PSO)算法和灰狼优化(Grey Wolf Optimization,GWO)算法,提出一种新的PSO-GWO复合算法。以模态柔度矩阵、频率和振型这3个识别精度较好的指标...针对层状复合材料损伤的定性定量检测问题,集成传统粒子群优化(Particle Swarm Optimization,PSO)算法和灰狼优化(Grey Wolf Optimization,GWO)算法,提出一种新的PSO-GWO复合算法。以模态柔度矩阵、频率和振型这3个识别精度较好的指标来构造新的目标函数用于求解损伤检测问题。针对2种传统优化算法的特点,采用非线性收敛因子,以平衡算法的局部搜索能力和全局搜索能力;加入自适应局部搜索策略来增加算法迭代过程的多样性;引入灰狼算法的多级引导迭代策略,结合粒子群的速度更新策略,以弥补算法易陷入局部最优的缺陷。对3种不同损伤类型层合板的检测结果表明,PSO-GWO复合算法在检测精度与收敛速度方面均有优势,可以实现对损伤位置与损伤程度的精准识别。展开更多
摘要Metaheuristic optimization algorithms continue to be essential for solving complex real-world problems,yet existingmethods often struggle with balancing exploration and exploitation across diverse problem landscapes.This paper proposes a novel nature-inspired metaheuristic optimization algorithm named the Painted Wolf Optimization(PWO)algorithm.The main inspiration for the PWO algorithm is the group behavior and hunting strategy of painted wolves,also known as African wild dogs in the wild,particularly their unique consensus-based voting rally mechanism,a behavior fundamentally distinct fromthe social dynamics of grey wolves.In this innovative process,pack members explore different areas to find prey;then,they hold a pre-hunting voting rally based on the alpha member to determine who will begin the hunt and attack the prey.The efficiency of the proposed PWO algorithm is evaluated by a comparison study with other well-known optimization algorithms on 33 test functions,including the Congress on Evolutionary Computation(CEC)2017 suite and different real-world engineering design cases.Furthermore,the algorithm’s performance is further tested across a spectrum of optimization problems with extensive unknown search spaces.This includes its application within the field of cybersecurity,specifically in the context of training a machine learning-based intrusion detection system(ML-IDS),achieving an accuracy of 0.90 and an F-measure of 0.9290.Statistical analyses using the Wilcoxon signed-rank test(all p<0.05)indicate that the PWO algorithm outperforms existing state-of-the-art algorithms,providing superior solutions in diverse and unpredictable optimization landscapes.This demonstrates its potential as a robust method for tackling complex optimization problems in various fields.The source code for thePWOalgorithmis publicly available at http://gffzz188fe103f8f1460asu0pc5bcqvpbc696n.ffgz.tsg.suse.edu.cn/saeidsheikhi/Painted-Wolf-Optimization.
摘要Extreme Learning Machine(ELM)is popular in batch learning,sequential learning,and progressive learning,due to its speed,easy integration,and generalization ability.While,Traditional ELM cannot train massive data rapidly and efficiently due to its memory residence,high time and space complexity.In ELM,the hidden layer typically necessitates a huge number of nodes.Furthermore,there is no certainty that the arrangement of weights and biases within the hidden layer is optimal.To solve this problem,the traditional ELM has been hybridized with swarm intelligence optimization techniques.This paper displays five proposed hybrid Algorithms“Salp Swarm Algorithm(SSA-ELM),Grasshopper Algorithm(GOA-ELM),Grey Wolf Algorithm(GWO-ELM),Whale optimizationAlgorithm(WOA-ELM)andMoth Flame Optimization(MFO-ELM)”.These five optimizers are hybridized with standard ELM methodology for resolving the tumor type classification using gene expression data.The proposed models applied to the predication of electricity loading data,that describes the energy use of a single residence over a fouryear period.In the hidden layer,Swarm algorithms are used to pick a smaller number of nodes to speed up the execution of ELM.The best weights and preferences were calculated by these algorithms for the hidden layer.Experimental results demonstrated that the proposed MFO-ELM achieved 98.13%accuracy and this is the highest model in accuracy in tumor type classification gene expression data.While in predication,the proposed GOA-ELM achieved 0.397which is least RMSE compared to the other models.
摘要Detecting communities in real and complex networks is a highly contested topic in network analysis.Although many metaheuristic-based algorithms for community detection have been proposed,they still cannot effectively fulfill large-scale and real-world networks.Thus,this paper presents a new discrete version of the Improved Grey Wolf Optimizer(I-GWO)algorithm named DI-GWOCD for effectively detecting communities of different networks.In the proposed DI-GWOCD algorithm,I-GWO is first armed using a local search strategy to discover and improve nodes placed in improper communities and increase its ability to search for a better solution.Then a novel Binary Distance Vector(BDV)is introduced to calculate the wolves’distances and adapt I-GWO for solving the discrete community detection problem.The performance of the proposed DI-GWOCD was evaluated in terms of modularity,NMI,and the number of detected communities conducted by some well-known real-world network datasets.The experimental results were compared with the state-of-the-art algorithms and statistically analyzed using the Friedman and Wilcoxon tests.The comparison and the statistical analysis show that the proposed DI-GWOCD can detect the communities with higher quality than other comparative algorithms.
基金This research was supported by X-mind Corps program of National Research Foundation of Korea(NRF)funded by the Ministry of Science,ICT(No.2019H1D8A1105622)and the Soonchunhyang University Research Fund.
摘要Location information plays an important role in most of the applications in Wireless Sensor Network(WSN).Recently,many localization techniques have been proposed,while most of these deals with two Dimensional applications.Whereas,in Three Dimensional applications the task is complex and there are large variations in the altitude levels.In these 3D environments,the sensors are placed in mountains for tracking and deployed in air for monitoring pollution level.For such applications,2D localization models are not reliable.Due to this,the design of 3D localization systems in WSNs faces new challenges.In this paper,in order to find unknown nodes in Three-Dimensional environment,only single anchor node is used.In the simulation-based environment,the nodes with unknown locations are moving at middle&lower layers whereas the top layer is equipped with single anchor node.A novel soft computing technique namely Adaptive Plant Propagation Algorithm(APPA)is introduced to obtain the optimized locations of these mobile nodes.Thesemobile target nodes are heterogeneous and deployed in an anisotropic environment having an Irregularity(Degree of Irregularity(DOI))value set to 0.01.The simulation results present that proposed APPAalgorithm outperforms as tested among other meta-heuristic optimization techniques in terms of localization error,computational time,and the located sensor nodes.
摘要针对无人机在复杂环境下的三维路径规划问题,集成传统的粒子群优化(particle swarm optimization,PSO)算法和灰狼优化(grey wolf optimization,GWO)算法,提出了一种PSO-GWO复合算法。首先,采用了非线性控制参数和加权自适应的个体位置更新策略来平衡算法的全局搜索能力和局部搜索能力;然后,使用随机指导策略来增加解的多样性;最后,使用B样条曲线平滑所生成的飞行路径,使路径更适用于无人机。实验结果表明,PSO-GWO复合算法可以生成一条安全可行的路径,其性能明显优于GWO算法和其他改进GWO算法。
摘要针对层状复合材料损伤的定性定量检测问题,集成传统粒子群优化(Particle Swarm Optimization,PSO)算法和灰狼优化(Grey Wolf Optimization,GWO)算法,提出一种新的PSO-GWO复合算法。以模态柔度矩阵、频率和振型这3个识别精度较好的指标来构造新的目标函数用于求解损伤检测问题。针对2种传统优化算法的特点,采用非线性收敛因子,以平衡算法的局部搜索能力和全局搜索能力;加入自适应局部搜索策略来增加算法迭代过程的多样性;引入灰狼算法的多级引导迭代策略,结合粒子群的速度更新策略,以弥补算法易陷入局部最优的缺陷。对3种不同损伤类型层合板的检测结果表明,PSO-GWO复合算法在检测精度与收敛速度方面均有优势,可以实现对损伤位置与损伤程度的精准识别。