多目标优化
最优化问题
进化算法
计算机科学
进化计算
数学优化
聚类分析
工程优化
约束(计算机辅助设计)
计算
忠诚
人工智能
数学
算法
几何学
电信
作者
Handing Wang,Yaochu Jin,Jan O. Jansen
标识
DOI:10.1109/tevc.2016.2555315
摘要
Most existing work on evolutionary optimization assumes that there are analytic functions for evaluating the objectives and constraints. In the real world, however, the objective or constraint values of many optimization problems can be evaluated solely based on data and solving such optimization problems is often known as data-driven optimization. In this paper, we divide data-driven optimization problems into two categories, i.e., offline and online data-driven optimization, and discuss the main challenges involved therein. An evolutionary algorithm is then presented to optimize the design of a trauma system, which is a typical offline data-driven multiobjective optimization problem, where the objectives and constraints can be evaluated using incidents only. As each single function evaluation involves a large amount of patient data, we develop a multifidelity surrogate-management strategy to reduce the computation time of the evolutionary optimization. The main idea is to adaptively tune the approximation fidelity by clustering the original data into different numbers of clusters and a regression model is constructed to estimate the required minimum fidelity. Experimental results show that the proposed algorithm is able to save up to 90% of computation time without much sacrifice of the solution quality.
科研通智能强力驱动
Strongly Powered by AbleSci AI