In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update ...In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.展开更多
Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design...Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.展开更多
Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a...Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.展开更多
In recent years,numerical weather forecasting has been increasingly emphasized.Variational data assimilation furnishes precise initial values for numerical forecasting models,constituting an inherently nonlinear optim...In recent years,numerical weather forecasting has been increasingly emphasized.Variational data assimilation furnishes precise initial values for numerical forecasting models,constituting an inherently nonlinear optimization challenge.The enormity of the dataset under consideration gives rise to substantial computational burdens,complex modeling,and high hardware requirements.This paper employs the Dual-Population Particle Swarm Optimization(DPSO)algorithm in variational data assimilation to enhance assimilation accuracy.By harnessing parallel computing principles,the paper introduces the Parallel Dual-Population Particle Swarm Optimization(PDPSO)Algorithm to reduce the algorithm processing time.Simulations were carried out using partial differential equations,and comparisons in terms of time and accuracy were made against DPSO,the Dynamic Weight Particle Swarm Algorithm(PSOCIWAC),and the TimeVarying Double Compression Factor Particle Swarm Algorithm(PSOTVCF).Experimental results indicate that the proposed PDPSO outperforms PSOCIWAC and PSOTVCF in convergence accuracy and is comparable to DPSO.Regarding processing time,PDPSO is 40%faster than PSOCIWAC and PSOTVCF and 70%faster than DPSO.展开更多
Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the chall...Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.展开更多
Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embe...Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.展开更多
The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optim...The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.展开更多
Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one...Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm opt...Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The se...To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.展开更多
The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipula...The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.展开更多
Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation...Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation shows that this new method makes the optimization perfectly and convergence quickly.展开更多
Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local s...Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.展开更多
As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for th...As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.展开更多
In Rayleigh wave exploration,the inversion of dispersion curves is a crucial step for obtaining subsurface stratigraphic information,characterized by its multi-parameter and multi-extremum nature.Local optimization al...In Rayleigh wave exploration,the inversion of dispersion curves is a crucial step for obtaining subsurface stratigraphic information,characterized by its multi-parameter and multi-extremum nature.Local optimization algorithms used in dispersion curve inversion are highly dependent on the initial model and are prone to being trapped in local optima,while classical global optimization algorithms often suffer from slow convergence and low solution accuracy.To address these issues,this study introduces the Osprey Optimization Algorithm(OOA),known for its strong global search and local exploitation capabilities,into the inversion of dispersion curves to enhance inversion performance.In noiseless theoretical models,the OOA demonstrates excellent inversion accuracy and stability,accurately recovering model parameters.Even in noisy models,OOA maintains robust performance,achieving high inversion precision under high-noise conditions.In multimode dispersion curve tests,OOA effectively handles higher modes due to its efficient global and local search capabilities,and the inversion results show high consistency with theoretical values.Field data from the Wyoming region in the United States and a landfill site in Italy further verify the practical applicability of the OOA.Comprehensive test results indicate that the OOA outperforms the Particle Swarm Optimization(PSO)algorithm,providing a highly accurate and reliable inversion strategy for dispersion curve inversion.展开更多
This paper presents an innovative and effective control strategy tailored for a deregulated,diversified energy system involving multiple interconnected area.Each area integrates a unique mix of power generation techno...This paper presents an innovative and effective control strategy tailored for a deregulated,diversified energy system involving multiple interconnected area.Each area integrates a unique mix of power generation technologies:Area 1 combines thermal,hydro,and distributed generation;Area 2 utilizes a blend of thermal units,distributed solar technologies(DST),and hydro power;andThird control area hosts geothermal power station alongside thermal power generation unit and hydropower units.The suggested control system employs a multi-layered approach,featuring a blended methodology utilizing the Tilted Integral Derivative controller(TID)and the Fractional-Order Integral method to enhance performance and stability.The parameters of this hybrid TID-FOI controller are finely tuned using an advanced optimization method known as the Walrus Optimization Algorithm(WaOA).Performance analysis reveals that the combined TID-FOI controller significantly outperforms the TID and PID controllers when comparing their dynamic response across various system configurations.The study also incorporates investigation of redox flow batteries within the broader scope of energy storage applications to assess their impact on system performance.In addition,the research explores the controller’s effectiveness under different power exchange scenarios in a deregulated market,accounting for restrictions on generation ramp rates and governor hysteresis effects in dynamic control.To ensure the reliability and resilience of the presented methodology,the system transitions and develops across a broad range of varying parameters and stochastic load fluctuation.To wrap up,the study offers a pioneering control approach-a hybrid TID-FOI controller optimized via the Walrus Optimization Algorithm(WaOA)-designed for enhanced stability and performance in a complex,three-region hybrid energy system functioning within a deregulated framework.展开更多
The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,a...The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.展开更多
文摘In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.
文摘Thediagnosis of Dry EyeDisease(DED),however,usually depends on clinical information and complex,high-dimensional datasets.To improve the performance of classification models,this paper proposes a Computer Aided Design(CAD)system that presents a new method for DED classification called(IAOO-PSO),which is a powerful Feature Selection technique(FS)that integrates with Opposition-Based Learning(OBL)and Particle Swarm Optimization(PSO).We improve the speed of convergence with the PSO algorithmand the exploration with the IAOO algorithm.The IAOO is demonstrated to possess superior global optimization capabilities,as validated on the IEEE Congress on Evolutionary Computation 2022(CEC’22)benchmark suite and compared with seven Metaheuristic(MH)algorithms.Additionally,an IAOO-PSO model based on Support Vector Machines(SVMs)classifier is proposed for FS and classification,where the IAOO-PSO is used to identify the most relevant features.This model was applied to the DED dataset comprising 20,000 cases and 26 features,achieving a high classification accuracy of 99.8%,which significantly outperforms other optimization algorithms.The experimental results demonstrate the reliability,success,and efficiency of the IAOO-PSO technique for both FS and classification in the detection of DED.
文摘Particle Swarm Optimization(PSO)has been utilized as a useful tool for solving intricate optimization problems for various applications in different fields.This paper attempts to carry out an update on PSO and gives a review of its recent developments and applications,but also provides arguments for its efficacy in resolving optimization problems in comparison with other algorithms.Covering six strategic areas,which include Data Mining,Machine Learning,Engineering Design,Energy Systems,Healthcare,and Robotics,the study demonstrates the versatility and effectiveness of the PSO.Experimental results are,however,used to show the strong and weak parts of PSO,and performance results are included in tables for ease of comparison.The results stress PSO’s efficiency in providing optimal solutions but also show that there are aspects that need to be improved through combination with algorithms or tuning to the parameters of the method.The review of the advantages and limitations of PSO is intended to provide academics and practitioners with a well-rounded view of the methods of employing such a tool most effectively and to encourage optimized designs of PSO in solving theoretical and practical problems in the future.
基金Supported by Hubei Provincial Department of Education Teaching Research Project(2016294,2017320)Hubei Provincial Humanities and Social Science Research Project(17D033)+2 种基金College Students Innovation and Entrepreneurship Training Program(National)(20191050013)Hubei Province Natural Science Foundation General Project(2021CFB584)2023 College Student Innovation and Entrepreneurship Training Program Project(202310500047,202310500049)。
文摘In recent years,numerical weather forecasting has been increasingly emphasized.Variational data assimilation furnishes precise initial values for numerical forecasting models,constituting an inherently nonlinear optimization challenge.The enormity of the dataset under consideration gives rise to substantial computational burdens,complex modeling,and high hardware requirements.This paper employs the Dual-Population Particle Swarm Optimization(DPSO)algorithm in variational data assimilation to enhance assimilation accuracy.By harnessing parallel computing principles,the paper introduces the Parallel Dual-Population Particle Swarm Optimization(PDPSO)Algorithm to reduce the algorithm processing time.Simulations were carried out using partial differential equations,and comparisons in terms of time and accuracy were made against DPSO,the Dynamic Weight Particle Swarm Algorithm(PSOCIWAC),and the TimeVarying Double Compression Factor Particle Swarm Algorithm(PSOTVCF).Experimental results indicate that the proposed PDPSO outperforms PSOCIWAC and PSOTVCF in convergence accuracy and is comparable to DPSO.Regarding processing time,PDPSO is 40%faster than PSOCIWAC and PSOTVCF and 70%faster than DPSO.
基金jointly supported by the Jiangsu Postgraduate Research and Practice Innovation Project under Grant KYCX22_1030,SJCX22_0283 and SJCX23_0293the NUPTSF under Grant NY220201.
文摘Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.
文摘Numerous wireless networks have emerged that can be used for short communication ranges where the infrastructure-based networks may fail because of their installation and cost.One of them is a sensor network with embedded sensors working as the primary nodes,termed Wireless Sensor Networks(WSNs),in which numerous sensors are connected to at least one Base Station(BS).These sensors gather information from the environment and transmit it to a BS or gathering location.WSNs have several challenges,including throughput,energy usage,and network lifetime concerns.Different strategies have been applied to get over these restrictions.Clustering may,therefore,be thought of as the best way to solve such issues.Consequently,it is crucial to analyze effective Cluster Head(CH)selection to maximize efficiency throughput,extend the network lifetime,and minimize energy consumption.This paper proposed an Accelerated Particle Swarm Optimization(APSO)algorithm based on the Low Energy Adaptive Clustering Hierarchy(LEACH),Neighboring Based Energy Efficient Routing(NBEER),Cooperative Energy Efficient Routing(CEER),and Cooperative Relay Neighboring Based Energy Efficient Routing(CR-NBEER)techniques.With the help of APSO in the implementation of the WSN,the main methodology of this article has taken place.The simulation findings in this study demonstrated that the suggested approach uses less energy,with respective energy consumption ranges of 0.1441 to 0.013 for 5 CH,1.003 to 0.0521 for 10 CH,and 0.1734 to 0.0911 for 15 CH.The sending packets ratio was also raised for all three CH selection scenarios,increasing from 659 to 1730.The number of dead nodes likewise dropped for the given combination,falling between 71 and 66.The network lifetime was deemed to have risen based on the results found.A hybrid with a few valuable parameters can further improve the suggested APSO-based protocol.Similar to underwater,WSN can make use of the proposed protocol.The overall results have been evaluated and compared with the existing approaches of sensor networks.
基金the National Natural Science Foundation of China(52177074).
文摘The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.
基金Supported by National-Natural Science Found for Distinguished Young Scholars of China （61025015）, the Foundation for Innovative Research Groups of National Natural Science Foundation of China （61321003） and the China Scholarship Council
基金National Natural Science Foundations of China(No. 61103175,No. 11141005)Technology Innovation Platform Project of Fujian Province,China (No. 2009J1007)+1 种基金Key Project Development Foundation of Education Committee of Fujian Province,China (No.JA11011)Project Development Foundations of Fuzhou University,China (No. 2010-XQ-21,No. XRC-1037)
文摘Wireless sensor networks (WSNs) are mainly characterized by their limited and non-replenishable energy supply. Hence, the energy efficiency of the infrastructure greatly affects the network lifetime. Clustering is one of the methods that can expand the lifespan of the whole network by grouping the sensor nodes according to some criteria and choosing the appropriate cluster heads(CHs). The balanced load of the CHs has an important effect on the energy consumption balancing and lifespan of the whole network. Therefore, a new CHs election method is proposed using an adaptive discrete particle swarm optimization (ADPSO) algorithm with a fitness value function considering the load balancing and energy consumption. Simulation results not only demonstrate that the proposed algorithm can have better performance in load balancing than low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), and dynamic clustering algorithm with balanced load (DCBL), but also imply that the proposed algorithm can extend the network lifetime more.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
文摘An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
文摘Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
文摘To deal with the problems of premature convergence and tending to jump into the local optimum in the traditional particle swarm optimization, a novel improved particle swarm optimization algorithm was proposed. The self-adaptive inertia weight factor was used to accelerate the converging speed, and chaotic sequences were used to tune the acceleration coefficients for the balance between exploration and exploitation. The performance of the proposed algorithm was tested on four classical multi-objective optimization functions by comparing with the non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results verified the effectiveness of the algorithm, which improved the premature convergence problem with faster convergence rate and strong ability to jump out of local optimum.
文摘The performances of Particle Swarm Optimization and Genetic Algorithm have been compared to develop a methodology for concurrent and integrated design of mechanical structure and controller of a 2-dof robotic manipulator solving tracking problems. The proposed design scheme optimizes various parameters belonging to different domains (that is, link geometry, mass distribution, moment of inertia, control gains) concurrently to design manipulator, which can track some given paths accurately with a minimum power consumption. The main strength of this study lies with the design of an integrated scheme to solve the above problem. Both real-coded Genetic Algorithm and Particle Swarm Optimization are used to solve this complex optimization problem. Four approaches have been developed and their performances are compared. Particle Swarm Optimization is found to perform better than the Genetic Algorithm, as the former carries out both global and local searches simultaneously, whereas the latter concentrates mainly on the global search. Controllers with adaptive gain values have shown better performance compared to the conventional ones, as expected.
文摘Based on a new adaptive Particle Swarm Optimization algorithm with dynamically changing inertia weight (DAPSO), It is used to optimize parameters in PID controller. Compared to conventional PID methods, the simulation shows that this new method makes the optimization perfectly and convergence quickly.
文摘Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.
文摘As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.
基金sponsored by China Geological Survey Project(DD20243193 and DD20230206508).
文摘In Rayleigh wave exploration,the inversion of dispersion curves is a crucial step for obtaining subsurface stratigraphic information,characterized by its multi-parameter and multi-extremum nature.Local optimization algorithms used in dispersion curve inversion are highly dependent on the initial model and are prone to being trapped in local optima,while classical global optimization algorithms often suffer from slow convergence and low solution accuracy.To address these issues,this study introduces the Osprey Optimization Algorithm(OOA),known for its strong global search and local exploitation capabilities,into the inversion of dispersion curves to enhance inversion performance.In noiseless theoretical models,the OOA demonstrates excellent inversion accuracy and stability,accurately recovering model parameters.Even in noisy models,OOA maintains robust performance,achieving high inversion precision under high-noise conditions.In multimode dispersion curve tests,OOA effectively handles higher modes due to its efficient global and local search capabilities,and the inversion results show high consistency with theoretical values.Field data from the Wyoming region in the United States and a landfill site in Italy further verify the practical applicability of the OOA.Comprehensive test results indicate that the OOA outperforms the Particle Swarm Optimization(PSO)algorithm,providing a highly accurate and reliable inversion strategy for dispersion curve inversion.
文摘This paper presents an innovative and effective control strategy tailored for a deregulated,diversified energy system involving multiple interconnected area.Each area integrates a unique mix of power generation technologies:Area 1 combines thermal,hydro,and distributed generation;Area 2 utilizes a blend of thermal units,distributed solar technologies(DST),and hydro power;andThird control area hosts geothermal power station alongside thermal power generation unit and hydropower units.The suggested control system employs a multi-layered approach,featuring a blended methodology utilizing the Tilted Integral Derivative controller(TID)and the Fractional-Order Integral method to enhance performance and stability.The parameters of this hybrid TID-FOI controller are finely tuned using an advanced optimization method known as the Walrus Optimization Algorithm(WaOA).Performance analysis reveals that the combined TID-FOI controller significantly outperforms the TID and PID controllers when comparing their dynamic response across various system configurations.The study also incorporates investigation of redox flow batteries within the broader scope of energy storage applications to assess their impact on system performance.In addition,the research explores the controller’s effectiveness under different power exchange scenarios in a deregulated market,accounting for restrictions on generation ramp rates and governor hysteresis effects in dynamic control.To ensure the reliability and resilience of the presented methodology,the system transitions and develops across a broad range of varying parameters and stochastic load fluctuation.To wrap up,the study offers a pioneering control approach-a hybrid TID-FOI controller optimized via the Walrus Optimization Algorithm(WaOA)-designed for enhanced stability and performance in a complex,three-region hybrid energy system functioning within a deregulated framework.
基金funded by the University of Jeddah,Jeddah,Saudi Arabia,under Grant No.(UJ-23-DR-26)。
文摘The diversity of data sources resulted in seeking effective manipulation and dissemination.The challenge that arises from the increasing dimensionality has a negative effect on the computation performance,efficiency,and stability of computing.One of the most successful optimization algorithms is Particle Swarm Optimization(PSO)which has proved its effectiveness in exploring the highest influencing features in the search space based on its fast convergence and the ability to utilize a small set of parameters in the search task.This research proposes an effective enhancement of PSO that tackles the challenge of randomness search which directly enhances PSO performance.On the other hand,this research proposes a generic intelligent framework for early prediction of orders delay and eliminate orders backlogs which could be considered as an efficient potential solution for raising the supply chain performance.The proposed adapted algorithm has been applied to a supply chain dataset which minimized the features set from twenty-one features to ten significant features.To confirm the proposed algorithm results,the updated data has been examined by eight of the well-known classification algorithms which reached a minimum accuracy percentage equal to 94.3%for random forest and a maximum of 99.0 for Naïve Bayes.Moreover,the proposed algorithm adaptation has been compared with other proposed adaptations of PSO from the literature over different datasets.The proposed PSO adaptation reached a higher accuracy compared with the literature ranging from 97.8 to 99.36 which also proved the advancement of the current research.
