Voronoi-based Efficient Surrogate-assisted Evolutionary Algorithm for Very Expensive Problems

  title={Voronoi-based Efficient Surrogate-assisted Evolutionary Algorithm for Very Expensive Problems},
  author={Hao Tong and Changwu Huang and Jialin Liu and Xin Yao},
  journal={2019 IEEE Congress on Evolutionary Computation (CEC)},
Very expensive problems are very common in practical system that one fitness evaluation costs several hours or even days. Surrogate assisted evolutionary algorithms (SAEAs) have been widely used to solve this crucial problem in the past decades. However, most studied SAEAs focus on solving problems with a budget of at least ten times of the dimension of problems which is unacceptable in many very expensive real-world problems. In this paper, we employ Voronoi diagram to boost the performance of… Expand
Algorithm portfolio for individual-based surrogate-assisted evolutionary algorithms
This paper proposes two portfolio frameworks for very expensive problems in which the maximal number of fitness evaluations is only 5 times of the problem's dimension and considers an algorithm portfolio for SAEAs to reduce the risk of choosing an inappropriate algorithm for CEPs. Expand
Knee Point Identification Based on Voronoi Diagram
  • Haifeng Nie, Huiru Gao, Ke Li
  • Computer Science
  • 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)
  • 2020
Experimental results fully show the effectiveness and competitiveness of the proposed KPI method based on Voronoi diagram (KPIVD) for identifying three types of knee points. Expand
A Local Search with a Surrogate Assisted Option for Instance Reduction
This article proposes the use of a simple local search algorithm and its integration with an optional surrogate assisted model that perturbs an n-dimensional vector along the directions identified by its design variables one by one. Expand
Self-adaptive Decomposition and Incremental Hyperparameter Tuning Across Multiple Problems
  • Jialin Liu, X. Yao
  • Computer Science
  • 2019 IEEE Symposium Series on Computational Intelligence (SSCI)
  • 2019
This work takes a state-of-the-art decomposition method for large-scale CARPs called SAHiD as an example and proposes an incremental hyperparameter tuning approach across multiple problem instances to learn the hyperparameters of SASAHiD on a set of instances with different sizes. Expand
Adaptive Sampling for Global Meta Modeling Using a Gaussian Process Variance Measure
Adaptive sampling methods have been widely used for meta modeling, when dealing with expensive-to-evaluate experiments in practical design and optimization tasks to approximate their performanceExpand
Convolutional Neural Networks-Based Lung Nodule Classification: A Surrogate-Assisted Evolutionary Algorithm for Hyperparameter Optimization
This paper proposes a non-stationary kernel that allows the surrogate model to adapt to functions whose smoothness varies with the spatial location of inputs, and searches with a surrogate for optimal setting via a hyperparameter importance based evolutionary strategy. Expand
Test Data Generation for Path Coverage of MPI Programs Using SAEO
A method of test data generation for path coverage of MPI programs using surrogate-assisted evolutionary optimization, which can efficiently generate test data with high quality and improve the testing efficiency. Expand


Surrogate-assisted hierarchical particle swarm optimization
This paper proposes a surrogate-assisted hierarchical particle swarm optimizer for high-dimensional problems consisting of a standard particle swarm optimization (PSO) algorithm and a social learning particle Swarm optimization algorithm (SL-PSO), where the PSO and SL- PSO work together to explore and exploit the search space, and simultaneously enhance the global and local performance of the surrogate model. Expand
Semi-supervised learning assisted particle swarm optimization of computationally expensive problems
In many real-world optimization problems, it is very time-consuming to evaluate the performance of candidate solutions because the evaluations involve computationally intensive numerical simulationsExpand
Committee-Based Active Learning for Surrogate-Assisted Particle Swarm Optimization of Expensive Problems
A novel surrogate-assisted particle swarm optimization (PSO) inspired from committee-based active learning (CAL) is proposed and experimental results demonstrate that the proposed algorithm is able to achieve better or competitive solutions with a limited budget of hundreds of exact FEs. Expand
A Gaussian Process Surrogate Model Assisted Evolutionary Algorithm for Medium Scale Expensive Optimization Problems
A new framework is developed and used in GPEME, which carefully coordinates the surrogate modeling and the evolutionary search, so that the search can focus on a small promising area and is supported by the constructed surrogate model. Expand
A two-layer surrogate-assisted particle swarm optimization algorithm
The performance of the proposed TLSAPSO algorithm is examined on ten widely used benchmark problems, and the experimental results show that the proposed algorithm is effective and highly competitive with the state-of-the-art, especially for multimodal optimization problems. Expand
Classification- and Regression-Assisted Differential Evolution for Computationally Expensive Problems
It is shown that due to the specific selection strategy of DE, a synergy can be established between these two types of models, and leads to a surrogate model that is more appropriate for DE. Expand
Surrogate-assisted evolutionary computation: Recent advances and future challenges
This paper provides a concise overview of the history and recent developments in surrogate-assisted evolutionary computation and suggests a few future trends in this research area. Expand
A study on polynomial regression and Gaussian process global surrogate model in hierarchical surrogate-assisted evolutionary algorithm
This study shows that the GP model is suitable for global surrogate modeling in HSAEA if the evaluation function is very expensive in computations, but on moderately expensive problems, the PR method may serve to generate better efficiency than using GP. Expand
A comprehensive survey of fitness approximation in evolutionary computation
  • Yaochu Jin
  • Mathematics, Computer Science
  • Soft Comput.
  • 2005
A comprehensive survey of the research on fitness approximation in evolutionary computation is presented, main issues like approximation levels, approximate model management schemes, model construction techniques are reviewed and open questions and interesting issues in the field are discussed. Expand
Efficient Global Optimization of Expensive Black-Box Functions
This paper introduces the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering and shows how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule. Expand