Comparison of Swarm and Graph Algorithms for Solving Travelling Salesman Problems

被引:0
|
作者
Eggenschwiler, Stefan [1 ]
Spahic-Bogdanovic, Maja [1 ]
Hanne, Thomas [1 ]
Dornberger, Rolf [2 ]
机构
[1] Univ Appl Sci & Arts Northwestern Switzerland, Olten, Switzerland
[2] Univ Appl Sci & Arts Northwestern Switzerland, Basel, Switzerland
关键词
travelling salesman problem; nature-inspired algorithms; swarm intelligence; combinatorial optimization;
D O I
10.1109/iscmi51676.2020.9311558
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we compare different nature-inspired, swarm algorithms (4 variants of ACO and PSO) and five graph algorithms for solving the travelling salesman problem based on defined key metrics. We focus on describing the experimental setup including input data and the outline of the metrics applied in the analysis part. The aim is to compare the performance of metaheuristics (nature-based) algorithms with traditional algorithms used for solving travelling salesman problems (TSP).
引用
收藏
页码:1 / 7
页数:7
相关论文
共 50 条
  • [1] Solving travelling salesman problems with metaheuristics
    Kuzu, Sultan
    Onay, Onur
    Sen, Ugur
    Tuncer, Mustafa
    Yildirim, Bahadir Fatih
    Keskinturk, Timur
    ISTANBUL UNIVERSITY JOURNAL OF THE SCHOOL OF BUSINESS, 2014, 43 (01): : 1 - 27
  • [2] Benchmarking algorithms for dynamic travelling salesman problems
    Kang, LS
    Zhou, AM
    McKay, B
    Li, Y
    Kang, Z
    CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2, 2004, : 1286 - 1292
  • [3] Solving Travelling Salesman Problem by Using Optimization Algorithms
    Saud, Suhair
    Kodaz, Halife
    Babaoglu, Ismail
    9TH INTERNATIONAL CONFERENCE ON ADVANCES IN INFORMATION TECHNOLOGY (IAIT-2017), 2018, : 17 - 32
  • [4] Iterative Cartesian Genetic Programming: Creating General Algorithms for Solving Travelling Salesman Problems
    Ryser-Welch, Patricia
    Miller, Julian F.
    Swan, Jerry
    Trefzer, Martin A.
    GENETIC PROGRAMMING, EUROGP 2016, 2016, 9594 : 294 - 310
  • [5] Solving travelling salesman problems with an intelligent search approach
    Lau, SK
    Shue, LY
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2001, 18 (01) : 77 - 87
  • [6] ALGORITHMS FOR LARGE-SCALE TRAVELLING SALESMAN PROBLEMS
    CHRISTOFIDES, N
    EILON, S
    OPERATIONAL RESEARCH QUARTERLY, 1972, 23 (04) : 511 - +
  • [7] An improved particle swarm optimisation for solving generalised travelling salesman problem
    Gao, Yu-xi
    Wang, Yan-min
    Pei, Zhi-li
    INTERNATIONAL JOURNAL OF COMPUTING SCIENCE AND MATHEMATICS, 2012, 3 (04) : 385 - 393
  • [8] Comparison Metaheuristic Methods by Solving Travelling Salesman Problem
    Mica, Ondrej
    PROCEEDINGS OF THE 9TH INTERNATIONAL SCIENTIFIC CONFERENCE INPROFORUM: COMMON CHALLENGES - DIFFERENT SOLUTIONS - MUTUAL DIALOGUE, 2015, : 161 - 165
  • [9] Comparison of Neural Networks for Solving the Travelling Salesman Problem
    La Maire, Bert F. J.
    Mladenov, Valeri M.
    ELEVENTH SYMPOSIUM ON NEURAL NETWORK APPLICATIONS IN ELECTRICAL ENGINEERING (NEUREL 2012), 2012,
  • [10] Comparison of Ant Colony Optimization Algorithms for Small-Sized Travelling Salesman Problems
    Subaskaran, Arcsuta
    Krahemann, Marc
    Hanne, Thomas
    Dornberger, Rolf
    INNOVATIONS IN BIO-INSPIRED COMPUTING AND APPLICATIONS, IBICA 2021, 2022, 419 : 15 - 23