| 基于禁忌搜索的混合粒子群优化算法 |
| |
| 引用本文： | 满春涛,王昆,张礼勇.基于禁忌搜索的混合粒子群优化算法[J].哈尔滨理工大学学报,2009,14(4):5-8. |
| |
| 作者姓名： | 满春涛 王昆 张礼勇 |
| |
| 作者单位： | 1. 哈尔滨理工大学,自动化学院,黑龙江,哈尔滨,150080
2. 哈尔滨理工大学,测控技术与通信工程学院,黑龙江,哈尔滨,150040 |
| |
| 基金项目： | 黑龙江省自然科学基金项目 |
| |
| 摘 要： | 针对粒子群优化算法（PSO）易于陷入局部最优解并存在早熟收敛的问题，利用禁忌搜索算法较强的“爬山”能力，搜索时能够跳出局部最优解，转向解空间的其他区域的特点，提出了一种新的基于禁忌搜索（TS）的混合粒子群优化算法（TS—PSO），并选用两个函数进行测试．结果表明，TS—PSO比其他改进粒子群算法更能提高收敛速度，获得全局最优解．
|
| 关 键 词： | 粒子群优化算法 局部最优解 禁忌搜索 禁忌粒子群优化算法 全局最优解 |
A Hybrid Particle Swarm Optimization Algorithm Based On TS |
| |
| MAN Chun-tao,WANG Kun,ZHANG Li-yong.A Hybrid Particle Swarm Optimization Algorithm Based On TS[J].Journal of Harbin University of Science and Technology,2009,14(4):5-8. |
| |
| Authors: | MAN Chun-tao WANG Kun ZHANG Li-yong |
| |
| Affiliation: | MAN Chun-tao1,WANG Kun1,ZHANG Li-yong2 (1.School of Automation,Harbin University of Science and Technology,Harbin 150080,China,2.School of Measure-control Technology and Communications Engineering,Harbin 150040,China) |
| |
| Abstract: | PSO algorithm will get struck at local optimal solution easily and exist premature convergence.TS algorithm has good hill-climbing ability.It can escape from the local optimal solution and turn to other solution space.A hybrid PSO algorithm based on TS is proposed.The experimental results of two test functions have shown that the TS-PSO has faster convergence velocity and better globe optimal solution. |
| |
| Keywords: | PSO algorithm local optimal solution tabu-search TS-PSO algorithm better globe optimal solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
