Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Journal of Global Optimization
Efficient Global Optimization of Expensive Black-Box Functions
Journal of Global Optimization
A Hierarchical Genetic Algorithm Using Multiple Models for Optimization
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Metamodel-Assisted Evolution Strategies
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Optimization with variable-fidelity models applied to wing design
Optimization with variable-fidelity models applied to wing design
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Memetic algorithm using multi-surrogates for computationally expensive optimization problems
Soft Computing - A Fusion of Foundations, Methodologies and Applications
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Fast learning in networks of locally-tuned processing units
Neural Computation
Evolutionary Optimization with Dynamic Fidelity Computational Models
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Emerging Trends in Soft Computing - Memetic Algorithms; Guest Editors: Yew-Soon Ong, Meng-Hiot Lim, Ferrante Neri, Hisao Ishibuchi
A framework for memetic optimization using variable global and local surrogate models
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Emerging Trends in Soft Computing - Memetic Algorithms; Guest Editors: Yew-Soon Ong, Meng-Hiot Lim, Ferrante Neri, Hisao Ishibuchi
Evolutionary Model Type Selection for Global Surrogate Modeling
The Journal of Machine Learning Research
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
The Journal of Machine Learning Research
Various approaches for constructing an ensemble of metamodels using local measures
Structural and Multidisciplinary Optimization
Computational Intelligence in Expensive Optimization Problems
Computational Intelligence in Expensive Optimization Problems
Accelerating evolutionary algorithms with Gaussian process fitness function models
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Modern engineering design optimization often relies on computer simulations to evaluate candidate designs, a setup which results in expensive black-box optimization problems. Such problems introduce unique challenges, which has motivated the application of metamodel-assisted computational intelligence algorithms to solve them. Such algorithms combine a computational intelligence optimizer which employs a population of candidate solutions, with a metamodel which is a computationally cheaper approximation of the expensive computer simulation. However, although a variety of metamodels and optimizers have been proposed, the optimal types to employ are problem dependant. Therefore, a priori prescribing the type of metamodel and optimizer to be used may degrade its effectiveness. Leveraging on this issue, this study proposes a new computational intelligence algorithm which autonomously adapts the type of the metamodel and optimizer during the search by selecting the most suitable types out of a family of candidates at each stage. Performance analysis using a set of test functions demonstrates the effectiveness of the proposed algorithm, and highlights the merit of the proposed adaptation approach.