Supply of Order-1 Building Blocks for Functions Linearly Combined of Sinusoidal Bases with Integral Frequencies
Hongqiang Mo, Zhong Li, Qiliang Du
2015
Abstract
In line with the theory of schema sampling, a hypothesis could be made that sufficient supply of loworder building blocks (BBs) was one of the necessary conditions for a genetic algorithm(GA) to work. A consequential question of this hypothesis regards, when a certain fitness function is optimized with a commonly used GA, whether it is rare or common that there are plenty of low-order BBs. It is remarked that, when a base-m encoded GA is applied to a fitness function that is linearly combined of sinusoidal basis functions with integral frequencies, it is unlikely to obtain order-1 BBs with fixed positions at multiple loci, i.e., it is rare that there are plenty of order-1 BBs. However, if a considerable part of the sinusoidal basis functions are with frequencies exponential to a positive integer m, a base-m encoding can provide relatively more order-1 BBs compared with the encodings with cardinalities other than m.
References
- Chen, X., Ong, Y.-S., Lim, M.-H., and Tan, K. C. (2011). A multi-facet survey on memetic computation. IEEE Transactions on Evolutionary Computation, 15(5):591-607.
- Chen, Y. and Lim., M. (2009). Linkage in Evolutionary Computation (Studies in Computational Intelligence). Springer Verlag.
- Deb, K. and Goldberg, D. E. (1994). Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence, 10(4):385- 408.
- Deb, K., Horn, J., and Goldberg, D. (1993). Multimodal deceptive functions. Complex Systems, 7(2):131-153.
- Fogel, D. B. and Ghozeil, A. (1997). A note on representations and variation operators. IEEE Transactions on Evolutionary Computation, 1(2):159-161.
- Forrest, S. and Mitchell, M. (1993). What makes a problem hard for a genetic algorithm? some anomalous results and their explanation. Machine Learning, 13(2- 3):285-319.
- Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. AddisonWesley.
- Goldberg, D. E. (1992). Construction of high-order deceptive functions using low-order walsh coefficients. Annals of Mathematics and Artificial Intelligence, 5(1):35-48.
- Goldberg, D. E. (2002). Design of Innovation: Lessons from and for Competent Genetic Algorithms. Kluwer Academic Publishers.
- Goldberg, D. E., Sastry, K., and Latoza, T. (2001). On the supply of building blocks. In Spector, L., editor, Proc. of the 2001 Genetic and Evolutionary Computation Conference, pages 336-342. San Francisco, Calif., Kaufmann.
- Goldberg, D. E., Sastry, K., and Ohsawa, Y. (2003). Discovering deep building blocks for competent genetic algorithms using chance discovery via keygraphs. In Ohsawa, Y. and Mcburney, P., editors, Chance Discovery, pages 276-301. Springer-Verlag.
- Holland, J. H. (1975). Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press.
- Hoyweghen, C. V., Goldberg, D. E., and Naudts, B. (2001). Building block superiority, multimodality and synchronization problems. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 694-701. Morgan Kaufmann.
- Krasnogor, N. and Smith, J. (2005). A tutorial for competent memetic algorithms: Model, taxonomy, and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474-488.
- Mo, H. Q., Li, Z., Park, J. B., and Joo, Y. H. (2009). On the supply of superior order-1 building blocks for a class of periodical fitness functions. International Journal of Computational Intelligence Systems, 2(1):91-98.
- Mo, H. Q., Li, Z., Tian, L. F., and Tian, X. (2015). Selection of encoding cardinality for a class of fitness functions to obtain order-1 building blocks. International Journal of Computational Intelligence Systems, 8(1):62-74.
- Rothlauf, F. (2006). Representations for genetic and evolutionary algorithms. Springer.
- Sastry, K., O'Reilly, U.-M., Goldberg, D. E., and Hill, D. (2003). Building block supply in genetic programming. In Riolo, R. L. and Worzel, B., editors, Genetic Programming Theory and Practice, chapter 9, pages 137-154. Kluwer.
- Whitley, D. (1999). A free lunch proof for gray versus binary encodings. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 726-733. Citeseer.
- Whitley, D. (2001). An overview of evolutionary algorithms: Practical issues and common pitfalls. Information and software technology, 43(14):817- 831.
- Whitley, D., Heckendorn, R. B., and Stevens, S. (2003). Hyperplane ranking, nonlinearity and the simple genetic algorithm. Information Sciences, 156(3):123- 145.
- Whitley, D., Mathias, K. E., and Pyeatt, L. D. (1995). Hyperplane ranking in simple genetic algorithms. In Eshelman, L., editor, Proceedings of the 6th International Conference on Genetic Algorithms, pages 231-238.
- Wolpert, D. H. and Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82.
Paper Citation
in Harvard Style
Mo H., Li Z. and Du Q. (2015). Supply of Order-1 Building Blocks for Functions Linearly Combined of Sinusoidal Bases with Integral Frequencies . In Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA, ISBN 978-989-758-157-1, pages 133-137. DOI: 10.5220/0005585601330137
in Bibtex Style
@conference{ecta15,
author={Hongqiang Mo and Zhong Li and Qiliang Du},
title={Supply of Order-1 Building Blocks for Functions Linearly Combined of Sinusoidal Bases with Integral Frequencies},
booktitle={Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,},
year={2015},
pages={133-137},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005585601330137},
isbn={978-989-758-157-1},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 1: ECTA,
TI - Supply of Order-1 Building Blocks for Functions Linearly Combined of Sinusoidal Bases with Integral Frequencies
SN - 978-989-758-157-1
AU - Mo H.
AU - Li Z.
AU - Du Q.
PY - 2015
SP - 133
EP - 137
DO - 10.5220/0005585601330137