Ant colony programming for approximation problems

Authors:
Mariusz Boryczka;Zbigniew J. Czech;Wojciech Wieczorek
Affiliations:
University of Silesia, Sosnowiec, Poland;University of Silesia, Sosnowiec and Silesia University of Technology, Gliwice, Poland;University of Silesia, Sosnowiec, Poland
Venue:
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Year:
2003

Citing 0
Cited 4

Eliminating Introns in Ant Colony Programming

Fundamenta Informaticae
Enhanced generalized ant programming (EGAP)

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A survey and taxonomy of performance improvement of canonical genetic programming

Knowledge and Information Systems
Eliminating Introns in Ant Colony Programming

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method of automatic programming, called genetic programming, assumes that the desired program is found by using a genetic algorithm. We propose an idea of ant colony programming in which instead of a genetic algorithm an ant colony algorithm is applied to search for the program. The test results demonstrate that the proposed idea can be used with success to solve the approximation problems.