Ant Colony Programming for Approximation Problems^*

Mariusz Boryczka¹, Zbigniew J. Czech², and Wojciech Wieczorek¹

¹University of Silesia,
Sosnowiec, Poland,
{boryczka,wieczor}@us.edu.pl

²University of Silesia,
Sosnowiec and Silesia University of Technology,
Gliwice, Poland,
zjc@us.edu.pl

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.

^*This work was carried out under the State Committee for Scientific Research (KBN) grant no 7 T11C 021 21.

LNCS 2723, p. 142 f.

Full article in PDF

lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003