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

新型混沌粒子群算法在TSP中的应用
引用本文:李九永,王京.新型混沌粒子群算法在TSP中的应用[J].武汉科技大学学报(自然科学版),2011,34(2).
作者姓名:李九永  王京
作者单位:北京科技大学冶金工程研究院,北京,100083
摘    要:针对旅行商问题,提出一种结合混沌优化和粒子群算法的新型混沌离散粒子群方法(CIPSO)。新算法根据此类组合优化问题解的固有地形特征,利用混沌运动的遍历性、随机性等特点进行求解,其基本思想是在求解过程中对粒子进行混沌扰动避免陷入局部最优,并引入群体间粒子的交叉作用来提高寻优效率。通过与遗传算法、蚁群算法和模拟退火算法等比较以及不同TSP问题的仿真实验发现,该方法是一种能进行有效优化的新方法。

关 键 词:粒子群算法  旅行商问题  混沌理论  信息交流策略  

Use of new chaotic particle swarm algorithm in traveling salesman problem
Li Jiuyong,Wang Jing.Use of new chaotic particle swarm algorithm in traveling salesman problem[J].Journal of Wuhan University of Science and Technology(Natural Science Edition),2011,34(2).
Authors:Li Jiuyong  Wang Jing
Institution:Li Jiuyong,Wang Jing (Academy of Metallurgical Engineering,University of Science and Technology Beijing,Beijing 100083,China)
Abstract:In this paper,a novel algorithm called CIPSO for short based on particle swarm optimization(PSO) algorithm and chaos optimization algorithm(COA) is presented to solve traveling salesman problem(TSP).Some new operators are proposed to overcome difficulties of implementing PSO and solve the discrete problem on the basis of the special fitness landscape of TSP.Embedded with chaos theory,the proposed algorithm can enhance particles' global searching ability so as to avoid too quick convergence to the local opti...
Keywords:PSO  TSP  chaos theory  information intercourse strategy  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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