| 粒子群算法求解旅行商问题程序设计 |
| |
| 引用本文： | 张江维,司文建. 粒子群算法求解旅行商问题程序设计[J]. 数字社区&智能家居, 2009, 0(7) |
| |
| 作者姓名： | 张江维 司文建 |
| |
| 作者单位： | 许昌学院计算机科学与技术学院; |
| |
| 基金项目： | 河南省教育厅自然科学研究计划项目(2008B520032) |
| |
| 摘 要： | 粒子群优化算法是一种具备全局搜索能力的群集智能优化算法,针对一类离散的、NP完全的组合优化问题——旅行商问题,该文介绍了用粒子群算法求解旅行商问题的改进策略和主要模块的程序设计思想。将算法应用到20个城市的解旅行商问题所得到的结果与遗传算法进行比较,数字仿真与结果比较表明了改进粒子群算法求解该问题的有效性。
|
| 关 键 词： | 粒子群算法 组合优化 旅行商问题 程序设计 |
Particle Swarm Optimization Algorithm for Traveling Salesman Problem Program Design |
| |
| ZHANG Jiang-wei,SI Wen-jian. Particle Swarm Optimization Algorithm for Traveling Salesman Problem Program Design[J]. Digital Community & Smart Home, 2009, 0(7) |
| |
| Authors: | ZHANG Jiang-wei SI Wen-jian |
| |
| Affiliation: | School of Computer Science and Technology;Xuchang University;Xuchang 461000;China |
| |
| Abstract: | Particle swarm optimization algorithm with the global searching abilities is one of the swarm intelligence algorithms.For solving the traveling salesman problem(TSP) that is one of the discrete and NP-complete combinatorial optimization problems,the paper intro-duced two improved methods and the ideas of the main program designing.Comparing with genetic algorithm for the 20 city numbers TSP problem,the experiment results show the effectiveness and efficiency of the proposed method. |
| |
| Keywords: | IPSO combinatorial optimization traveling salesman problem program design |
| 本文献已被 CNKI 等数据库收录！ |
