Designing pheromone update strategies with strongly typed genetic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6621 LNCS, Issue , 2011, Pages 85-96

  Tavares, Jorge ^a   Pereira, Francisco B ^a,b  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b POLYTECHNIC INSTITUTE OF COIMBRA   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATION MECHANISMS; GENERALIZATION CAPABILITY; STRONGLY-TYPED GENETIC PROGRAMMING;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; ANT COLONY OPTIMIZATION; GENETIC ALGORITHMS; OPTIMIZATION;

GENETIC PROGRAMMING;

EID: 79955769295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20407-4_8     Document Type: Conference Paper

References (14)

1. Botee, H.M., Bonabeau, E.: Evolving ant colony optimization. Advanced Complex Systems 1, 149-159 (1998)
2. Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E., Qu, R.: Hyperheuristics: A survey of the state of the art. Tech. Rep. NOTTCS-TR-SUB-0906241418-2747, University of Nottingham (2010)
3. 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)
4. Diosan, L., Oltean, M.: Evolutionary design of evolutionary algorithms. Genetic Programming and Evolvable Machines 10(3), 263-306 (2009)
5. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
6. 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)
7. Montana, D.J.: Strongly typed genetic programming. Evolutionary Computation Journal 3(2), 199-230 (1995)
8. Oltean, M.: Evolving evolutionary algorithms using linear genetic programming. Evolutionary Computation Journal 13, 387-410 (2005)
9. 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)
10. 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)
11. Runka, A.: Evolving an edge selection formula for ant colony optimization. In: GECCO 2009 Proceedings, pp. 1075-1082 (2009)
12. 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)
13. 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)
14. 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)