Improved harris hawks optimization algorithm based on random unscented sigma point mutation strategy

2021 ◽  
pp. 108012
Author(s):  
Wenyan Guo ◽  
Peng Xu ◽  
Fang Dai ◽  
Fengqun Zhao ◽  
Mingfei Wu
2014 ◽  
Vol 1049-1050 ◽  
pp. 1690-1693 ◽  
Author(s):  
Juan Li

The traditional evolutionary algorithm is cannot converge faster to solve the path optimization problems, and the path that is computed is not the shortest path, in allusion to the disadvantage of this algorithm, a mutation particle swarm optimization algorithm is proposed. The algorithm introduces the adaptive mutation strategy, and accelerated the speed to search for the global optimal solution. For seven examples experiment in standard database, the result shows that the algorithm is more efficient..


Author(s):  
Lei Ma ◽  
Chao Wang ◽  
Neng-gang Xie ◽  
Miao Shi ◽  
Ye Ye ◽  
...  

Author(s):  
Weiwei Yu ◽  
Li Zhang ◽  
Chengwang Xie

Many-objective optimization problems (MaOPs) refer to those multi-objective problems (MOPs) withmore than three objectives. In order to solve MaOPs, a multi-objective particle swarm optimization algorithm based on new fitness assignment and multi cooperation strategy(FAMSHMPSO) is proposed. Firstly, this paper proposes a new fitness allocation method based on fuzzy information theory to enhance the convergence of the algorithm. Then a new multi criteria mutation strategy is introduced to disturb the population and improve the diversity of the algorithm. Finally, the external files are maintained by the three-point shortest path method, which improves the quality of the solution. The performance of FAMSHMPSO algorithm is evaluated by evaluating the mean value, standard deviation and IGD+ index of the target value on dtlz test function set of different targets of FAMSHMPSO algorithm and other five representative multi-objective evolutionary algorithms. The experimental results show that FAMSHMPSO algorithm has obvious performance advantages in convergence, diversity and robustness.


2010 ◽  
Vol 44-47 ◽  
pp. 3937-3941
Author(s):  
Zhong Yong Wu ◽  
Jin Gou ◽  
Chang Cai Cui

Minimum zone circle (MZC), minimum circumscribed circle (MCC), maximum inscribed circle (MIC) and least square circle (LSC) are four common methods used to evaluate circularity errors. A novel particle swarm optimization algorithm based on self-adapted comprehensive learning (ACL-PSO) is proposed to evaluate circularity errors with real coded strategy. In the algorithm, population learning mechanism and velocity mutation strategy are adopted. In the meantime, ACL-PSO is applied to the unified evaluation of circularity error. The experiment results evaluated by different methods indicate that the proposed algorithm not only converges to the global optimum rapidly, but also has good stability, and it is easy to generalize.


Sign in / Sign up

Export Citation Format

Share Document