| 全局最优位置变异粒子群优化算法 |
| |
| 引用本文： | 王海峰,;刘晶晶.全局最优位置变异粒子群优化算法[J].青岛建筑工程学院学报,2009(5):93-97. |
| |
| 作者姓名： | 王海峰 ;刘晶晶 |
| |
| 作者单位： | [1]中国农业发展银行青岛市分行,青岛266071; [2]潍坊科技学院经济管理学院,潍坊262700 |
| |
| 摘 要： | 针对粒子群优化算法的早熟收敛,容易陷入局部最优且搜索精度不高等缺点,在现有的粒子群优化算法的基础上对其进行了若干改进,提出了避免微粒群陷入局部最优的全局最优位置变异的粒子群算法,并与其他算法做了比较,体现了其优越性.
|
| 关 键 词： | 粒子群算法 优化 变异算子 |
The Particle Swarm Optimization Algorithm of Global Optimum Location Mutation |
| |
| Affiliation: | WANG Hai-feng, LIU Jing-jing (1. Qingdao Branch of Agricultural Development Bank of China,Qingdao 266071, China; 2. Economics and Management Department, Weifang University of Science and Technology, Weifang 262700, China) |
| |
| Abstract: | In order to overcome some disadvantages of PSO such as being easily trapped in the local optimum, easily being premature and having bad local search capability, this paper puts forward some relevant strategies on the basis of the current PSO. In order to avoid being trapped in the local optimum, a new global optimum location mutation PSO algorithm is proposed. It has priority over the other algorithms. |
| |
| Keywords: | PSO optimize mutation operator |
| 本文献已被 维普 等数据库收录！ |
|
