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

求解旅行商问题的混合粒子群优化算法
引用本文:沈继红,王侃. 求解旅行商问题的混合粒子群优化算法[J]. 智能系统学报, 2012, 7(2): 174-182
作者姓名:沈继红  王侃
作者单位:1. 哈尔滨工程大学理学院,黑龙江哈尔滨,150001
2. 哈尔滨工程大学自动化学院,黑龙江哈尔滨,150001
基金项目:黑龙江省自然科学基金资助项目(F200931)
摘    要:为高效解决旅行商问题,结合光学寻优算法、混沌优化算法、粒子群优化算法,提出了一种新的混合智能优化算法,应用光学寻优算法的优点,为粒子群中粒子找到了一组最优的初始值,引入交换子、交换序列、混沌序列,提出了适合旅行商问题的光学混沌粒子群算——并严格证明了新算法的稳定性、收敛性.数值实验仿真结果表明,该算法收敛速度快、迭代次数少,能快速找到令人满意的最优解,为解决旅行商问题提供了新的思路.

关 键 词:旅行商问题  混沌优化算法  费马原理  粒子群算法  光学寻优算法

The light ray particle swarm optimization for solving the traveling salesman problem
SHEN Jihong , WANG Kan. The light ray particle swarm optimization for solving the traveling salesman problem[J]. CAAL Transactions on Intelligent Systems, 2012, 7(2): 174-182
Authors:SHEN Jihong    WANG Kan
Affiliation:1.College of Science,Harbin Engineering University,Harbin 150001,China;2.College of Automation,Harbin Engineering University,Harbin 150001,China)
Abstract:A new hybrid intelligent optimization was given to solve the traveling salesman problem(TSP) by introducing the thought of an LRO algorithm,chaos optimization algorithm,and particle swarm optimization(PSO).A group of optimal initial values were found by using the features of LRO.Next,by employing the method of discrete chaotic particle swarm optimization and introducing the swap operator,swap sequence,and chaos sequence,an optical chaos PSO adaptive for the TSP problem was proposed.The stability and convergence of the optimization was proved decisively.The numerical simulation results show that this new optimization method has a good convergence rate and less iterative steps,thus allowing a satisfactory solution to be found rapidly.The method provides a new inspiration for solving the TSP problem.
Keywords:travel salesman problem  chaos optimization algorithm  Ferma’s principle  particle swarm optimization  light ray optimization
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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