Evolving strategies for updating pheromone trails: a case study with the TSP

Authors:
Jorge Tavares;Francisco B. Pereira
Affiliations:
CISUC, Department of Informatics Engineering, University of Coimbra;CISUC, Department of Informatics Engineering, University of Coimbra and Polo II, Coimbra, Portugal and ISEC, Coimbra, Portugal
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Year:
2010

Citing 6
Cited 3

Ant Colony Optimization

Ant Colony Optimization
Evolving an edge selection formula for ant colony optimization

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Evolutionary design of Evolutionary Algorithms

Genetic Programming and Evolvable Machines
A Field Guide to Genetic Programming

A Field Guide to Genetic Programming
Extending particle swarm optimisation via genetic programming

EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Evolving the structure of the particle swarm optimization algorithms

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Towards the development of self-ant systems

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Designing pheromone update strategies with strongly typed genetic programming

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Automatic design of ant algorithms with grammatical evolution

EuroGP'12 Proceedings of the 15th European conference on Genetic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ant Colony Optimization is a bio-inspired technique that can be applied to solve hard optimization problems. A key issue is how to design the communication mechanism between ants that allows them to effectively solve a problem. We propose a novel approach to this issue by evolving the current pheromone trail update methods. Results obtained with the TSP show that the evolved strategies perform well and exhibit a good generalization capability when applied to larger instances.