首页 | 本学科首页   官方微博 | 高级检索  
     

求解TSP问题的模糊自适应粒子群算法
引用本文:郭文忠,陈国龙.求解TSP问题的模糊自适应粒子群算法[J].计算机科学,2006,33(6):161-162.
作者姓名:郭文忠  陈国龙
作者单位:福州大学数学与计算机科学学院,福州350002
基金项目:福建省自然科学基金;福建省科技三项费资助项目;福建省教育厅科研项目
摘    要:由于惯性权值的设置对粒子群优化(PSO)算法性能起着关键的作用,本文通过引入模糊技术,给出了一种惯性权值的模糊自适应调整模型及其相应的粒子群优化算法,并用于求解旅行商(TSP)问题。实验结果表明了改进算法在求解组合优化问题中的有效性,同时提高了算法的性能,并具有更快的收敛速度。

关 键 词:粒子群优化算法  旅行商问题  组合优化

Fuzzy Self-Adapted Particle Swarm Optimization Algorithm for Traveling Salesman Problems
GUO Wen-Zhong,CHEN Guo-Long.Fuzzy Self-Adapted Particle Swarm Optimization Algorithm for Traveling Salesman Problems[J].Computer Science,2006,33(6):161-162.
Authors:GUO Wen-Zhong  CHEN Guo-Long
Affiliation:Institute of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002
Abstract:The Particle swarm optimization(PSO)is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. The setting of inertia weight plays a key role in the performance of PSO, so many presented improved PSO algorithms based inertia weight were advanced. Based on fuzzy technology, a new fuzzy self-adapted model of inertia weight and corresponding PSO are proposed in the paper, then this paper proposes its application to traveling salesman problems(TSP). In the new PSO, different inertia weights are used in updating the particle swarm in a same generation. The experiments show that the new PSO algorithm can achieve good results. Compared with the linearly decreasing inertia weight PSO, the new algorithm also improves the performance of PSO and speeds up the velocity of the PSO convergence.
Keywords:Particle swarm optimization(PSO)  Traveling salesman problem  Combinatorial optimization  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号