Ant Colony Programming for Approximation Problems

13 years 9 months ago

Download www.cs.york.ac.uk

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.

Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wiec

Real-time Traffic

Ant Colony | Ant Colony Algorithm | GECCO 2003 | Genetic Algorithm |

claim paper

» Enhanced generalized ant programming EGAP

» Miner Ants Colony A New Approach to Solve a Mine Planning Problem

» Strong Combination of Ant Colony Optimization with Constraint Programming Optimization

» An ACO Algorithm for the Most Probable Explanation Problem

» Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem

» First steps to the runtime complexity analysis of ant colony optimization

» DEACO Hybrid Ant Colony Optimization with Differential Evolution

» Concentric Circular Array Antenna Null Steering Synthesis by Using Modified Hybrid Ant Col...

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	GECCO
Authors	Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wieczorek

Comments (0)

Sciweavers

Ant Colony Programming for Approximation Problems

Ant Colony | Ant Colony Algorithm | GECCO 2003 | Genetic Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers