Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)...Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)is proposed to acquire more accurate solutions with less finite element analysis.The full attraction model of firefly algorithm(FA)is analyzed,and the factors that affect its computational efficiency and accuracy are revealed.A modified FA with simplified attraction model and adaptive parameter of sine cosine algorithm(SCA)is proposed to reduce the computational complexity and enhance the convergence rate.Then,the population is classified,and different populations are updated by modified FA and SCA respectively.Besides,the random search strategy based on Lévy flight is adopted to update the stagnant or infeasible solutions to enhance the population diversity.Elitist selection technique is applied to save the promising solutions and further improve the convergence rate.Moreover,the adaptive penalty function is employed to deal with the constraints.Finally,the performance of HSCFA is demonstrated through the numerical examples with nonstructural masses and frequency constraints.The results show that HSCFA is an efficient and competitive tool for shape and size optimization problems with frequency constraints.展开更多
Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic alg...Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic algorithms have received a lot of attention in recent years because of their efficient performance and simple structure.Sine Cosine Algorithm(SCA)is a recent Metaheuristic algorithm that is based on two trigonometric functions Sine&Cosine.However,like all other metaheuristic algorithms,SCA has a slow convergence and may fail in sub-optimal regions.In this study,an enhanced version of SCA named RDSCA is suggested that depends on two techniques:random spare/replacement and double adaptive weight.The first technique is employed in SCA to speed the convergence whereas the second method is used to enhance exploratory searching capabilities.To evaluate RDSCA,30 functions from CEC 2017 and 4 real-world engineering problems are used.Moreover,a nonparametric test called Wilcoxon signed-rank is carried out at 5%level to evaluate the significance of the obtained results between RDSCA and the other 5 variants of SCA.The results show that RDSCA has competitive results with other metaheuristics algorithms.展开更多
The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a...The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.展开更多
Golden eagle optimizer(GEO)is a recently introduced nature-inspired metaheuristic algorithm,which simulates the spiral hunting behavior of golden eagles in nature.Regrettably,the GEO suffers from the challenges of low...Golden eagle optimizer(GEO)is a recently introduced nature-inspired metaheuristic algorithm,which simulates the spiral hunting behavior of golden eagles in nature.Regrettably,the GEO suffers from the challenges of low diversity,slow iteration speed,and stagnation in local optimization when dealing with complicated optimization problems.To ameliorate these deficiencies,an improved hybrid GEO called IGEO,combined with Lévy flight,sine cosine algorithm and differential evolution(DE)strategy,is developed in this paper.The Lévy flight strategy is introduced into the initial stage to increase the diversity of the golden eagle population and make the initial population more abundant;meanwhile,the sine-cosine function can enhance the exploration ability of GEO and decrease the possibility of GEO falling into the local optima.Furthermore,the DE strategy is used in the exploration and exploitation stage to improve accuracy and convergence speed of GEO.Finally,the superiority of the presented IGEO are comprehensively verified by comparing GEO and several state-of-the-art algorithms using(1)the CEC 2017 and CEC 2019 benchmark functions and(2)5 real-world engineering problems respectively.The comparison results demonstrate that the proposed IGEO is a powerful and attractive alternative for solving engineering optimization problems.展开更多
电鳗觅食优化算法EEFO(Electric Eel Foraging Optimization)在迭代过程中会出现全局探索能力不足、容易陷入局部最优和收敛速度慢的问题。同时,算法的性能受到参数设置的影响,需要仔细调整和优化。对此,提出了一种多策略改进的电鳗觅...电鳗觅食优化算法EEFO(Electric Eel Foraging Optimization)在迭代过程中会出现全局探索能力不足、容易陷入局部最优和收敛速度慢的问题。同时,算法的性能受到参数设置的影响,需要仔细调整和优化。对此,提出了一种多策略改进的电鳗觅食优化算法(IEEFO)。首先,调整能量因子策略,引入了双曲正切能量因子,使算法在迭代过程中提前加入开发行为,从而快速发现最优种群,加快收敛速度;之后,改进扰动因子,扩大电鳗游走的位置范围,有利于种群的全局寻优;然后,在迁徙阶段加入正弦余弦策略,促进算法的局部开发;最后,在每次迭代之后,加入透镜成像反向学习的策略来扩大搜索空间,使得算法跳出局部最优并加速收敛到全局最优解。将IEEFO分别与6种基本算法、4种单策略改进的电鳗觅食优化算法进行对比,对13个基准函数进行仿真实验,对IEEFO算法进行性能评估。实验结果表明,IEEFO相比于对比算法收敛速度更快,全局寻优能力更强,算法总体性能有显著提升。此外,通过一个机械优化设计实验进行测试分析,进一步验证了IEEFO的有效性和适用性。展开更多
基金supported by the NationalNatural Science Foundation of China(No.11672098).
文摘Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)is proposed to acquire more accurate solutions with less finite element analysis.The full attraction model of firefly algorithm(FA)is analyzed,and the factors that affect its computational efficiency and accuracy are revealed.A modified FA with simplified attraction model and adaptive parameter of sine cosine algorithm(SCA)is proposed to reduce the computational complexity and enhance the convergence rate.Then,the population is classified,and different populations are updated by modified FA and SCA respectively.Besides,the random search strategy based on Lévy flight is adopted to update the stagnant or infeasible solutions to enhance the population diversity.Elitist selection technique is applied to save the promising solutions and further improve the convergence rate.Moreover,the adaptive penalty function is employed to deal with the constraints.Finally,the performance of HSCFA is demonstrated through the numerical examples with nonstructural masses and frequency constraints.The results show that HSCFA is an efficient and competitive tool for shape and size optimization problems with frequency constraints.
基金supported in part by the Hangzhou Science and Technology Development Plan Project(Grant No.20191203B30).
文摘Many complex optimization problems in the real world can easily fall into local optimality and fail to find the optimal solution,so more new techniques and methods are needed to solve such challenges.Metaheuristic algorithms have received a lot of attention in recent years because of their efficient performance and simple structure.Sine Cosine Algorithm(SCA)is a recent Metaheuristic algorithm that is based on two trigonometric functions Sine&Cosine.However,like all other metaheuristic algorithms,SCA has a slow convergence and may fail in sub-optimal regions.In this study,an enhanced version of SCA named RDSCA is suggested that depends on two techniques:random spare/replacement and double adaptive weight.The first technique is employed in SCA to speed the convergence whereas the second method is used to enhance exploratory searching capabilities.To evaluate RDSCA,30 functions from CEC 2017 and 4 real-world engineering problems are used.Moreover,a nonparametric test called Wilcoxon signed-rank is carried out at 5%level to evaluate the significance of the obtained results between RDSCA and the other 5 variants of SCA.The results show that RDSCA has competitive results with other metaheuristics algorithms.
文摘The essential purpose of radar is to detect a target of interest and provide information concerning the target’s location,motion,size,and other parameters.The knowledge about the pulse trains’properties shows that a class of signals is mainly well suited to digital processing of increasing practical importance.A low autocorrelation binary sequence(LABS)is a complex combinatorial problem.The main problems of LABS are low Merit Factor(MF)and shorter length sequences.Besides,the maximum possible MF equals 12.3248 as infinity length is unable to be achieved.Therefore,this study implemented two techniques to propose a new metaheuristic algorithm based on Hybrid Modified Sine Cosine Algorithm with Cuckoo Search Algorithm(HMSCACSA)using Inverse Filtering(IF)and clipping method to achieve better results.The proposed algorithms,LABS-IF and HMSCACSA-IF,achieved better results with two large MFs equal to 12.12 and 12.6678 for lengths 231 and 237,respectively,where the optimal solutions belong to the skew-symmetric sequences.The MF outperformed up to 24.335%and 2.708%against the state-of-the-art LABS heuristic algorithm,xLastovka,and Golay,respectively.These results indicated that the proposed algorithm’s simulation had quality solutions in terms of fast convergence curve with better optimal means,and standard deviation.
基金National Natural Science Foundation of China(Grant No.51875454).
文摘Golden eagle optimizer(GEO)is a recently introduced nature-inspired metaheuristic algorithm,which simulates the spiral hunting behavior of golden eagles in nature.Regrettably,the GEO suffers from the challenges of low diversity,slow iteration speed,and stagnation in local optimization when dealing with complicated optimization problems.To ameliorate these deficiencies,an improved hybrid GEO called IGEO,combined with Lévy flight,sine cosine algorithm and differential evolution(DE)strategy,is developed in this paper.The Lévy flight strategy is introduced into the initial stage to increase the diversity of the golden eagle population and make the initial population more abundant;meanwhile,the sine-cosine function can enhance the exploration ability of GEO and decrease the possibility of GEO falling into the local optima.Furthermore,the DE strategy is used in the exploration and exploitation stage to improve accuracy and convergence speed of GEO.Finally,the superiority of the presented IGEO are comprehensively verified by comparing GEO and several state-of-the-art algorithms using(1)the CEC 2017 and CEC 2019 benchmark functions and(2)5 real-world engineering problems respectively.The comparison results demonstrate that the proposed IGEO is a powerful and attractive alternative for solving engineering optimization problems.
文摘电鳗觅食优化算法EEFO(Electric Eel Foraging Optimization)在迭代过程中会出现全局探索能力不足、容易陷入局部最优和收敛速度慢的问题。同时,算法的性能受到参数设置的影响,需要仔细调整和优化。对此,提出了一种多策略改进的电鳗觅食优化算法(IEEFO)。首先,调整能量因子策略,引入了双曲正切能量因子,使算法在迭代过程中提前加入开发行为,从而快速发现最优种群,加快收敛速度;之后,改进扰动因子,扩大电鳗游走的位置范围,有利于种群的全局寻优;然后,在迁徙阶段加入正弦余弦策略,促进算法的局部开发;最后,在每次迭代之后,加入透镜成像反向学习的策略来扩大搜索空间,使得算法跳出局部最优并加速收敛到全局最优解。将IEEFO分别与6种基本算法、4种单策略改进的电鳗觅食优化算法进行对比,对13个基准函数进行仿真实验,对IEEFO算法进行性能评估。实验结果表明,IEEFO相比于对比算法收敛速度更快,全局寻优能力更强,算法总体性能有显著提升。此外,通过一个机械优化设计实验进行测试分析,进一步验证了IEEFO的有效性和适用性。
