Dynamic ant programming for automatic construction of programs
Dynamic ant programming for automatic construction of programs
复制标题
DOI：
10.1002/tee.20311
复制
发表时间：
2008-09
影响因子：
1
通讯作者：
S. Shirakawa;Shintaro Ogino;T. Nagao
中科院分区：
文献类型：
--
作者：
S. Shirakawa;Shintaro Ogino;T. Nagao
在本文中提出了一种自动编程的方法。新方法是动态的ANT编程（DAP）。在信息素中，尽管搜索空间（即DAP的信息素表）正在动态变化，但较高的概率可以选择使用ACO的树结构以及详细的节点的删除和插入的方法。 GP和DAP的有效性是为了研究几个参数的影响，我们比较了使用不同的设置获得的实验结果。
A new method for automatic programming is proposed in this paper. Automatic programming is the method of generating computer programs automatically. Genetic programming (GP) is a typical example of automatic programming. GP evolves computer programs with tree structure based on genetic algorithm (GA). The new method is named dynamic ant programming (DAP). DAP is based on ant colony optimization (ACO) and uses dynamically changing pheromone table. The nodes (terminal and nonterminal) are selected using the value of pheromone table. The higher the rate of pheromone, the higher is the probability that it can be chosen. Although the search space (i.e., the pheromone table of DAP) is dynamically changing, the ants find good solution using portions of solutions, which are of pheromone value. We describe the method of construction of tree structure using ACO, as well as pheromone update and deletion and insertion of nodes in detail. DAP is applied to the symbolic regression problem that is widely used as a test problem for GP system. We compare the performance of DAP to GP and show the effectiveness of DAP. In order to investigate the influence of several parameters, we compare experimental results obtained using different settings. © 2008 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.