Ant colony programming: Application of ant colony system to function approximation

Intelligent Systems for Automated Learning and Adaptation: Emerging Trends and Applications

Volumn , Issue , 2009, Pages 248-272

  Boryczka, Mariusz ^a  

^a UNIVERSITY OF SILESIA   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899244792     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-60566-798-0.ch011     Document Type: Chapter

References (28)

1. Abbass, H. A., Hoai, X., & McKay, R. I. (2002). AntTAG: A new method to compose computer programs using colonies of ants. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 1654-1659). Washington, DC: IEEE Press.
2. Birattari, M., Stutzle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring meta-heuristics. In W. Langdon, E. Cantu-Paz, & K. Mathias (Eds.), GECCO'02: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 11-18). San Francisco: Morgan Kaufmann.
3. Boryczka, M. (2002). Ant colony programming for approximation problems. In Proceedings of the Eleventh International Symposium on Intelligent Information Systems, Sopot, Poland (pp. 147-156).
4. Boryczka, M. (2005). Eliminating introns in ant colony programming. Fundamenta Informaticae, 68(1/2), 1-19.
5. Boryczka, M. (2006). Ant colony programming in the process of approximation (in Polish). Katowice, Poland: University of Silesia.
6. Boryczka, M. (2008). Ant colony programming with the candidate list. In N. T. Nguyen, G.-S. Jo, R. J. Howlett, & L. C. Jain (Eds.), Proceedings of the KES-AMSTA (LNCS 4952, pp. 302-311). Berlin, Germany: Springer-Verlag.
7. Boryczka, M., & Czech, Z. (2002). Solving approximation problems by ant colony programming. In W. Langdon, E. Cantu-Paz, & K. Mathias (Eds.), GECCO-2002: Proceedings of the Genetic and Evolutionary Computation Conference (p. 133). San Francisco: Morgan Kaufmann.
8. Boryczka, M., Czech, Z., & Wieczorek, W. (2003). Ant colony programming for approximation problems. In E. Cantu-Paz (Ed.), GECCO-2003: Proceedings of the Genetic and Evolutionary Computation Conference (LNCS 2723-2724, pp. 142-143). Berlin, Germany: Springer-Verlag.
9. Carbajal, S., & Martinez, F. (2001). Evolutive introns: A non-costly method of using introns in GP. Genetic Programming and Evolvable Machines, 2(2), 111-122. doi:10.1023/A:1011548229751
10. Chen, Y., Yang, B., & Dong, J. (2004). Evolving flexible neural networks using ant programming and PSO algorithm. In Advances in Neural Networks - ISNN 2004 (LNCS 3173, pp. 211-216). Berlin, Germany: Springer-Verlag.
11. Cordón, O., Herrera, F., & Stutzle, T. (2002). A review on the ant colony optimization metaheuristic: Basis, models and new trends. Mathware & Soft Computing, 9(2/3), 141-175.
12. Dorigo, M., & Gambardella, L. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1, 53-66. doi:10.1109/4235.585892
13. Dorigo, M., Maniezzo, V., & Colorni, A. (1991). Positive feedback as a search strateg. (Tech. Rep. 91-016). Milano, Italy: Politechnico di Milano.
14. Eggermont, J., Kok, J., & Kosters, W. (2004). Detecting and pruning introns for faster decision tree evolution. In X. Yao, E. Burke, J. Lozano, J. Smith, J. Merelo-Guervós, J. Bullinaria, J. Rowe, P. T. A. Kabán, & H.-P. Schwefel (Eds.), Parallel Problem Solving from Nature - PPSN VIII (LNCS 3242, pp. 1068-1077). Berlin, Germany: Springer-Verlag.
15. Engelbrecht, A. (2005). Fundamentals of computational swarm intelligence. New York: John Wiley & Sons.
16. Gambardella, L., & Dorigo, M. (1996). Solving symmetric and asymmetric TSPs by ant colonies. In Proceedings of the IEEE Conference on Evolutionary Computation (pp. 622-627). Washington, DC: IEEE Press.
17. Iba, H., & Terao, M. (2000). Controlling elective introns for multi-agent learning by genetic programming. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, & H.-G. Beyer (Eds.), GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 419-426). San Francisco: Morgan Kaufmann.
18. Jankowski, N. (1999). Approximation and classification with RBF-type neural networks using flexible local and semi-local transfer functions In Proceedings of the Fourth Conference on Neural Networks and Their Applications (pp. 77-82).
19. Keber, C., & Schuster, M. G. (2002). Option valuation with generalized ant programming. In GEC--CO-2002: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 74-81). San Francisco: Morgan Kaufmann.
20. Koza, J. (1992). Genetic programming: On the programming of computers by natural selection. Cambridge, MA: The MIT Press.
21. Lakatos, I. (1978). History of science and its rational reconstructions. In J. Worrall & G. Currie (Eds.), The methodology of scientific research programmes: Philosophical research papers vol. I (pp. 102-138). Cambridge, UK: The Press Syndicate of the University of Cambridge.
22. Lobo, F., Deb, K., Goldberg, D., Harik, G., & Wang, L. (1998). Compressed introns in a linkage learning genetic algorithm. In J. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. Fogel, M. Garzon, D. Goldberg, H. Iba, & R. Riolo (Eds.), Genetic Programming 1998: Proceedings of the Third Annual Conference (pp. 551-558). San Francisco: Morgan Kaufmann.
23. Luke, S. (2000). Code growth is not caused by introns. In D. Whitley (Ed.), Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference, Las Vegas, USA (pp. 228-235).
24. O'Neill, M., & Nicolau, M. (2001). Grammar defined introns: An investigation into grammars, introns, and bias in grammatical evolution. In L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, & E. Burke (Eds.), GECCO-2001: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 97-103). San Francisco: Morgan Kaufmann.
25. Roux, O., & Fonlupt, C. (2000). Ant programming: Or how to use ants for automatic programming. In. Proceedings of ANTS, 2000, 121-129.
26. Sałustowicz, R. P. (2003). Probabilistic incremental program evolution. Unpublished doctoral dissertation, Technical University of Berlin, Germany.
27. Smith, P. (2000). Controlling code growth in genetic programming. In R. John & R. Birkenhead (Eds.), Advances in soft computing (pp. 166-171). Heidelberg, Germany: Physica-Verlag.
28. Solomon, E., Berg, L., Martin, D., & Villee, C. (1996). Biologia. Warszawa, Poland: Oficyna Wydawnicza.