Evolving an edge selection formula for ant colony optimization

Authors:
Andrew Runka
Affiliations:
Brock University, St. Catharines, ON, Canada
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 7
Cited 5

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
MAX-MIN Ant system

Future Generation Computer Systems
Riccardo Poli, William B. Langdon, Nicholas F. McPhee: A Field Guide to Genetic Programming

Genetic Programming and Evolvable Machines
Evolving crossover operators for function optimization

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Ant colony optimization

IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

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

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
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
Efficient and effective classification of creditworthiness using ant colony optimization

Proceedings of the 50th Annual Southeast Regional Conference
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

This project utilizes the evolutionary process found in Genetic Programming to evolve an improved decision formula for the Ant System algorithm. Two such improved formulae are discovered, one which uses the typical roulette wheel selection found in all well-known Ant Colony Optimization algorithms, and one which uses a greedy-style selection mechanism. The evolution of each formula is trained using the Ant System algorithm to solve a small Travelling Salesman Problem (TSP) and tested using larger unseen TSP instances.