| 改进微粒群优化算法求解旅行商问题 |
| |
| 引用本文： | 肖健梅,李军军,王锡淮.改进微粒群优化算法求解旅行商问题[J].计算机工程与应用,2004,40(35):50-52. |
| |
| 作者姓名： | 肖健梅 李军军 王锡淮 |
| |
| 作者单位： | 上海海运学院,上海,200135 |
| |
| 基金项目： | 国家自然科学基金(编号:60074004)，上海市教育委员会科研项目(编号:03IK09) |
| |
| 摘 要： | 对微粒群优化算法的速度位置算式进行了改进,提出一种改进的微粒群优化算法。该算法符合组合优化问题的特点,在求解旅行商问题上有较高的搜索效率。将改进的PSO算法分别应用于14点的TSP问题以及中国旅行商问题中,该算法在较短时间内获得了目前已知的最好解。
|
| 关 键 词： | 微粒群优化算法 组合优化 旅行商问题 |
| 文章编号： | 1002-8331-(2004)35-0050-03 |
A Modified Particle Swarm Optimization for Traveling Salesman Problems |
| |
| Xiao Jianmei Li,Junjun Wang Xihuai.A Modified Particle Swarm Optimization for Traveling Salesman Problems[J].Computer Engineering and Applications,2004,40(35):50-52. |
| |
| Authors: | Xiao Jianmei Li Junjun Wang Xihuai |
| |
| Abstract: | A modified particle swarm optimization algorithm is proposed after modifying the velocity and position equations of the particle swarm optimization algorithm.This algorithm agrees with the character of the combinatorial optimization problem,so it has higher efficiency of search.This algorithm is practised to a Traveling Salesman Problem with14nodes and Chinese Traveling Salesman Problem,and obtains the best known results in the world. |
| |
| Keywords: | particle swarm optimization combinatorial optimization traveling salesman problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
