Computer Science ›› 2019, Vol. 46 ›› Issue (6A): 85-88.

• Intelligent Computing • Previous Articles     Next Articles

Chaotic Fireworks Algorithm for Solving Travelling Salesman Problem

CAI Yan-guang1, CHEN Hou-ren1, QI Yuan-hang2   

  1. School of Automation,Guangdong University of Technology,Guangzhou 510006,China1;
    Zhongshan Institute,University of Electronic Science and Technology of China,Zhongshan,Guangdong 528402,China2
  • Online:2019-06-14 Published:2019-07-02

Abstract: Travelling salesman problem (TSP) is a classic combinatorial optimization problem,which is a typical NP hard problem and has important research value.This paper presented a chaotic fireworks algorithm to solve the TSP problem.The algorithm uses LOV to define the discrete domain and adds chaos optimization strategy to enhance search capability of the algorithm.In this paper,four parametric experiments were designed to analyze the influence of the main parameters on CFWA and determine the optimal parameter setting.The comparison experiment shows that the chaotic fireworks algorithm has better convergence and stability than the comparison algorithm.

Key words: Chaotic searching, Fireworks algorithm, Largest order value, Parameter analysis, Travelling salesman problem

CLC Number: 

  • TP301
[1]孙惠文.遗传算法求解旅行商问题[J].西南交通大学学报,1996,31(5):550-554.
[2]高海昌,冯博琴,朱利.智能优化算法求解TSP问题[J].控制与决策,2006,21(3):241-247.
[3]周永权,黄正新,刘洪霞.求解TSP问题的离散型萤火虫群优化算法[J].电子学报,2012,40(6):1164-1170.
[4]张涛,王梦光.遗传算法和3-opt结合求解带有能力约束的VRP[J].东北大学学报(自然科学版),1999,20(3):254-256.
[5]LIN S,KERNIGHAN B W.An Effective Heuristic Algorithm for the Traveling-Salesman Problem[M].INFORMS,1973.
[6]孟繁桢,胡云昌,徐慧,等.旅行商问题的遗传算法[J].系统工程理论与实践,1997,17(9):15-21.
[7]程毕芸,鲁海燕,徐向平,等.求解旅行商问题的改进局部搜索混沌离散粒子群优化算法[J].计算机应用,2016,36(1):138-142.
[8]李擎,张超,陈鹏,等.一种基于粒子群参数优化的改进蚁群算法[J].控制与决策,2013(6):873-878.
[9]戚远航,蔡延光,蔡颢,等.旅行商问题的混沌混合离散蝙蝠算法[J].电子学报,2016,44(10):2543-2547.
[10]吴华锋,陈信强,毛奇凰,等.基于自然选择策略的蚁群算法求解TSP问题[J].通信学报,2013(4):165-170.
[11]冯春松,王军宇,周松盛,等.TSP问题的一种改进遗传算法[J].武汉理工大学学报,2006,28(4):116-118.
[12]高尚,韩斌,吴小俊,等.求解旅行商问题的混合粒子群优化算法[J].控制与决策,2004,19(11):1286-1289.
[13]谭营,郑少秋.烟花算法研究进展[J].智能系统学报,2014(5):515-528.
[14]朱启兵,王震宇,黄敏.带有引力搜索算子的烟花算法[J].控制与决策,2016,31(10):1853-1859.
[15]韩守飞,李席广,拱长青.基于模拟退火与高斯扰动的烟花优化算法[J].计算机科学,2017,44(5):257-262.
[16]张以文,吴金涛,赵姝,等.基于改进烟花算法的Web服务组合优化[J].计算机集成制造系统,2016,22(2):422-432.
[17]QIAN B,WANG L,HUANG D X,et al.An effective hybrid DE-based algorithm for flow shop scheduling with limited buf-fers[J].Computers & Operations Research,2008,35(9):2791-2806.
[18]ZHENG S,JANECEK A,LI J,et al.Dynamic search in fireworks algorithm[C]∥Evolutionary Computation.IEEE,2014:3222-3229.
[19]曹磊,叶春明,黄霞.应用混沌烟花算法求解置换流水车间问题[J].计算机应用与软件,2016,33(11):188-192.
[20]包晓晓,叶春明,黄霞.烟花算法求解JSP问题的研究[J].计算机工程与应用,2017,53(3):247-252.
[21]高尚.解旅行商问题的混沌蚁群算法[J].系统工程理论与实践,2005,25(9):100-104.
[22]江新姿,高尚,陈建忠.求解旅行商问题的模拟退火蚁群算法[J].计算机工程与设计,2008,29(6):1491-1493.
[23]WANG K P,HUANG L,ZHOU C G,et al.Particle swarm optimization for traveling salesman problem[C]∥International Conference on Machine Learning and Cybernetics.IEEE,2003:1583-1585.
[24]朱小平,赵曦.一种改进的离散粒子群优化算法在TSP问题中的应用[J].江西师范大学学报(自然版),2010,34(4):369-373.
[1] HAN Shou-fei, LI Xi-guang and GONG Chang-qing. Fireworks Optimization Algorithm Based on Simulated Annealing and Gaussian Perturbations [J]. Computer Science, 2017, 44(5): 257-262.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!