Comparison of Ant Colony Optimization Algorithms for Small-Sized Travelling Salesman Problems

被引：0
|
作者：
Subaskaran, Arcsuta [1 ]
Krahemann, Marc [1 ]
Hanne, Thomas [1 ]
Dornberger, Rolf [1 ]
机构：
[1] Univ Appl Sci & Arts Northwestern Switzerland, Muttenz, Olten, Switzerland
来源：
INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS, IBICA 2021 | 2022年 / 419卷
关键词：
Ant Colony Optimization; Travelling Salesman Problem; Improved Ant Colony Optimization; Comparison; Metaheuristics;
D O I：
10.1007/978-3-030-96299-9_2
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper deals with Ant Colony Optimization (ACO) applied to the Travelling Salesman Problem (TSP). TSP is a well-known combinatorial problem which aim is to find the shortest path between a designated set of nodes. ACO is an algorithm inspired by the natural behavior of ants. When travelling from the nest to a food source, ants leave pheromones behind. This algorithm can be applied to TSP in order to find the shortest path. In this paper, the variants of ACO are shortly explained and a new Improved Ant Colony Optimization (TACO) algorithm is proposed. The TACO is applied to small-sized TSP. It is shown that the proposed TACO performs better in some cases, especially when there are more cities in the TSP.
引用
收藏
页码：15 / 23
页数：9
相关论文
共 50 条
  • [1] Application of Ant Colony Optimization Algorithms for Transportation Problems Using the Example of the Travelling Salesman Problem
    Swiatnicki, Zbigniew
    [J]. 2015 4TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2015, : 94 - 99
  • [2] Improving Ant Colony Optimization Algorithms for Solving Traveling Salesman Problems
    Hung, Kuo-Sheng
    Su, Shun-Feng
    Lee, Zne-Jung
    [J]. JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2007, 11 (04) : 433 - 442
  • [3] An ant colony optimization algorithm for multiple travelling salesman problem
    Pan Junjie
    Wang Dingwei
    [J]. ICICIC 2006: FIRST INTERNATIONAL CONFERENCE ON INNOVATIVE COMPUTING, INFORMATION AND CONTROL, VOL 1, PROCEEDINGS, 2006, : 210 - +
  • [4] Multi-Colony Ant Algorithms for the Dynamic Travelling Salesman Problem
    Mavrovouniotis, Michalis
    Yang, Shengxiang
    Yao, Xin
    [J]. 2014 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN DYNAMIC AND UNCERTAIN ENVIRONMENTS (CIDUE), 2014, : 9 - 16
  • [5] Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem
    LIU Shufen
    LENG Huang
    HAN Lu
    [J]. Chinese Journal of Electronics, 2017, 26 (02) : 223 - 229
  • [6] A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
    Michalis Mavrovouniotis
    Shengxiang Yang
    [J]. Soft Computing, 2011, 15 : 1405 - 1425
  • [7] Pheromone Model Selection in Ant Colony Optimization for the Travelling Salesman Problem
    Liu Shufen
    Leng Huang
    Han Lu
    [J]. CHINESE JOURNAL OF ELECTRONICS, 2017, 26 (02) : 223 - 229
  • [8] A memetic ant colony optimization algorithm for the dynamic travelling salesman problem
    Mavrovouniotis, Michalis
    Yang, Shengxiang
    [J]. SOFT COMPUTING, 2011, 15 (07) : 1405 - 1425
  • [9] Modified Ant Colony Optimization with Pheromone Mutation for Travelling Salesman Problem
    Ratanavilisagul, Chiabwoot
    [J]. 2017 14TH INTERNATIONAL CONFERENCE ON ELECTRICAL ENGINEERING/ELECTRONICS, COMPUTER, TELECOMMUNICATIONS AND INFORMATION TECHNOLOGY (ECTI-CON), 2017, : 411 - 414
  • [10] Deep Intelligent Ant Colony Optimization for Solving Travelling Salesman Problem
    Wang, Yuan
    Chen, Ming
    Xing, Lining
    Wu, Yahui
    Ma, Wubin
    Zhao, Hong
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2021, 58 (08): : 1586 - 1598
12345