Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Strategy Adaption by Competing Subpopulations
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
An effective intelligent algorithm for stochastic optimization problem
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Clustering-based hierarchical genetic algorithm for complex fitness landscapes
International Journal of Intelligent Systems Technologies and Applications
Robust multidisciplinary UAS design optimisation
Structural and Multidisciplinary Optimization
An optimization algorithm employing multiple metamodels and optimizers
International Journal of Automation and Computing
| Hi-index | 0.00 |
This article presents both the theoretical basis and some experimental results on Hierarchical Genetic Algorithms (HGAs). HGAs are explained in details, along with the advantages conferred by their multi-layered hierarchical topology. This topology is an excellent compromise to the classical exploration/exploitation dilemma. Another feature is the introduction of multiple models for optimization problems, within the frame of an HGA. We show that with such an architecture, it is possible to use a mix of simple models that are very fast and more complex models (with slower solvers), and still achieve the same quality as that obtained with only complex models. The different concepts presented in this paper are then illustrated via experiments on a Computational Fluid Dynamics problem, namely a nozzle reconstruction. The overall results are that a Hierarchical Genetic Algorithm using multiple models can achieve the same quality of results as that of a classic GA using only a complex model, but up to three times faster.