This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a mul...This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.展开更多
During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution qual...During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization (CPSO) for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle's historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.展开更多
The electromagnetism-like(EM)algorithm is a meta-heuristic optimization algorithm,which uses a novel searching mechanism called attraction-repulsion between charged particles.It is worth pointing out that there are tw...The electromagnetism-like(EM)algorithm is a meta-heuristic optimization algorithm,which uses a novel searching mechanism called attraction-repulsion between charged particles.It is worth pointing out that there are two potential problems in the calculation of particle charge by the original EM algorithm.One of the problems is that the information utilization rate of the population is not high,and the other problem is the decline of population diversity when the population size is much greater than the dimension of the problem.In contrast,it is more fully to exploit the useful search information based on the proposed new quadratic formula for charge calculation in this paper.Furthermore,the population size was introduced as a new multiplier term to improve the population diversity.In the end,numerical experiments were used to verify the performance of the proposed method,including a comparison with the original EM algorithm and other well-known methods such as artificial bee colony(ABC),and particle swarm optimization(PSO).The results showed the effectiveness of the proposed algorithm.展开更多
This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adju...This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.展开更多
随着可再生能源并入多区域电力系统,其不确定性大大增加了电力系统多区域经济调度的复杂度。如何高效求解含有风力和太阳能的多区域经济调度(multi-areaeconomic dispatch containing wind and solar energy,MAEDWS)问题面临着严峻的挑...随着可再生能源并入多区域电力系统,其不确定性大大增加了电力系统多区域经济调度的复杂度。如何高效求解含有风力和太阳能的多区域经济调度(multi-areaeconomic dispatch containing wind and solar energy,MAEDWS)问题面临着严峻的挑战。针对现有优化算法在处理MAEDWS问题时存在收敛速度慢和求解精度低等不足,该文提出一种基于衍生搜索的政治优化(derivative search-based political optimizer,DSPO)算法。在政治优化算法的基础上,引入首脑引领策略和衍生搜索机制。前者引领候选解前往更有希望的区域,加快收敛速度;后者在区域获胜者周围衍生邻域解,丰富多样性。该文将DSPO算法和其他6种代表性算法应用于MAEDWS问题,并进行对比分析。收敛曲线和性能指标的结果表明DSPO算法在收敛效率、求解精确度、稳定性方面取得了整体最优。展开更多
Curvature lines are special and important curves on surfaces.It is of great significance to construct developable surface interpolated on curvature lines in engineering applications.In this paper,the shape optimizatio...Curvature lines are special and important curves on surfaces.It is of great significance to construct developable surface interpolated on curvature lines in engineering applications.In this paper,the shape optimization of generalized cubic ball developable surface interpolated on the curvature line is studied by using the improved reptile search algorithm.Firstly,based on the curvature line of generalized cubic ball curve with shape adjustable,this paper gives the construction method of SGC-Ball developable surface interpolated on the curve.Secondly,the feedback mechanism,adaptive parameters and mutation strategy are introduced into the reptile search algorithm,and the Feedback mechanism-driven improved reptile search algorithm effectively improves the solving precision.On IEEE congress on evolutionary computation 2014,2017,2019 and four engineering design problems,the feedback mechanism-driven improved reptile search algorithm is compared with other representative methods,and the result indicates that the solution performance of the feedback mechanism-driven improved reptile search algorithm is competitive.At last,taking the minimum energy as the evaluation index,the shape optimization model of SGC-Ball interpolation developable surface is established.The developable surface with the minimum energy is achieved with the help of the feedback mechanism-driven improved reptile search algorithm,and the comparison experiment verifies the superiority of the feedback mechanism-driven improved reptile search algorithm for the shape optimization problem.展开更多
文摘This article addresses the issues of falling into local optima and insufficient exploration capability in the Arithmetic Optimization Algorithm (AOA), proposing an improved Arithmetic Optimization Algorithm with a multi-strategy mechanism (BSFAOA). This algorithm introduces three strategies within the standard AOA framework: an adaptive balance factor SMOA based on sine functions, a search strategy combining Spiral Search and Brownian Motion, and a hybrid perturbation strategy based on Whale Fall Mechanism and Polynomial Differential Learning. The BSFAOA algorithm is analyzed in depth on the well-known 23 benchmark functions, CEC2019 test functions, and four real optimization problems. The experimental results demonstrate that the BSFAOA algorithm can better balance the exploration and exploitation capabilities, significantly enhancing the stability, convergence mode, and search efficiency of the AOA algorithm.
基金Projects(50275150,61173052)supported by the National Natural Science Foundation of China
文摘During the last decade, many variants of the original particle swarm optimization (PSO) algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization (CPSO) for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle's historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.
基金National Natural Science Foundation of China(Nos.61602398 and U19A2083)Science and Technology Development of Hunan Province,China(No.2019GK4007)。
文摘The electromagnetism-like(EM)algorithm is a meta-heuristic optimization algorithm,which uses a novel searching mechanism called attraction-repulsion between charged particles.It is worth pointing out that there are two potential problems in the calculation of particle charge by the original EM algorithm.One of the problems is that the information utilization rate of the population is not high,and the other problem is the decline of population diversity when the population size is much greater than the dimension of the problem.In contrast,it is more fully to exploit the useful search information based on the proposed new quadratic formula for charge calculation in this paper.Furthermore,the population size was introduced as a new multiplier term to improve the population diversity.In the end,numerical experiments were used to verify the performance of the proposed method,including a comparison with the original EM algorithm and other well-known methods such as artificial bee colony(ABC),and particle swarm optimization(PSO).The results showed the effectiveness of the proposed algorithm.
基金partially supported by the Fundamental Research Funds for the Central Universities(WUT:2022IVA067)the National Natural Science Foundation of China(Grant No.:72172112)the Fundamental Research Funds for the Central Universities(HUST:2019kfyRCPY038).
文摘This paper proposes an enhanced arithmetic optimization algorithm(AOA)called PSAOA that incorporates the proposed probabilistic search strategy to increase the searching quality of the original AOA.Furthermore,an adjustable parameter is also developed to balance the exploration and exploitation operations.In addition,a jump mechanism is included in the PSAOAto assist individuals in jumping out of local optima.Using 29 classical benchmark functions,the proposed PSAOA is extensively tested.Compared to the AOA and other well-known methods,the experiments demonstrated that the proposed PSAOA beats existing comparison algorithms on the majority of the test functions.
文摘随着可再生能源并入多区域电力系统,其不确定性大大增加了电力系统多区域经济调度的复杂度。如何高效求解含有风力和太阳能的多区域经济调度(multi-areaeconomic dispatch containing wind and solar energy,MAEDWS)问题面临着严峻的挑战。针对现有优化算法在处理MAEDWS问题时存在收敛速度慢和求解精度低等不足,该文提出一种基于衍生搜索的政治优化(derivative search-based political optimizer,DSPO)算法。在政治优化算法的基础上,引入首脑引领策略和衍生搜索机制。前者引领候选解前往更有希望的区域,加快收敛速度;后者在区域获胜者周围衍生邻域解,丰富多样性。该文将DSPO算法和其他6种代表性算法应用于MAEDWS问题,并进行对比分析。收敛曲线和性能指标的结果表明DSPO算法在收敛效率、求解精确度、稳定性方面取得了整体最优。
基金supported by the National Natural Science Foundation of China(Grant No.52375264).
文摘Curvature lines are special and important curves on surfaces.It is of great significance to construct developable surface interpolated on curvature lines in engineering applications.In this paper,the shape optimization of generalized cubic ball developable surface interpolated on the curvature line is studied by using the improved reptile search algorithm.Firstly,based on the curvature line of generalized cubic ball curve with shape adjustable,this paper gives the construction method of SGC-Ball developable surface interpolated on the curve.Secondly,the feedback mechanism,adaptive parameters and mutation strategy are introduced into the reptile search algorithm,and the Feedback mechanism-driven improved reptile search algorithm effectively improves the solving precision.On IEEE congress on evolutionary computation 2014,2017,2019 and four engineering design problems,the feedback mechanism-driven improved reptile search algorithm is compared with other representative methods,and the result indicates that the solution performance of the feedback mechanism-driven improved reptile search algorithm is competitive.At last,taking the minimum energy as the evaluation index,the shape optimization model of SGC-Ball interpolation developable surface is established.The developable surface with the minimum energy is achieved with the help of the feedback mechanism-driven improved reptile search algorithm,and the comparison experiment verifies the superiority of the feedback mechanism-driven improved reptile search algorithm for the shape optimization problem.