Eliminating Introns in Ant Colony Programming

  • Authors:
  • Mariusz Boryczka

  • Affiliations:
  • Institute of Computer Science, University of Silesia, Bȩdzińska 39, 41-200 Sosnowiec, Poland. E-mail: boryczka@us.edu.pl

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2005

Quantified Score

Hi-index 0.02

Visualization

Abstract

Ant Colony Programming is a relatively new paradigm based on Genetic Programming and Ant Colony System. We discuss the problemof eliminating introns in Ant Colony Programming. The approach is tested on several approximation problems. The test results demonstrate that the proposed method simplifies significantly the achieved solutions and shortens their evaluation time.