模糊离散粒子群优化算法求解旅行商问题  

Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem

作　　者：庞巍[1] 王康平[1] 周春光[1] 黄岚[1] 季晓辉[1] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012

出　　处：《小型微型计算机系统》2005年第8期1331-1334,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金(60175024)资助;教育部符号计算与知识工程重点实验室资助.

摘　　要：粒子群优化算法已经成功地应用于求解连续域问题,但是对于离散域问题特别是路由问题的求解研究还很少.本文提出了一种改进的粒子群优化算法,用于求解旅行商问题.采用模糊矩阵来表示粒子的位置和速度,并重新定义其更新公式,最后对TSPLIB中的具体算例进行测试,实验结果表明该算法能够得到较好的结果.Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization （PSO） algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.

关 键 词：粒子群优化算法 旅行商问题 模糊矩阵 

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