Advertisement

Ant Colony Programming for Approximation Problems

  • Mariusz Boryczka
  • Zbigniew J. Czech
  • Wojciech Wieczorek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2723)

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mariusz Boryczka
    • 1
  • Zbigniew J. Czech
    • 1
    • 2
  • Wojciech Wieczorek
    • 1
  1. 1.University of SilesiaSosnowiecPoland
  2. 2.Silesia University of TechnologyGliwicePoland

Personalised recommendations