Ant colony programming with the candidate list

Authors:
Mariusz Boryczka
Affiliations:
Institute of Computer Science, University of Silesia, Sosnowiec, Poland
Venue:
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Year:
2008

Citing 8
Cited 0

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

Genetic programming: on the programming of computers by means of natural selection
Emergent colonization and graph partitioning

SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
The ant colony optimization meta-heuristic

New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows

New ideas in optimization
Solving Approximation Problems By Ant Colony Programming

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Ant Colony Programming for Approximation Problems

Proceedings of the IIS'2002 Symposium on Intelligent Information Systems
Fundamentals of Computational Swarm Intelligence

Fundamentals of Computational Swarm Intelligence
Eliminating Introns in Ant Colony Programming

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work develops an idea of the ant colony programming in which an ant colony algorithm is applied to search for the computer program. We shows, that the candidate list (introduced in ant colony system) allows to reduce the algorithm's execution time and improves the quality of results.