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 条
  • [31] An Effective Simulated Annealing Algorithm for Solving the Traveling Salesman Problem
    Wang, Zicheng
    Geng, Xiutang
    Shao, Zehui
    [J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2009, 6 (07) : 1680 - 1686
  • [32] Solving Asymmetric Traveling Salesman Problem using Genetic Algorithm
    Birtane Akar, Sibel
    Sahingoz, Ozgur Koray
    [J]. 2015 23RD SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2015, : 1655 - 1659
  • [33] Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
    Xu, Shuhui
    Wang, Yong
    Huang, Aiqin
    [J]. ALGORITHMS, 2014, 7 (02): : 229 - 242
  • [34] Intelligent Route Construction Algorithm for Solving Traveling Salesman Problem
    Rahman, Md. Azizur
    Islam, Ariful
    Ali, Lasker Ershad
    [J]. INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2021, 21 (04): : 33 - 40
  • [35] A distance matrix based algorithm for solving the traveling salesman problem
    Shengbin Wang
    Weizhen Rao
    Yuan Hong
    [J]. Operational Research, 2020, 20 : 1505 - 1542
  • [36] A distance matrix based algorithm for solving the traveling salesman problem
    Wang, Shengbin
    Rao, Weizhen
    Hong, Yuan
    [J]. OPERATIONAL RESEARCH, 2020, 20 (03) : 1505 - 1542
  • [37] Discrete Social Spider Algorithm for Solving Traveling Salesman Problem
    Khosravanian, Asieh
    Rahmanimanesh, Mohammad
    Keshavarzi, Parviz
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2021, 20 (03)
  • [38] A Hybrid Approach Based on Ant Colony and Firefly Algorithm for Traveling Salesman Problem
    Xu, Yan
    Yao, Xiongkai
    [J]. 2023 8TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA ANALYTICS, ICCCBDA, 2023, : 167 - 171
  • [39] An Improved Genetic Algorithm for Multiple Traveling Salesman Problem
    Zhou, Wei
    Li, Yuanzong
    [J]. 2010 2ND INTERNATIONAL ASIA CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS (CAR 2010), VOL 1, 2010, : 493 - 495
  • [40] An improved genetic algorithm for the multiple traveling salesman problem
    Zhao, Fanggeng
    Dong, Jinyan
    Li, Sujian
    Yang, Xirui
    [J]. 2008 CHINESE CONTROL AND DECISION CONFERENCE, VOLS 1-11, 2008, : 1935 - 1939
12345