Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm

被引:0
|
作者
Theile, Madeleine [1 ]
机构
[1] TU Berlin, Inst Math, Berlin, Germany
关键词
SEARCH;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This articles introduces a (mu + 1)-EA, which is proven to be an exact TSP problem solver for a population of exponential size. We will show non-trivial upper bounds on the runtime until an optimum solution has been found. To the best of our knowledge this is the first time it has been shown that an NP-hard problem is solved exactly instead of approximated only by a black box algorithm.
引用
下载
收藏
页码:145 / +
页数:3
相关论文
共 50 条
  • [1] Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem
    Nikfarjam, Adel
    Bossek, Jakob
    Neumann, Aneta
    Neumann, Frank
    PROCEEDINGS OF THE 2021 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'21), 2021, : 600 - 608
  • [2] Niching-based Evolutionary Diversity Optimization for the Traveling Salesperson Problem
    Anh Viet Do
    Guo, Mingyu
    Neumann, Aneta
    Neumann, Frank
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'22), 2022, : 684 - 693
  • [3] An evolutionary approach to generalized biobjective traveling salesperson problem
    Koksalan, Murat
    Ozturk, Diclehan Tezcaner
    COMPUTERS & OPERATIONS RESEARCH, 2017, 79 : 304 - 313
  • [4] A grouping genetic algorithm for the multiple traveling salesperson problem
    Brown, Evelyn C.
    Ragsdale, Cliff T.
    Carter, Arthur E.
    INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING, 2007, 6 (02) : 333 - 347
  • [5] A LP-based Approximation Algorithm for generalized Traveling Salesperson Path Problem
    Sun, Jian
    Gutin, Gregory
    Zhang, Xiaoyan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 641 - 652
  • [6] Population-Based Incremental Learning Algorithm for a Serial Colored Traveling Salesman Problem
    Meng, Xianghu
    Li, Jun
    Zhou, MengChu
    Dai, Xianzhong
    Dou, Jianping
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2018, 48 (02): : 277 - 288
  • [7] Fixed-Parameter Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem
    Nallaperuma, Samadhi
    Sutton, Andrew M.
    Neumann, Frank
    2013 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2013, : 2037 - 2044
  • [8] A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
    Olaf Mersmann
    Bernd Bischl
    Heike Trautmann
    Markus Wagner
    Jakob Bossek
    Frank Neumann
    Annals of Mathematics and Artificial Intelligence, 2013, 69 : 151 - 182
  • [9] A Comparative Study on Population-Based Evolutionary Algorithms for Multiple Traveling Salesmen Problem with Visiting Constraints
    Bao, Cong
    Yang, Qiang
    Gao, Xu-Dong
    Zhang, Jun
    2021 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2021), 2021,
  • [10] A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
    Mersmann, Olaf
    Bischl, Bernd
    Trautmann, Heike
    Wagner, Markus
    Bossek, Jakob
    Neumann, Frank
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2013, 69 (02) : 151 - 182