Selection of Encoding Cardinality for a Class of Fitness Functions to Obtain Order-1 Building Blocks

References

• J. Antonisse, “A new interpretation of schema notation that overturns the binary encoding constraint,” Proceedings of the 3rd International Conference on Genetic Algorithms, 1, 86–91(1989).
   Google Scholar
• K. Chellapilla and D. B. Fogel, “Fitness distributions in evolutionary computation: Motivation and examples in the continuous domain,” BioSystems, 54(1), 15–29 (1999).
   PubMed Web of Science ®Google Scholar
• D. B. Fogel and A. Ghozeil, “A note on representations and variation operators,” IEEE Transactions on Evolutionary Computation, 1(2), 159–161 (1997).
   Google Scholar
• J. Rowe, D. Whitley, L. Barbulescu, and J.-P. Watson, “Properties of gray and binary representations,” Evolutionary Computation, 12(1),47–76(2004).
   PubMed Web of Science ®Google Scholar
• D. Whitley, “A free lunch proof for gray versus binary encodings,” Proceedings of the Genetic and Evolutionary Computation Conference, 1, 726–733 (1999).
   Google Scholar
• U. K. Chakraborty and C. Z. Janikow, “An analysis of gray versus binary encoding in genetic search,” Information Sciences, 156(3), 253–269(2003).
   Web of Science ®Google Scholar
• D. H. Wolpert and W. G. Macready, “No free lunch theorems for optimization,” IEEE Transactions on Evolutionary Computation, 1(1), 67–82(1997).
   Google Scholar
• D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
   Google Scholar
• F. Rothlauf, Representations for genetic and evolutionary algorithms, Springer, 2006.
   Google Scholar
• J. H. Holland, Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence, U Michigan Press, 1975.
   Google Scholar
• D. E. Goldberg, K. Sastry, and T. Latoza, “ On the supply of building blocks,” Proc. of the 2001 Genetic and Evolutionary Computation Conference, 336–342 (2001).
   Google Scholar
• D. E. Goldberg, Design of Innovation: Lessons from and for Competent Genetic Algorithms, Kluwer Academic Publishers, 2002.
   Google Scholar
• D. E. Goldberg, K. Sastry, and Y. Ohsawa, “Discovering deep building blocks for competent genetic algorithms using chance discovery via keygraphs,” Chance Discovery, 276–301(2003).
   Google Scholar
• Y.P. Chen and M.H. Lim, Linkage in Evolutionary Computation (Studies in Computational Intelligence), Springer Verlag, 2009.
   Google Scholar
• J. Horn and D. E. Goldberg, “Genetic algorithm difficulty and the modality of fitness landscapes,” Foundations of Genetic Algorithms, 3, 243–269 (1995).
   Google Scholar
• K. Deb and D. E. Goldberg, “Sufficient conditions for deceptive and easy binary functions,” Annals of Mathematics and Artificial Intelligence, 10(4), 385C408(1994).
   Google Scholar
• D. E. Goldberg, “Construction of high-order deceptive functions using low-order walsh coefficients,” Annals of Mathematics and Artificial Intelligence, 5(1), 35–48 (1992).
   Google Scholar
• S. Forrest and M. Mitchell, “What makes a problem hard for a genetic algorithm? some anomalous results and their explanation,” Machine Learning, 13(2-3), 285–319(1993).
   Web of Science ®Google Scholar
• D. Whitley, R. B. Heckendorn, and S. Stevens, “Hyperplane ranking, nonlinearity and the simple genetic algorithm,” Information Sciences, 156(3), 123–145(2003).
   Web of Science ®Google Scholar
• K. Sastry, U.-M. OReilly, D. E. Goldberg, and D. Hill, “Building block supply in genetic programming,” Genetic Programming Theory and Practice, 9, 137–154(2003).
   Google Scholar
• K. Sastry, U.-M. OReilly, D. E. Goldberg, and D. Hill, “Construction of fitness functions for which order-1 building blocks can be obtained at multiple loci,” 2013 Asia-Pacific Computational Intelligence and Information Technology Conference, 149–155(2013).
   Google Scholar
• N. Krasnogor and J. Smith, “A tutorial for competent memetic algorithms: Model, taxonomy, and design issues,” IEEE Transactions on Evolutionary Computation, 9(5),474–488(2005).
   Web of Science ®Google Scholar
• X.S. Chen, Y.S. Ong, M.H. Lim, and K. C. Tan, “A multi-facet survey on memetic computation,” IEEE Transactions on Evolutionary Computation, 15(5), 591–607(2011).
   Web of Science ®Google Scholar
• D. Whitley, “An overview of evolutionary algorithms: Practical issues and common pitfalls,” Information and software technology, 43(14), 817–831(2001).
   Web of Science ®Google Scholar
• C. Stephens and H. Waelbroeck, “Schemata evolution and building blocks,” Evolutionary computation, 7(2), 109–124(1999).
   Web of Science ®Google Scholar
• C. R. Stephens and R. Poli, “Coarse-grained dynamics for generalized recombination,” IEEE Transactions on Evolutionary Computation, 11(4), 541–557(2007).
   Web of Science ®Google Scholar
• L. Altenberg, “The schema theorem and prices theorem,” Foundations of Genetic Algorithms, 3, 23–49(1995).
   Google Scholar