Data-Driven Surrogate-Assisted Multiobjective Evolutionary Optimization of a Trauma System

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 pr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on evolutionary computation 2016-12, Vol.20 (6), p.939-952
Main Authors: Handing Wang, Yaochu Jin, Jansen, Jan O.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Clustering
Computational efficiency
Computational modeling
Data analysis
Data models
Data-driven optimization
evolutionary algorithm (EA)
Evolutionary algorithms
Evolutionary computation
multiobjective optimization
Optimization
surrogate
System analysis and design
trauma system design
Citations: Items that this one cites
Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1089-778X
1941-0026
DOI:10.1109/TEVC.2016.2555315