CHC-based algorithms for the dynamic traveling salesman problem

Authors:
Anabela Simões;Ernesto Costa
Affiliations:
Coimbra Institute of Engineering, Polytechnic Institute of Coimbra and Centre for Informatics and Systems, University of Coimbra;Centre for Informatics and Systems, University of Coimbra
Venue:
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I
Year:
2011

Citing 11
Cited 3

Evaluating evolutionary algorithms

Artificial Intelligence - Special volume on empirical methods
Evolutionary Optimization in Dynamic Environments

Evolutionary Optimization in Dynamic Environments
A Population Based Approach for ACO

Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
Job Shop Scheduling with Genetic Algorithms

Proceedings of the 1st International Conference on Genetic Algorithms
A Fast Evolutionary Algorithm for Traveling Salesman Problem

ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
An Immune System Based Genetic Algorithm Using Permutation-Based Dualism for Dynamic Traveling Salesman Problems

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Prediction in evolutionary algorithms for dynamic environments using markov chains and nonlinear regression

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Variable-Size Memory Evolutionary Algorithm to Deal with Dynamic Environments

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems

Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
An Agent-based Evolutionary Search for Dynamic Travelling Salesman Problem

ICIE '10 Proceedings of the 2010 WASE International Conference on Information Engineering - Volume 01
A new approach to solving dynamic traveling salesman problems

SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning

Memory-based CHC algorithms for the dynamic traveling salesman problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Parallel CHC algorithm for solving dynamic traveling salesman problem using many-core GPU

AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
Extended virtual loser genetic algorithm for the dynamic traveling salesman problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.