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 条
  • [1] Memory-based CHC Algorithms for the Dynamic Traveling Salesman Problem
    Simoes, Anabela
    Costa, Ernesto
    GECCO-2011: PROCEEDINGS OF THE 13TH ANNUAL GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2011, : 1037 - 1044
  • [2] A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem
    Ghiani, Gianpaolo
    Manni, Emanuele
    Thomas, Barrett W.
    TRANSPORTATION SCIENCE, 2012, 46 (03) : 374 - 387
  • [3] Traveling Salesman Problem of Optimization based on Genetic Algorithms
    Ellili, Walid
    Samet, Mounir
    Kachouri, Abdennaceur
    2017 INTERNATIONAL CONFERENCE ON SMART, MONITORED AND CONTROLLED CITIES (SM2C), 2017, : 123 - 127
  • [4] On a Dynamic Traveling Salesman Problem
    Tarashnina, Svetlana
    Pankratova, Yaroslavna
    Purtyan, Aleksandra
    CONTRIBUTIONS TO GAME THEORY AND MANAGEMENT, VOL X, 2017, 10 : 326 - 338
  • [5] Dynamic Traveling Salesman Problem
    Fabry, Jan
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON MATHEMATICAL METHODS IN ECONOMICS 2006, 2006, : 137 - 145
  • [6] THE TRAVELING SALESMAN PROBLEM - APPROXIMATE ALGORITHMS
    MELAMED, II
    SERGEEV, SI
    SIGAL, IK
    AUTOMATION AND REMOTE CONTROL, 1989, 50 (11) : 1459 - 1479
  • [7] Approximation algorithms for the traveling salesman problem
    Monnot, J
    Paschos, VT
    Toulouse, S
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2003, 56 (03) : 387 - 405
  • [8] Algorithms for the minimax problem of the traveling salesman .1. An approach based on dynamic programming
    Sergeev, SI
    AUTOMATION AND REMOTE CONTROL, 1995, 56 (07) : 1027 - 1032
  • [9] AN ANALYSIS OF ALGORITHMS FOR TRAVELING SALESMAN PROBLEM
    BELLMORE, M
    NEMHAUSE.GL
    OPERATIONS RESEARCH, 1966, S 14 : B208 - &
  • [10] Approximation algorithms for the traveling salesman problem
    Jérôme Monnot
    Vangelis Th. Paschos
    Sophie Toulouse
    Mathematical Methods of Operations Research, 2003, 56 : 387 - 405
12345