Data-driven evolutionary sampling optimization forexpensive problems
نویسندگان
چکیده
Surrogate models have shown to be effective in assisting evolutionary algorithms (EAs) for solving computationally expensive complex optimization problems. However, the effectiveness of existing surrogate-assisted still needs improved. A data-driven sampling (DESO) framework is proposed, where at each generation it randomly employs one two strategies, surrogate screening and local search based on historical data, effectively balance global search. In DESO, radial basis function (RBF) used as model strategy, different degrees process are sample candidate points. The sampled points by strategies evaluated, then added into database updating population next sampling. To get insight extensive experiments analysis DESO been performed. proposed algorithm presents superior computational efficiency robustness compared with five state-of-the-art benchmark problems from 20 200 dimensions. Besides, applied an airfoil design problem show its effectiveness.
منابع مشابه
Sampling-based adaptive bounding evolutionary algorithm for continuous optimization problems
This paper proposes a novel sampling-based adaptive bounding evolutionary algorithm termed SABEA that is capable of dynamically updating the search space during the evolution process for continuous optimization problems. The proposed SABEA adopts two bounding strategies, namely fitness-based bounding and probabilistic sampling-based bounding, to select a set of individuals over multiple generat...
متن کاملLikelihood robust optimization for data-driven problems
We consider optimal decision-making problems in an uncertain environment. In particular, we consider the case in which the distribution of the input is unknown, yet there is some historical data drawn from the distribution. In this paper, we propose a new type of distributionally robust optimization model called the likelihood robust optimization (LRO) model for this class of problems. In contr...
متن کاملData-driven robust optimization
The last decade witnessed an explosion in the availability of data for operations research applications. Motivated by this growing availability, we propose a novel schema for utilizing data to design uncertainty sets for robust optimization using statistical hypothesis tests. The approach is flexible and widely applicable, and robust optimization problems built from our new sets are computation...
متن کاملRandom Sampling in Graph Optimization Problems
The representative random sample is a central concept of statistics. It is often possible to gather a great deal of information about a large population by examining a small sample randomly drawn from it. This approach has obvious advantages in reducing the investigator's work, both in gathering and in analyzing the data. We apply the concept of a representative sample to combinatorial optimiza...
متن کاملSolving Data Clustering Problems using Chaos Embedded Cat Swarm Optimization
In this paper, a new method is proposed for solving the data clustering problem using Cat Swarm Optimization (CSO) algorithm based on chaotic behavior. The problem of data clustering is an important section in the field of the data mining, which has always been noted by researchers and experts in data mining for its numerous applications in solving real-world problems. The CSO algorithm is one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2021
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2021.000027