An Improved Discrete Firefly Algorithm Used for Traveling Salesman Problem

被引：4
|
作者：
Jie, Liu [1 ]
Teng, Lin [1 ]
Yin, Shoulin [1 ]
机构：
[1] Shenyang Normal Univ, Software Coll, 253 HuangHe Bei St, Shenyang 110034, Liaoning, Peoples R China
来源：
ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT I | 2017年 / 10385卷
关键词：
Firefly algorithm; Traveling salesman problem; Swap operator; Swap sequence; Neighborhood search algorithm;
D O I：
10.1007/978-3-319-61824-1_64
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we propose a novel method based on discrete firefly algorithm for traveling salesman problem. We redefine the distance of firefly algorithm by introducing swap operator and swap sequence to avoid algorithm easily falling into local solution and accelerate convergence speed. In addition, we adopt dynamic mechanism based on neighborhood search algorithm. Finally, the comparison experiment results show that the novel algorithm can search perfect solution within a short time, and greatly improve the effectiveness of solving the traveling salesman problem.
引用
收藏
页码：593 / 600
页数：8
相关论文
共 50 条
  • [1] An Improved Discrete Firefly Algorithm for the Traveling Salesman Problem
    Zhou, Lingyun
    Ding, Lixin
    Qiang, Xiaoli
    Luo, Yihan
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1184 - 1189
  • [2] A New Hybrid Discrete Firefly Algorithm for Solving the Traveling Salesman Problem
    Mohsen, Abdulqader M.
    Al-Sorori, Wedad
    [J]. APPLIED COMPUTING AND INFORMATION TECHNOLOGY, 2017, 695 : 169 - 180
  • [3] An improved firefly algorithm for traveling salesman problems
    Wang Ming-bo
    Fu Qiang
    Tong Nan
    Li Mengmeng
    Zhao Yiming
    [J]. PROCEEDINGS OF THE 2015 4TH NATIONAL CONFERENCE ON ELECTRICAL, ELECTRONICS AND COMPUTER ENGINEERING ( NCEECE 2015), 2016, 47 : 1085 - 1092
  • [4] Firefly Algorithm Solving Multiple Traveling Salesman Problem
    Li, Mingfu
    Ma, Jianhua
    Zhang, Yuyan
    Zhou, Houming
    Liu, Jingang
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (07) : 1277 - 1281
  • [5] Improved Discrete Bacterial Memetic Evolutionary Algorithm for the Traveling Salesman Problem
    Tuu-Szabo, Boldizsar
    Foldesi, Peter
    Koczy, Laszlo T.
    [J]. COMPUTATIONAL INTELLIGENCE IN INFORMATION SYSTEMS, CIIS 2016, 2017, 532 : 27 - 38
  • [6] Discrete komodo algorithm for traveling salesman problem
    Jati, Gilang Kusuma
    Kuwanto, Garry
    Hashmi, Tahir
    Widjaja, Herman
    [J]. APPLIED SOFT COMPUTING, 2023, 139
  • [7] Discrete Bat Algorithm for Traveling Salesman Problem
    Jiang, Zhao
    [J]. 2016 3RD INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND CONTROL ENGINEERING (ICISCE), 2016, : 343 - 347
  • [8] Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem
    Jati, Gilang Kusuma
    Suyanto
    [J]. ADAPTIVE AND INTELLIGENT SYSTEMS, 2011, 6943 : 393 - 403
  • [9] An Improved Hybrid Algorithm for Traveling Salesman Problem
    Bai, Qiuying
    Li, Guizhi
    Sun, Qiheng
    [J]. 2015 8TH INTERNATIONAL CONFERENCE ON BIOMEDICAL ENGINEERING AND INFORMATICS (BMEI), 2015, : 806 - 809
  • [10] An improved genetic algorithm for the traveling salesman problem
    Li, Lijie
    Zhang, Ying
    [J]. ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 208 - +
12345