Deterministic crowding, recombination and self-similarity

Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

Volumn 2, Issue , 2002, Pages 1516-1521

  Bo, Yuan ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS;

CROSSOVER OPERATIONS; DETERMINISTIC CROWDING; SELF-SIMILARITIES; TWO-POINT;

COMPUTER SCIENCE;

EID: 84865511382     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1004467     Document Type: Conference Paper

References (8)

1. Melanie Mitchell, An Introduction to Genetic Algorithms, MIT Press, 1996.
2. Stephanie Forrest and Melanie Mitchell, "What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation", Machine Learning 13, pp. 285-319, 1993.
3. David E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Mass., 1989.
4. Samir W. Mahfoud, "Crowding and Preselection Revisited", In Parallel Problem Solvingfrom Nature, 2, North-Holland, pp. 27-36, 1992.
5. Richard A. Watson and Jordan B. Pollack, "Hierarchically-Consistent Test Problems for Genetic Algorithms", In Proceedings of 1999 CEC, Angeline, et al. eds." IEEE Press, pp.1406-1413, 1999.
6. Richard A. Watson, Gregory S. Homby and Jordan B. Pollack, "Modelling Building-Block Interdependency", In Proceedings of the 5th Conference on Parallel Problem Solvingfrom Nature (97-106). Springer-Verlag, LNCS 1498,1998.
7. Samir W. Mahfoud, "Niching Methods for Genetic Algorithms", Doctoral dissertation, University of Illinois at UrbanaChampaign, 1995.
8. Richard A. Watson and Jordan B. Pollack, "Recombination Without Respect: Schema Combination and Disruption in Genetic Algorithm Crossover", In Proceedings of GECCO 2000, Whitley, D, et a1 (eds.), Morgan Kaufmann, 2000.