计算机与现代化 ›› 2011, Vol. 1 ›› Issue (4): 1-3.doi: 10.3969/j.issn.100612475.2011.04.001
• 算法设计与分析 • 下一篇
叶安新
收稿日期:
修回日期:
出版日期:
发布日期:
YE An-xin
Received:
Revised:
Online:
Published:
摘要： 针对标准粒子群优化算法易出现问题，提出一种改进粒子群算法。该算法为不同的粒子分配不同的任务，对性能较好的粒子使用较小的惯性权重，对性能较差的粒子采用较大的惯性权重，惯性权重根据适应度函数自适应调整，更好地平衡算法的全局与局部搜索能力，提高算法的多样性与搜索效率。用14点TSP 标准数据对算法性能进行测试，结果表明该算法能够较早跳出局部最优，具有较高的收敛速度和收敛率。
关键词: 粒子群优化算法, 旅行商问题, 惯性权重, 早熟收敛
Abstract: To overcome premature searching by standard Particle Swarm Optimization(PSO) algorithm, an improved particle swarm optimization algorithm is proposed. In the new algorithm, different particles are assigned specific tasks. Better particles are given smaller inertial weights, while worse ones are given larger inertial weights. And the particle’s inertial weights are adaptively adjusted according to its fitness function. These strategies improve the PSO algorithm at the aspects of diversity and the balance of exploration and exploitation. This paper tests the algorithm with a Traveling Salesman Problem with 14 nodes. The result shows that the algorithm can break away from local minimum earlier and it has high convergence speed and convergence ratio.
Key words: Particle Swarm Optimization(PSO), Traveling Salesman Problem(TSP), inertia weight, premature convergence
中图分类号:
TP301.6
叶安新. 基于改进粒子群优化算法的TSP问题研究[J]. 计算机与现代化, 2011, 1(4): 1-3.
YE An-xin. Research on Traveling Salesman Problem Based onImproved Particle Swarm Optimization Algorithm[J]. Computer and Modernization, 2011, 1(4): 1-3.
0 / / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://www.c-a-m.org.cn/CN/10.3969/j.issn.100612475.2011.04.001
http://www.c-a-m.org.cn/CN/Y2011/V1/I4/1
