A Hybrid Particle Swarm Optimization Algorithm Based on TS
|更新时间:2026-07-10
|
A Hybrid Particle Swarm Optimization Algorithm Based on TS
Vol. 14, Issue 4, Pages: 5-8(2009)
作者机构:
1. 哈尔滨理工大学自动化学院
2. 哈尔滨理工大学测控技术与通信工程学院
作者简介:
基金信息:
DOI:
CLC:TP301.6
Published:2009
稿件说明:
移动端阅览
MAN Chun-tao, WANG Kun, ZHANG Li-yong. A Hybrid Particle Swarm Optimization Algorithm Based on TS[J]. 2009, 14(4): 5-8.
DOI:
MAN Chun-tao, WANG Kun, ZHANG Li-yong. A Hybrid Particle Swarm Optimization Algorithm Based on TS[J]. 2009, 14(4): 5-8.DOI:
A Hybrid Particle Swarm Optimization Algorithm Based on TS
摘要
针对粒子群优化算法(PSO)易于陷入局部最优解并存在早熟收敛的问题
利用禁忌搜索算法较强的"爬山"能力
搜索时能够跳出局部最优解
转向解空间的其他区域的特点
提出了一种新的基于禁忌搜索(TS)的混合粒子群优化算法(TS-PSO)
并选用两个函数进行测试.结果表明
TS-PSO比其他改进粒子群算法更能提高收敛速度
获得全局最优解.
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.