Shih-Hsi Liu
Marjan Mernik
ABSTRACT
Linear, Gaussian, fitness proportional, clustering, and Rosca entropies are succinct measures of diversity that have been applied to balance exploration and exploitation in evolutionary algorithms. In previous studies, an entropy-driven approach using linear entropy explicitly balances and/or searches optimal solutions for the selected unimodal and multimodal functions excluding noisy functions. This paper investigates the reasons for such an exception and introduces a clustering entropy-driven approach to solve the problem. Such an approach provides a coarse-grained diversity measure that filters the noise of functions, varies cluster size and categorizes individuals at the genotype level. The experimental results show that the clustering entropy-driven approach further improves the searching results of noisy functions by one more degree.
- H. B. Amor and A. Rettinger. Intelligent exploration for genetic algorithms: Using self-organizing maps in evolutionary computation. In Proc. Genetic and Evolutionary Computation Conference, pages 1531--1538, 2005. Google Scholar
Digital Library
- T. Bäck, D. B. Fogel, and Z. Michalewicz. Handbook of Evolutionary Computation. University of Oxford Press, 1996.Google Scholar
- J. M. Fitzpatrick and J. J. Greffenstette. Genetic algorithms in noisy environments. Machine Learning, 3:101--120, 1988. Google ScholarDigital Library
- T. C. Fogarty. Varying the probability of mutation in the genetic algorithm. In Proc. 3rd Intl. Conf. on Genetic Algorithms, pages 104--109, 1989. Google ScholarDigital Library
- D. Goldberg. The race, the hurdle, and the sweet spot. In P. J. Bentley, editor, Evolutionary Design by Computers, pages 105--118. Morgan Kaufmann, 1999.Google Scholar
- D. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333--362, 1992.Google Scholar
- J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2001. Google ScholarDigital Library
- N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Intl. Conf. on Evolutionary Computation, pages 312--317, 1996. Google ScholarDigital Library
- T.-Y. Huang and Y.-Y. Chen. Diversity-based selection pooling scheme in evolution strategies. In Proc. 16th ACM Symposium on Applied Computing, pages 351--355, 2001. Google ScholarDigital Library
- J. D. Schaffer et al. A study of control parameters affecting online performance of genetic algorithms for function optimization. In Proc. 3rd Intl. Conf. on Genetic Algorithms, pages 51--60, 1989. Google ScholarDigital Library
- Y. Jin. A comprehensive survey of fitness approximation in evolutionary computation. Soft Computing, 9(1):3--12, 2005. Google ScholarDigital Library
- S.-H. Liu. PPCEA: A domain-specific language for evolutionary algorithms. http://www.cis.uab.edu/liush/PPCea.Google Scholar
- S.-H. Liu, M. Mernik, and B. R. Bryant. Parameter control in evolutionary algorithms by domain-specific scripting language PPCEA. In Proc. 1st Intl. Conf. on Bioinspired Optimization Methods and their Applications, pages 41--50, 2004.Google Scholar
- S.-H. Liu, M. Mernik, and B. R. Bryant. Entropy-driven exploration and exploitation in evolutionary algorithms. In Proc. 2nd Intl. Conf. on Bioinspired Optimization Methods and their Applications, pages 15--24, 2006.Google Scholar
- S.-H. Liu, M. Mernik, and B. R. Bryant. To explore or to exploit: An entropy-driven approach for evolutionary algorithms. Technical Report UABCIS-TR-2006-1019-1, Dept. of Computer and Information Sciences, Univ. of Alabama at Birmingham, 2006.Google Scholar
- Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996. Google ScholarDigital Library
- J. Rosca. Entropy-driven adaptive representation. In Workshop on Genetic Programming: From Theory to Real-World Applications, pages 23--32, 1995.Google Scholar
- T. Kohonen et al. Self-Organizing Maps. Springer-Verlag, 2001. Google ScholarDigital Library
- R. Ursem. Diversity-guided evolutionary algorithms. In Parallel Problem Solving from Nature VII, pages 462--471. Springer-Verlag. Google ScholarDigital Library
- X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Trans. on Evolutionary Computation, 3(2):82--102, 1999. Google ScholarDigital Library
Index Terms
- A clustering entropy-driven approach for exploring and exploiting noisy functions
Recommendations
To explore or to exploit: An entropy-driven approach for evolutionary algorithms
An evolutionary algorithm is an optimization process comprising two important aspects: exploration discovers potential offspring in new search regions; and exploitation utilizes promising solutions already identified. Intelligent balance between these ...
DE/BBO: a hybrid differential evolution with biogeography-based optimization for global numerical optimization
Differential evolution (DE) is a fast and robust evolutionary algorithm for global optimization. It has been widely used in many areas. Biogeography-based optimization (BBO) is a new biogeography inspired algorithm. It mainly uses the biogeography-based ...
Multi-operator based biogeography based optimization with mutation for global numerical optimization
Biogeography based optimization (BBO) is a new evolutionary optimization based on the science of biogeography for global optimization. We propose two extensions to BBO. First, we propose a new migration operation based multi-parent crossover called ...
Comments