Representations for evolutionary algorithms

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 2613-2637

  Rothlauf, Franz ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 57349091167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1388969.1389070     Document Type: Conference Paper

References (52)

1. Barnett, L. (1997). Tangled webs: Evolutionary dynamics on fitness landscapes with neutrality. Master's thesis, School of Cognitive Sciences, University of East Sussex, Brighton.
2. Barnett, L. (1998). Ruggedness and neutrality: The NKp family of fitness landscapes. In Adami, C., Belew, R. K., Kltano, H., and Taylor, C., editors, Proceedings of the 6th International Conference on Artificial Life (ALIFE-98), pages 18-27, Cambridge, MA, USA. MIT Press.
3. Barnett, L. (2001). Netcrawling - optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress on Evolutionary Computation CEC01, pages 30-37, Plscataway, NJ. IEEE Press.
4. Beasley, D., Bull, D. R., and Martin, R. R. (1993). Reducing epltasis In combinatorial problems by expansive coding. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 400-407, San Mateo, CA. Morgan Kaufmann.
5. Chol, S.-S. and Moon, B.-R. (2003). Normalization in genetic algorithms. In et al., E. C.-P., editor, Proceedings of the Genetic and Evolutionary Computation Conference 2003, pages 862-873, Heidelberg. Springer.
6. Choi, S.-S. and Moon, B.-R. (2007). Normalization in genetic algorithms, forthcoming in IEEE Transactions on Evolutionary Computation.
7. Cohoon, J. P., Hegde, S. U., Martin, W. N., and Richards, D. (1988). Floorplan design using distributed genetic algorithms. In IEEE International Conference on Computer Aided-Design, pages 452-455. IEEE.
8. Daida, J. M., Bertram, R., Stanhope, S., Khoo, J., Chaudhary, S., Chaudhri, O., and Polito, J. (2001). What makes a problem GP-hard? analysis of a tunably difficult problem in genetic programming. Genetic Programming and Evolvable Machines, 2(2):165-191.
9. Davis, L. (1989). Adapting operator probabilities in genetic algorithms. In Schaffer, J. D., editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 61-69, San Mateo, CA. Morgan Kaufmann.
10. Ebner, M., Langguth, P., Albert, J., Shackleton, M., and Shipman, R. (2001). On neutral networks and evolvability. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 1-8, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea. IEEE Press.
11. Esheiman, L. J. and Schaffer, J. D. (1991). Preventing premature convergence In genetic algorithms by preventing incest. In Belew, R. K. and Booker, L. B., editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 115-122, San Mateo, CA. Morgan Kaufmann.
12. Feller, W. (1957). An Introduction to Probability Theory and its Applications, volume 1. John Wiley & Sons, New York, 1st edition.
13. Fogel, D. B. and Stayton, L. C. (1994). On the effectiveness of crossover in simulated evolutionary optimization. BioSystems, 32:171-182.
14. Fox, B. R. and McMahon, M. B. (1991). Genetic operators for sequencing problems. In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms, pages 284-300, San Mateo, CA. Morgan Kaufmann.
15. Juistrom, B. A. (1999). Redundant genetic encodings may not be harmful. In Banzhaf, W., Daida, J., Eiben, A. E., Garzon, M. H., Honavar, V., Jakiela, M., and Smith, R. E., editors, Proceedings of the Genetic and Evolutionary Computation Conference: Volume 1, page 791, San Francisco, CA. Morgan Kaufmann Publishers.
16. Kimura, M. (1964). Diffusion models in population genetics. J. Appl. Prob., 1:177-232.
17. Kimura, M. (1983). The Neutral Theory of Molecular Evolution. Cambridge University Press.
18. Knowles, J. D. and Watson, R. A. (2002). On the utility of redundant encodings in mutation-based evolutionary search. In Merelo, J. J., Adamidis, P., Beyer, H.-G., Fernandez-Villacanas, J.-L., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature, PPSN VII, pages 88-98, Berlin. Springer-Verlag.
19. Liepins, G. E. and Vose, M. D. (1990). Representational issues in genetic optimization. Journal of Experimental and Theoretical Artificial Intelligence, 2:101-115.
20. Lobo, F. G., Goldberg, D. E., and Pelikan, M. (2000). Time complexity of genetic algorithms on exponentially scaled problems. In Whitley, D., Goldberg, D. E., Cantú-Paz, E., Spector, L., Parmee, L., and Beyer, H.-G., editors, Proceedings of the Genetic and Evolutionary Computation Conference 2000, pages 151-158, San Francisco, CA. Morgan Kaufmann Publishers.
21. Moraglio, A. and Poli, R. (2004). Topological Interpretation of crossover. In Deb, Kalyanmoy et al., editor, gecco2004, pages 1377-1388, Heidelberg. Springer.
22. Gerrits, M. and Hogeweg, P. (1991). Redundant coding of an NP-complete problem allows effective Genetic Algorithm search. In Schwefel, H.-P. and Männer, R., editors, Parallel Problem Solving from Nature, pages 70-74, Berlin. Springer-Verlag.
23. Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA.
24. Goldberg, D. E. (1991). Real-coded genetic algorithms, virtual alphabets, and blocking. Complex Systems, 5(2):139-167. (Also IlliGAL Report 90001).
25. Harik, G. R., Cantú-Paz, E., Goldberg, D. E., and Miller, B. L. (1997). The gambler's ruin problem, genetic algorithms, and the sizing of populations. In Back, T., editor, Proceedings of the Forth International Conference on Evolutionary Computation, pages 7-12, New York. IEEE Press.
26. Hartl, D. L. and Clark, A. G. (1997). Principles of population genetics. Sinauer Associates, Sunderland, Massachusetts, 3rd edition.
27. Hoal, N. X., BobMcKay, R. I., and Essam, D. L. (2006). Representation and structural difficulty in genetic programming. IEEE Trans. Evolutionary Computation, 10(2):157-166.
28. Jones, T. and Forrest, S. (1995). Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Proceedings of the Sixth International Conference on Genetic Algorithms, pages 184-192.
29. Palmer, C. C. (1994). An approach to a problem in network design using genetic algorithms. unpublished PhD thesis, Polytechnic University, Troy, NY.
30. Radcliffe, N. J. (1992). Non-linear genetic representations. In Männer, R. and Manderick, B., editors, Parallel Problem Solving from Nature- PPSN II, pages 259-268, Berlin. Springer-Verlag.
31. Radcliffe, N. J. (1997). Theoretical foundations and properties of evolutionary computations: schema processing. In Bäck, T., Fogel, D. B., and Michalewicz, Z., editors, Handbook of Evolutionary Computation, pages B2.5:l-B2.5:10. Institute of Physics Publishing and Oxford University Press, Bristol and New York.
32. Raldi, G. R. (2000). An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In Proceedings of 2000 IEEE International Conference on Evolutionary Computation, pages 43-48, Piscataway, NJ. IEEE.
33. Reeves, C. (2000). Fitness landscapes: A guided tour. Joint tutorials of SAB 2000 and PPSN 2000, tutorial handbook.
34. Ronald, S. (1997). Robust encodings in genetic algorithms: A survey of encoding issues. In Proceedings of the Forth International Conference on Evolutionary Computation, pages 43-48, Piscataway, NJ. IEEE.
35. Ronald, S., Asenstorfer, J., and Vincent, M. (1995). Representational redundancy in evolutionary algorithms. In 1995 IEEE International Conference on Evolutionary Computation, volume 2, pages 631-636, Piscataway, NJ. IEEE Service Center.
36. Rothlauf, F. (2002). Representations for Genetic and Evolutionary Algorithms. Number 104 in Studies on Fuzziness and Soft Computing. Springer, Heidelberg, 1 edition.
37. Rothlauf, F. and Goldberg, D. E. (2003). Redundant representations in evolutionary computation. Evolutionary Computation, 11(4):381-415.
38. Shackleton, M., Shipman, R., and Ebner, M. (2000). An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00, pages 493-500, La Jolla Marriott Hotel La Jolla, California, USA. IEEE Press.
39. Shipman, R. (1999). Genetic redundancy: Desirable or problematic for evolutionary adaptation? In Proceedings of the 4th International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA), pages 1-11. Springer Verlag.
40. Shipman, R., Shackleton, M., Ebner, M., and Watson, R. (2000a). Neutral search spaces for artificial evolution: A lesson from life. In Bedau, M., McCaskill, J., Packard, N., and Rasmussen, S., editors, Proceedings of Artificial Life VII, page section III (Evolutionary and Adaptive Dynamics). MIT Press.
41. Shipman, R., Shackleton, M., and Harvey, L. (2000b). The use of neutral genotypephenotype mappings for improved evoutionary search. British Telecom Technology Journal, 18(4):103-111.
42. Smith, T., Husbands, P., and O'Shea, M. (2001a). Evolvability, neutrality and search space. Technical Report 535, School of Cognitive and Computing Sciences, University of Sussex.
43. Smith, T., Husbands, P., and O'Shea, M. (2001b). Neutral networks and evolvability with complex genotype-phenotype mapping. In Proceedings of the European Converence on Artificial Life: ECAL2001, volume LNAI 2159, pages 272-281, Berlin. Springer.
44. Smith, T., Husbands, P., and O'Shea, M. (2001c). Neutral networks in an evolutionary robotics search space. In of Electrical, I. and Engineers, E., editors, Proceedings of 2001 IEEE International Conference on Evolutionary Computation, pages 136-145, Piscataway, NJ. IEEE Service Center.
45. Surry, D. and Radcliffe, N. (1996a). Formal algorithms + formal representations = search strategies. Parallel Problem Solving from Nature- PPSN IV, pages xx-xx.
46. Surry, D. and Radcliffe, N. (1996b). Formal algorithms + formal representations = search strategies. In Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature- PPSN IV, pages 366-375, Berlin. Springer-Verlag.
47. Thierens, D., Goldberg, D. E., and Pereira, Â. G. (1998). Domino convergence, drift, and the temporal-salience structure of problems. In of Electrical, I. and Engineers, E., editors, Proceedings of 1998 IEEE International Conference on Evolutionary Computation, pages 535-540, Piscataway, NJ. IEEE Service Center.
48. Toussaint, M. and Igel, C. (2002). Neutrality: A necessity for self-adaptation. In Fogel, D. B., El-Sharkawi, M. A., Yao, X., Greenwood, G., Iba, H., Marrow, P., and Shackleton, M., editors, Proceedings of the 2002 Congress on Evolutionary Computation CEC2002, pages 1354-1359. IEEE Press.
49. Watson, R. A., Hornby, G. S., and Pollack, J. B. (1998). Modeling building-block interdependency Parallel Problem Solving from Nature, PPSN V, pages 97-106.
50. Whitley, D. (2000). Walsh analysis, schemata, embedded landscapes and no free lunch. Joint Tutorials of SAB 2000 and PPSN 2000.
51. Yu, T. and Miller, J. (2001). Neutrality and evolvability of Boolean function landscapes. In Proceedings of the 4th European Conference on Genetic Programming (EuroGP), volume LNCS 2038, pages 204-217. Springer.
52. Yu, T. and Miller, J. (2002). Finding needles in haystacks Is not hard with neutrality. In Proceedings of the 5th European Conference on Genetic Programming (EuroGP), volume LNCS, pages 13-25. Springer.