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 条
  • [21] EFFECTIVE NEURAL ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM
    XU, X
    TSAI, WT
    NEURAL NETWORKS, 1991, 4 (02) : 193 - 205
  • [22] Interactive genetic algorithms for the traveling salesman problem
    Louis, SJ
    Tang, R
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 385 - 392
  • [23] Measuring the Performance of Ant Colony Optimization Algorithms for the Dynamic Traveling Salesman Problem
    Mavrovouniotis, Michalis
    Anastasiadou, Maria N.
    Hadjimitsis, Diofantos
    ALGORITHMS, 2023, 16 (12)
  • [24] A survey on deep learning-based algorithms for the traveling salesman problem
    Sui, Jingyan
    Ding, Shizhe
    Huang, Xulin
    Yu, Yue
    Liu, Ruizhi
    Xia, Boyang
    Ding, Zhenxin
    Xu, Liming
    Zhang, Haicang
    Yu, Chungong
    Bu, Dongbo
    FRONTIERS OF COMPUTER SCIENCE, 2025, 19 (06)
  • [25] Algorithms based on branch and bound for the flying sidekick traveling salesman problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
  • [26] Algorithms based on branch and bound for the flying sidekick traveling salesman problem
    Dell'Amico, Mauro
    Montemanni, Roberto
    Novellani, Stefano
    Omega (United Kingdom), 2021, 104
  • [27] Dynamic programming and the graphical traveling salesman problem
    Fonlupt, Jean, 1600, (40):
  • [28] SOLVING THE DYNAMIC TRAVELING SALESMAN GAME PROBLEM
    Belousov, A. A.
    Berdyshev, Yu. I.
    Chentsov, A. G.
    Chikrii, A. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2010, 46 (05) : 718 - 723
  • [29] New policies for the dynamic traveling salesman problem
    Ghiani, Gianpaolo
    Quaranta, Antonella
    Triki, Chefi
    OPTIMIZATION METHODS & SOFTWARE, 2007, 22 (06): : 971 - 983
  • [30] A note on approximation algorithms of the clustered traveling salesman problem
    Bao, Xiaoguang
    Liu, Zhaohui
    Yu, Wei
    Li, Ganggang
    INFORMATION PROCESSING LETTERS, 2017, 127 : 54 - 57
12345