| 用自适应离散微粒群算法求解旅行商问题 |
 点此下载全文 |
| 引用本文：何静，刘跃华，周伟林.用自适应离散微粒群算法求解旅行商问题[J].计算技术与自动化,2012,(1):82-85 |
| 摘要点击次数: 1604 |
| 全文下载次数: 150 |
|
|
| 中文摘要:提出一种求解GTSP问题的自适应离散PSO算法，同时考虑到多种算法的混合，利用调节算子和交换序对PSO算法进行改进.通过对Buramal14，Oliver30和Eil51等测试数据进行实验，证明新算法不仅收敛速度快、鲁棒性更好，而且新的算法对于Burma14和Oliver30更易求得它们的最优解。 |
| 中文关键词:微粒群优化 自适应 旅行商问题 |
| |
| Study on Solving TSP Problem by Using Adaptive Discrete Particle Swarm Optimization |
|
|
| Abstract:An adaptive discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP).New concepts of adjustment operator and adjustment sequence were proposed to rebuild PSO algorithm. In addition， improvement was done in considering the influence of individual’s cooperation. This algorithm is applied to Buramal14，Oliver30 and Eil51，numerical results show that the APSO algorithm not only converges quickly but also has a high robustness. It has a high probability to find the optimal solution for burma114 and Oliver30. |
| keywords:particle swarm optimization adaptive traveling salesman problem |
| 查看全文 查看/发表评论 下载pdf阅读器 |
次