论文信息 - Ant Colony Programming for Approximation Problems

Ant Colony Programming for Approximation Problems

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 | M. Boryczka

[1] M. Sugeno,et al. Structure identification of fuzzy model , 1988 .

[2] Tadashi Kondo,et al. Revised GMDH Algorithm Estimating Degree of the Complete Polynomial , 1986 .

[3] John R. Koza,et al. Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[4] Luca Maria Gambardella,et al. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[5] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[6] Luca Maria Gambardella,et al. Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[7] Alain Hertz,et al. Ants can colour graphs , 1997 .

[8] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[9] Yoshiki Uchikawa,et al. On fuzzy modeling using fuzzy neural networks with the back-propagation algorithm , 1992, IEEE Trans. Neural Networks.

[10] Pascale Kuntz,et al. Emergent colonization and graph partitioning , 1994 .

[11] Marco Dorigo,et al. Ant system for Job-shop Scheduling , 1994 .

[12] John R. Koza,et al. Genetic Programming III: Darwinian Invention & Problem Solving , 1999 .

[13] Christian Keber,et al. Option Valuation With Generalized Ant Programming , 2002, GECCO.