From Royal Road to Epistatic Road for Variable Length Evolution Algorithm

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

Volumn 2936, Issue , 2004, Pages 3-14

  Platel, Michael Defoin ^a   Verel, Sebastien ^a   Clergue, Manuel ^a   Collard, Philippe ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b ACRI ST   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEALTH; ROADS AND STREETS; TRANSPORTATION;

CORRELATION LENGTHS; EVOLUTION ALGORITHMS; FITNESS LANDSCAPE; GAIN INSIGHT; LARGE AMOUNTS; REAL-WORLD; STANDARD TOOLS; VARIABLE LENGTH;

EVOLUTIONARY ALGORITHMS;

EID: 35048832398     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24621-3_1     Document Type: Article

References (15)

1. Platel, M.D., Clergue, M., Collard, P.: Maximum homologous crossover for linear genetic programming. In: Genetic Programming, Proceedings of EuroGP'2003. Volume 2610 of LNCS., Essex, UK, Springer-Verlag (2003) 194-203.
2. Banzhaf, W., Frankone, F.D., Nordin, P.: Some emergent properties of variable size EAs. Position paper at the Workshop on Evolutionary Computation with Variable Size Representation at ICGA-97 (1997).
3. Langdon, W.B., Poli, R.: Fitness causes bloat. In Chawdhry, P.K., Roy, R., Pan, R.K., eds.: Second On-line World Conference on Soft Computing in Engineering Design and Manufacturing, Springer-Verlag London (1997) 13-22.
4. Daida, J.M., Polito, J.A., Stanhope, S.A., Bertram, R.R., Khoo, J.C., Chaudhary, S.A.: What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. In Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E., eds.: Proceedings of the Genetic and Evolutionary Computation Conference. Volume 2., Orlando, Florida, USA, Morgan Kaufmann (1999) 982-989.
5. Punch, W.F., Zongker, D., Goodman, E.D.: The royal tree problem, a benchmark for single and multiple population genetic programming. In: Advances in Genetic Programming 2. MIT Press, Cambridge, MA, USA (1996) 299-316.
6. Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hypothesis. In: Foundation of Genetic Algorithms 2. Morgan Kaufman (1993) 109-126.
7. Clergue, M., Collard, P., Tomassini, M., Vanneschi, L.: Fitness distance correlation and problem difficulty for genetic programming. In: GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, Morgan Kaufmann Publishers (2002) 724-732.
8. Kauffman, S.A.: "The origins of order". Self-organization and selection in evolution. Oxford University Press, New-York (1993).
9. Weinberger, E.D.: Local properties of kauffrnan's N-k model, a tuneably rugged energy landscape. Physical Review A 44 (1991) 6399-6413.
10. Fontana, W., Stadler, P.F., Bornberg-Bauer, E.G., Griesmacher, T., Hofacker, I.L., Tacker, M., Tarazona, P., Weinberger, E.D., Schuster, P.: RNA folding and combinatory landscapes. Physical review E 47 (1993) 2083-2099.
11. Levenshtein., V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady (1966).
12. Brameier, M., Bhanzhaf, W.: Explicit control of diversity and effective variation distance in linear genetic programming (2001).
13. O'Reilly, U.: Using a distance metric on genetic programs to understand genetic operators (1997).
14. Weinberger, E.D.: Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics 63 (1990) 325-.
15. Kinnear, Jr., K.E.: Fitness landscapes and difficulty in genetic programming. In: Proceedings of the 1994 IEEE World Conference on Computational Intelligence. Volume 1., Orlando, Florida, USA, IEEE Press (1994) 142-147.