Firefly Algorithm Solving Multiple Traveling Salesman Problem

被引：9
|
作者：
Li, Mingfu [1 ,2 ]
Ma, Jianhua [1 ]
Zhang, Yuyan [1 ]
Zhou, Houming [1 ]
Liu, Jingang [1 ]
机构：
[1] Xiangtan Univ, Sch Mech Engn, Xiangtan 411105, Hunan, Peoples R China
[2] Hunan Key Lab Computat & Simulat Sci & Engn, Xiangtan 411105, Hunan, Peoples R China
来源：
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE | 2015年 / 12卷 / 07期
关键词：
Multiple Traveling Salesman Problem; Equal-Task; Firefly Algorithm; P-SYSTEMS; MODEL; SAT;
D O I：
10.1166/jctn.2015.3886
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling salesman problem (TSP), where more than one salesman is allowed to be used in the solution. Firstly, a kind of equal-task multiple traveling salesman problem (ET-mTSP) was proposed and its corresponding mathematical model was constructed; secondly, firefly algorithm was introduced to solve this problem, and a series of discrete operations were conducted to adapt to it. Standard firefly algorithm was improved to be discrete firefly algorithm, also the general methods and steps were presented to solve the ET-mTSP. And the algorithm had a good performance for solving ET-mTSP. The performance of FA is significantly better than GA for solving such ET-mTSP.
引用
收藏
页码：1277 / 1281
页数：5
相关论文
共 50 条
  • [1] Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem
    Ma, Jianhua
    Li, Mingfu
    Zhang, Yuyan
    Zhou, Houming
    [J]. BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2014, 2014, 472 : 304 - 307
  • [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 ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
    LITTLE, JDC
    MURTY, KG
    KAREL, C
    SWEENEY, DW
    [J]. OPERATIONS RESEARCH, 1963, 11 : B48 - B48
  • [4] A multiple heuristic search algorithm for solving traveling salesman problem
    Gang, P
    Iimura, I
    Nakayama, S
    [J]. PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS, 2003, : 779 - 783
  • [5] Solving Traveling Salesman Problem using Firefly algorithm and K-means Clustering
    Jaradat, Ameera
    Matalkeh, Bara'ah
    Diabat, Waed
    [J]. 2019 IEEE JORDAN INTERNATIONAL JOINT CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATION TECHNOLOGY (JEEIT), 2019, : 586 - 589
  • [6] 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
  • [7] Hybrid Algorithm for Solving Traveling Salesman Problem
    Zhao, Ping
    Xu, Degang
    [J]. 2019 3RD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE APPLICATIONS AND TECHNOLOGIES (AIAAT 2019), 2019, 646
  • [8] A Dragonfly Algorithm for Solving Traveling Salesman Problem
    Hammouri, Abdelaziz I.
    Abu Samra, Enas Tawfiq
    Al-Betar, Mohammed Azmi
    Khalil, Raid M.
    Alasmer, Ziad
    Kanan, Monther
    [J]. 2018 8TH IEEE INTERNATIONAL CONFERENCE ON CONTROL SYSTEM, COMPUTING AND ENGINEERING (ICCSCE 2018), 2018, : 136 - 141
  • [9] An Improved Discrete Firefly Algorithm Used for Traveling Salesman Problem
    Jie, Liu
    Teng, Lin
    Yin, Shoulin
    [J]. ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT I, 2017, 10385 : 593 - 600
  • [10] A New Genetic Algorithm for solving Traveling Salesman Problem
    Bai Xiaojuan
    Zhou Liang
    [J]. PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE: APPLIED COMPUTER AND APPLIED COMPUTATIONAL SCIENCE, 2009, : 451 - +
12345