Mixture surrogate models based on Dempster-Shafer theory for global optimization problems

Authors:
Juliane Müller;Robert Piché
Affiliations:
Department of Mathematics, Tampere University of Technology, Tampere, Finland 33101;Department of Mathematics, Tampere University of Technology, Tampere, Finland 33101
Venue:
Journal of Global Optimization
Year:
2011

Citing 8
Cited 1

On the Dempster-Shafer framework and new combination rules

Information Sciences: an International Journal
Response Surface Methodology: Process and Product in Optimization Using Designed Experiments

Response Surface Methodology: Process and Product in Optimization Using Designed Experiments
Efficient Global Optimization of Expensive Black-Box Functions

Journal of Global Optimization
A Taxonomy of Global Optimization Methods Based on Response Surfaces

Journal of Global Optimization
On Accelerated Random Search

SIAM Journal on Optimization
Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions

Journal of Global Optimization
Improved Strategies for Radial basis Function Methods for Global Optimization

Journal of Global Optimization
An adaptive radial basis algorithm (ARBF) for expensive black-box global optimization

Journal of Global Optimization

SO-MI: A surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research in algorithms for solving global optimization problems using response surface methodology has shown that it is in general not possible to use one surrogate model for solving different kinds of problems. In this paper the approach of applying Dempster-Shafer theory to surrogate model selection and their combination is described. Various conflict redistribution rules have been examined with respect to their influence on the results. Furthermore, the implications of the surrogate model type, i.e. using combined, single or a hybrid of both, have been studied. The suggested algorithms were applied to several well-known global optimization test problems. The results indicate that the used approach leads for all problems to a thorough exploration of the variable domain, i.e. the vicinities of global optima could be detected, and that the global minima could in most cases be approximated with high accuracy.