Dynamic ant programming for automatic construction of programs

IEEJ Transactions on Electrical and Electronic Engineering

Volumn 3, Issue 5, 2008, Pages 540-548

  Shirakawa, Shinichi ^a   Ogino, Shintaro ^a   Nagao, Tomoharu ^a  

^a YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

Ant colony optimization; Automatic programming; Genetic programming; Swarm intelligence

Indexed keywords

BIOELECTRIC PHENOMENA; COMPUTER PROGRAMMING; FOOD PROCESSING; GENETIC ALGORITHMS; OPTIMIZATION; SOLUTIONS; TREES (MATHEMATICS);

ANT COLONY OPTIMIZATION; AUTOMATIC CONSTRUCTION; COMPUTER PROGRAMS; GENETIC ALGORITHM (GA); GENETIC PROGRAMMING; GENETIC PROGRAMMING (GP); SEARCH SPACES; SWARM INTELLIGENCE; SYMBOLIC REGRESSION; TEST PROBLEMS; TREE STRUCTURES;

AUTOMATIC PROGRAMMING;

EID: 51849136117     PISSN: 19314973     EISSN: 19314981     Source Type: Journal    
DOI: 10.1002/tee.20311     Document Type: Article

References (28)

1. Koza JR. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press: Cambridge, MA, 1992.
2. Koza JR. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press: Cambridge, MA, 1994.
3. Langdon WB, Poli R. Genetic programming bloat with dynamic fitness. Proceedings of the First European Workshop on Genetic Programming, LNCS 1391, Paris, France, 1998; 96-112.
4. Poli R. A simple but theoretically-motivated method to control bloat in genetic programming. Genetic Programming, Proceedings of EuroGP'2003, LNCS 2610, Essex, UK, 2003; 204-217.
5. Dorigo M, Stutzle T. Ant Colony Optimization. The MIT Press: Cambridge, MA, 2004.
6. Dorigo M, DiGaro G, Gambardella LM. Ant algorithm for discrete optimization. Artificial Life 1999; 5(2): 137-172.
7. Dorigo M, Maniezzo V, Colomi A. Positive feedback as a search strategy. Technical Report 91-016, Dipartimento di Elettronica, Politecnico di Milano, Italy, 1991.
8. Engelbrecht AP. Fundamentals of Computational Swarm Intelligence. John Wiley & Sons: New York, 2006.
9. Roux O, Fonlupt C. Ant programming: or how to use ants for automatic programming. In Proceedings of ANTS'2000, Dorigo M, et al (eds), Brussels, Belgium, 2000; 121-129.
10. Boryczka M, Czech ZJ. Solving approximation problems by ant colony programming. Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), New York, 2002; 39-46.
11. Abbass H, Hoai N, McKay R. AntTAG: A new method to compose computer programs using colonies of ants. The IEEE Congress on Evolutionary Computation 2002, Honolulu, HI, USA, 2002; 1654-1659.
12. Keber C, Schuster MG. Option valuation with generalized ant programming. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'2002), New York, 2002; 74-81,
13. Salustowicz RP, Schmidhuber J. Probabilistic incremental program evolution. Evolutionary Computation 1997; 5(2):123-141.
14. Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics 1996; 26(1):29-41.
15. Stutzle T, Hoos H. MAX-MIN ant system. Future Generation Computer Systems 2000; 16(8):889-914.
16. Schoonderwoerd R, Holland OE, Bruten JL, Rothkrantz LJM. Ant-based load balancing in telecommunications networks. Adaptive Behavior 1996; 5(2): 169-207.
17. Di Caro G, Dorigo M. AntNet: distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research 1998; 9:317-365.
18. Costa D, Hertz A. Ants can colour graphs. Journal of the Operational Research Society 1997; 48:295-305.
19. Guntsch M, Middendorf M, Schmeck H. An ant colony optimization approach to dynamic TSP. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, 2001; 860-867.
20. Guntsch M, Middendorf M. Pheromone modification strategies for ant algorithms applied to dynamic TSP. Proceedings of the EvoWorkshops on Applications of Evolutionary Computing, London, 2001; 213-222.
21. Bonabeau E, Dorigo M, Theraulaz G. Inspiration for optimization from social insect behavior. Nature 2000; 406:39-42.
22. Dorigo M, Gambardella LM. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1997; 1(1):53-66.
23. Bullnheimer B, Hartl RF, Strauss C. A new rank based version of the ant system: a computational study. Central European Journal for Operations Research and Economics 1999; 7(1):25-38.
24. Stutzle T, Hoos H. The MAX-MIN ant system and local search for the traveling salesman problem. Proceedings of the Fourth International Conference on Evolutionary Computation (ICEC97). IEEE Press: Indianapolis, IN, USA, 1997; 308-313.
25. Brameier M, Banzhaf W, A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation 2001; 5(1): 17-26.
26. Poli R. Evolution of Graph-like programs with parallel distributed genetic programming. Genetic Algorithms: Proceedings of the Seventh International Conference. Michigan State University: East Lansing, MI, 1997; 346-353.
27. Katagiri H, Hirasawa K, Hu J, Murata J. Network structure oriented evolutionary model-genetic network programming-and its comparison with genetic programming. Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, 2001; 219-226.
28. Eguchi T, Hirasawa K, Hu J, Ota N. A study of evolutionary multiagent models based on symbiosis. IEEE Transactions on Systems Man and Cybernetics Part B-Cybernetics 2006; 36(1): 179-193.