Cartesian Ant Programming with adaptive node replacements

Ant Colony Optimization (ACO) is a swarm-based search method. Multiple ant agents search various solutions and their searches focus on around good solutions by positive feedback mechanism based on pheromone communication. ACO is effective for combinatorial optimization problems. The attempt of apply...

Full description

Saved in:
Bibliographic Details
Main Authors: Hara, Akira, Kushida, Jun-ichi, Fukuhara, Keita, Takahama, Tetsuyuki
Format: Conference Proceeding
Language:English
Subjects:
Ant Colony Optimization
Automatic programming
Cities and towns
Equations
Evolutionary Computation
Genetic programming
Linear programming
Optimization
Swarm Intelligence
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ant Colony Optimization (ACO) is a swarm-based search method. Multiple ant agents search various solutions and their searches focus on around good solutions by positive feedback mechanism based on pheromone communication. ACO is effective for combinatorial optimization problems. The attempt of applying ACO to automatic programming has been studied in recent years. As one of the attempts, we have previously proposed Cartesian Ant Programming (CAP) as an ant-based automatic programming method. Cartesian Genetic Programming (CGP) is well-known as an evolutionary optimization method for graph-structural programs. CAP combines graph representations in CGP with pheromone communication in ACO. The connections of program primitives, terminal and functional symbols, can be optimized by ants. CAP showed better performance than CGP. However, quantities of respective symbols are limited due to the fixed assignments of functional symbols to nodes. Therefore, if the number of given nodes is not enough for representing program, the search performance becomes poor. In this paper, to solve the problem, we propose CAP with adaptive node replacements. This method finds unnecessary nodes which are not used for representing programs. Then, new functional symbols, which seems to be useful for constructing good programs, are assigned to the nodes. By this method, given nodes can be utilized efficiently. In order to examine the effectiveness of our method, we apply it to a symbolic regression problem. CAP with adaptive node replacements showed better results than conventional methods, CGP and CAP.
ISSN:1883-3977
DOI:10.1109/IWCIA.2014.6988089