Abstract
Ant Colony algorithms are population-based methods widely used in combinatorial optimization problems. We propose a strongly typed genetic programming approach to automatically evolve the communication mechanism that allows ants to cooperatively solve a given problem. Results obtained with several TSP instances show that the evolved pheromone update strategies are effective, exhibit a good generalization capability and are competitive with human designed variants.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Botee, H.M., Bonabeau, E.: Evolving ant colony optimization. Advanced Complex Systems 1, 149–159 (1998)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyper-heuristics: A survey of the state of the art. Tech. Rep. NOTTCS-TR-SUB-0906241418-2747, University of Nottingham (2010)
Diosan, L., Oltean, M.: Evolving the structure of the particle swarm optimization algorithms. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 25–36. Springer, Heidelberg (2006)
Diosan, L., Oltean, M.: Evolutionary design of evolutionary algorithms. Genetic Programming and Evolvable Machines 10(3), 263–306 (2009)
Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
Krasnogor, N., Blackburnem, B., Hirst, J., Burke, E.: Multimeme algorithms for protein structure prediction. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 769–778. Springer, Heidelberg (2002)
Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation Journal 3(2), 199–230 (1995)
Oltean, M.: Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation Journal 13, 387–410 (2005)
Poli, R., Langdon, W.B., Holland, O.: Extending particle swarm optimisation via genetic programming. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 291–300. Springer, Heidelberg (2005)
Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008); Published via http://lulu.com and freely available at http://www.gp-field-guide.org.uk (With contributions by J. R. Koza)
Runka, A.: Evolving an edge selection formula for ant colony optimization. In: GECCO 2009 Proceedings, pp. 1075–1082 (2009)
Stutzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: ICEC Proceedings, pp. 309–314. IEEE Press, Los Alamitos (1997)
Tavares, J., Pereira, F.B.: Evolving strategies for updating pheromone trails: A case study with the tsp. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6239, pp. 523–532. Springer, Heidelberg (2010)
White, T., Pagurek, B., Oppacher, F.: ASGA: Improving the ant system by integration with genetic algorithms. In: Proceedings of the 3rd Genetic Programming Conference, pp. 610–617. Morgan Kaufmann, San Francisco (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tavares, J., Pereira, F.B. (2011). Designing Pheromone Update Strategies with Strongly Typed Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds) Genetic Programming. EuroGP 2011. Lecture Notes in Computer Science, vol 6621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20407-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-20407-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20406-7
Online ISBN: 978-3-642-20407-4
eBook Packages: Computer ScienceComputer Science (R0)