| 改进粒子群优化算法求解TSP问题 |
| |
| 引用本文： | 苏晋荣,王建珍. 改进粒子群优化算法求解TSP问题[J]. 计算机工程与应用, 2010, 46(4): 52-53. DOI: 10.3778/j.issn.1002-8331.2010.04.016 |
| |
| 作者姓名： | 苏晋荣 王建珍 |
| |
| 作者单位： | 山西大学 商务学院 信息工程系，太原 030031 |
| |
| 基金项目： | 山西省自然科学基金No.20101135~~ |
| |
| 摘 要： | 针对粒子群优化算法易陷入局部极值的缺点，提出一种改进粒子群算法，该算法借鉴贪婪算法的思想初始化种群，利用两个种群同时寻优，并将遗传算法中交叉和变异操作引入其中，实现种群间的信息共享。用14点TSP标准数据对算法性能进行了测试，结果表明该算法能够较早跳出局部最优，具有较高的收敛速度和收敛率。
|
| 关 键 词： | 粒子群优化算法 旅行商问题 贪婪算法 交叉 变异 |
| 收稿时间： | 2009-09-07 |
| 修稿时间： | 2009-11-18 |
Improved particle swarm optimization for traveling salesman problem |
| |
| SU Jin-rong,WANG Jian-zhen. Improved particle swarm optimization for traveling salesman problem[J]. Computer Engineering and Applications, 2010, 46(4): 52-53. DOI: 10.3778/j.issn.1002-8331.2010.04.016 |
| |
| Authors: | SU Jin-rong WANG Jian-zhen |
| |
| Affiliation: | Department of Information Engineering，College of Business，Shanxi University，Taiyuan 030031，China |
| |
| Abstract: | In allusion to particle swarm optimization being prone to get into local minimum,an improved particle swarm optimization algorithm is proposed.The algorithm draws on the thinking of the greedy algorithm to initialize the particle swarm. Two swarms are used to optimize synchronously,and crossover and mutation operators in genetic algorithm are introduced into the new algorithm to realize the sharing of information among swarms.This paper tests the algorithm with a Traveling Salesman Problem with 14 nodes.The... |
| |
| Keywords: | Particle Swarm Optimization(PSO) Traveling Salesman Problem(TSP) greedy algorithm crossover mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
