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

被引：0
|
作者：
Theile, Madeleine [1 ]
机构：
[1] TU Berlin, Inst Math, Berlin, Germany
来源：
EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS | 2009年 / 5482卷
关键词：
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 条
  • [31] An exact algorithm for the traveling salesman problem with deliveries and collections
    Baldacci, R
    Hadjiconstantinou, E
    Mingozzi, A
    NETWORKS, 2003, 42 (01) : 26 - 41
  • [32] Exact Two-Step Benders Decomposition for the Time Window Assignment Traveling Salesperson Problem
    Celik, Sifa
    Martin, Layla
    Schrotenboer, Albert H.
    Van Woensel, Tom
    TRANSPORTATION SCIENCE, 2025, 59 (02)
  • [33] On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the DynamicWeighted Traveling Salesperson Problem
    Bossek, Jakob
    Neumann, Aneta
    Neumann, Frank
    PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, GECCO 2023, 2023, : 248 - 256
  • [34] Analysis of Population-based Evolutionary Algorithms for the Vertex Cover Problem
    Oliveto, Pietro S.
    He, Jun
    Yao, Xin
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1563 - 1570
  • [35] Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem
    Yavuzhan Akduran
    Erdi Dasdemir
    Murat Caner Testik
    Applied Intelligence, 2023, 53 : 27148 - 27162
  • [36] A neural network algorithm in matrix form and a heuristic greedy method for traveling salesperson problem
    Popoviciu, Nicolae
    Boncut, Mioara
    PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON AUTOMATIC CONTROL, MODELING & SIMULATION, 2007, : 208 - +
  • [37] Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
    Jaszkiewicz, Andrzej
    Zielniewicz, Piotr
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 193 (03) : 885 - 890
  • [38] A statistical analysis of parameter values for the rank-based ant colony optimization algorithm for the traveling salesperson problem
    Vasko, F. J.
    Bobeck, J. D.
    Governale, M. A.
    Rieksts, D. J.
    Keffer, J. D.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (06) : 1169 - 1176
  • [39] An Improved Partheno-Genetic Algorithm With Reproduction Mechanism for the Multiple Traveling Salesperson Problem
    Wang, Zijian
    Fang, Xi
    Li, Hao
    Jin, Hongbin
    IEEE ACCESS, 2020, 8 (08): : 102607 - 102615
  • [40] Bi-objective parameter setting problem of a genetic algorithm: an empirical study on traveling salesperson problem
    Akduran, Yavuzhan
    Dasdemir, Erdi
    Testik, Murat Caner
    APPLIED INTELLIGENCE, 2023, 53 (22) : 27148 - 27162
12345