CHC-Based Algorithms for the Dynamic Traveling Salesman Problem

被引：0
|
作者：
Simoes, Anabela [1 ,2 ]
Costa, Ernesto [2 ]
机构：
[1] Polytech Inst Coimbra, Coimbra Inst Engn, Coimbra, Portugal
[2] Univ Coimbra, Ctr Informat & Syst, P-3000 Coimbra, Portugal
来源：
APPLICATIONS OF EVOLUTIONARY COMPUTATION, PT I | 2011年 / 6624卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The CHC algorithm uses an elitist selection method which, combined with an incest prevention mechanism and a method to diverge the population whenever it converges, allows the maintenance of the population diversity. This algorithm was successfully used in the past for static optimization problems. In this paper we propose three new and improved CHC-based algorithms designed to deal with dynamic environments. The performance of the investigated CHC algorithms is tested in different instances of the dynamic Traveling Salesman Problem. The experimental results show the efficiency, robustness and adaptability of the improved CHC variants solving different dynamic traveling salesman problems.
引用
收藏
页码：354 / +
页数：3
相关论文
共 50 条
  • [31] New heuristic algorithms for the Dubins traveling salesman problem
    Babel, Luitpold
    JOURNAL OF HEURISTICS, 2020, 26 (04) : 503 - 530
  • [32] BOTTLENECK TRAVELING SALESMAN PROBLEM - ALGORITHMS AND PROBABILISTIC ANALYSIS
    GARFINKEL, RS
    GILBERT, KC
    JOURNAL OF THE ACM, 1978, 25 (03) : 435 - 448
  • [33] Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
    An, Hyung-Chan
    Kleinberg, Robert D.
    Shmoys, David B.
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2010, 6302 : 1 - +
  • [34] Approximation algorithms for the traveling salesman problem with range condition
    Kumar, DA
    Rangan, CP
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 2000, 34 (03): : 173 - 181
  • [35] Using ACS for dynamic traveling salesman problem
    Siemiński, Andrzej
    Advances in Intelligent Systems and Computing, 2015, 314 : 145 - 155
  • [36] Approximate algorithms for the traveling salesman problem. II
    Sergeev, S. I.
    AUTOMATION AND REMOTE CONTROL, 2015, 76 (03) : 472 - 479
  • [37] New operators of genetic algorithms for traveling salesman problem
    Ray, SS
    Bandyopadhyay, S
    Pal, SK
    PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 2, 2004, : 497 - 500
  • [38] Exact algorithms for the traveling salesman problem with draft limits
    Battarra, Maria
    Pessoa, Artur Alves
    Subramanian, Anand
    Uchoa, Eduardo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 235 (01) : 115 - 128
  • [39] An Empirical Study on Evolutionary Algorithms for Traveling Salesman Problem
    Wei, Feng-Feng
    Chen, Wei-Neng
    Hu, Xiao-Min
    Zhang, Jun
    2019 9TH INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST2019), 2019, : 273 - 280
  • [40] The Performance of Different Algorithms to Solve Traveling Salesman Problem
    Bi, Hanqing
    Yang, Zhuoyuan
    Wang, Mengxi
    2021 2ND INTERNATIONAL CONFERENCE ON BIG DATA & ARTIFICIAL INTELLIGENCE & SOFTWARE ENGINEERING (ICBASE 2021), 2021, : 153 - 156
12345