Back to Search
Start Over
Multiobjective optimization using an adaptive weighting scheme.
- Source :
-
Optimization Methods & Software . Feb2016, Vol. 31 Issue 1, p110-133. 24p. - Publication Year :
- 2016
-
Abstract
- A new Pareto front approximation method is proposed for multiobjective optimization problems (MOPs) with bound constraints. The method employs a hybrid optimization approach using two derivative-free direct search techniques, and intends to solve black box simulation-based MOPs where the analytical form of the objectives is not known and/or the evaluation of the objective function(s) is very expensive. A new adaptive weighting scheme is proposed to convert a multiobjective optimization problem to a single objective optimization problem. Another contribution of this paper is the generalization of the star discrepancy-based performance measure for problems with more than two objectives. The method is evaluated using five test problems from the literature, and a realistic engineering problem. Results show that the method achieves an arbitrarily close approximation to the Pareto front with a good collection of well-distributed nondominated points for all six test problems. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10556788
- Volume :
- 31
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Optimization Methods & Software
- Publication Type :
- Academic Journal
- Accession number :
- 112083675
- Full Text :
- https://doi.org/10.1080/10556788.2015.1048861