Fitness inheritance in genetic algorithms
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
A comprehensive survey of fitness approximation in evolutionary computation
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Evaluation relaxation using substructural information and linear estimation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
On the Scalability of Real-Coded Bayesian Optimization Algorithm
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
In evolutionary algorithms, the efficiency enhancement techniques are capable of solving difficult large scale problems in a scalable manner. This paper rigorously analyzes the Bayesian optimization algorithm (BOA) incorporated with an innovative evaluation relaxation method based on the entropy measurement theory (en-BOA). In particular, the concept of entropy is used to develop the evaluation relaxation strategy (ERS) and to determine the rate of convergence. Entropy measurement-based ERS is employed to recognize which candidate solution should be evaluated by the actual function or be estimated by the surrogate model. Experiments prove that en-BOA significantly reduces the number of actual evaluations and the scalability of BOA is not negatively affected. Moreover, the entropy measurement-based evaluation relaxation technique does not require any larger population sizes.