| 一种求解TSP问题的粒子群算法改进设计 |
| |
| 引用本文： | 双娜. 一种求解TSP问题的粒子群算法改进设计[J]. 计算机时代, 2009, 0(7): 38-40 |
| |
| 作者姓名： | 双娜 |
| |
| 作者单位： | 东华理工大学信息与电子工程学院,江西,抚州,344000 |
| |
| 摘 要： | 采用权重编码方案，将面向连续优化的粒子群优化算法应用于旅行商问题的求解，保留了粒子群算法的易操作性和高效性。针对粒子群算法易陷入局部最优的缺陷，提出了适合旅行商问题的基于k-means的改进措施。采用k-means对粒子群进行聚类分析，实现了粒子之间的信息交换，扩大了粒子的搜索空间，避免了算法陷入局部最优。
|
| 关 键 词： | 旅行商问题 粒子群优化算法 权重编码方案 k-means |
An Improved Design of Particle Swarm Optimization to Solve the Traveling Salesman Problem |
| |
| SHUANG Na. An Improved Design of Particle Swarm Optimization to Solve the Traveling Salesman Problem[J]. Computer Era, 2009, 0(7): 38-40 |
| |
| Authors: | SHUANG Na |
| |
| Affiliation: | College of Information & Electronics Engineering;East China Institute of Technology;Fuzhou;Jiangxi 344000;China |
| |
| Abstract: | This paper uses a new coding method based on the priority to apply Particle Swarm Optimization(PSO) algorithm oriented to continuous optimization problems in solving Traveling Salesman Problem(TSP).And the easy operation and high efficiency of the PSO are reserved.Then an innovative approach based on k-means algorithm is proposed with purpose of preventing PSO algorithm from local optimization.The k-means algorithm is used to execute cluster analysis on the particle swarm,which make particles exchange infor... |
| |
| Keywords: | traveling salesman problem particle swarm optimization algorithm coding method based on the priority k-means |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
