用自适应离散微粒群算法求解旅行商问题  

Study on Solving TSP Problem by Using Adaptive Discrete Particle Swarm Optimization

作　　者：何静[1] 刘跃华[1] 周伟林[1] 

机构地区：[1]湖南商学院计算机与电子工程学院,湖南长沙410205

出　　处：《计算技术与自动化》2012年第1期82-85,共4页Computing Technology and Automation

基　　金：湖南省教育厅科研项目(11C0745);湖南省社科基金项目(11YBB229)

摘　　要：提出一种求解GTSP问题的自适应离散PSO算法,同时考虑到多种算法的混合,利用调节算子和交换序对PSO算法进行改进.通过对Buramal14,Oliver30和Eil51等测试数据进行实验,证明新算法不仅收敛速度快、鲁棒性更好,而且新的算法对于Burma14和Oliver30更易求得它们的最优解。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.

关 键 词：微粒群优化 自适应 旅行商问题 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]