An interval algorithm for multi-objective optimization

被引：14

作者：

Ruetsch, GR ^{[1
]}

机构：

[1] Sun Microsyst Inc, Hillsboro, OR 97124 USA

来源：

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION | 2005年 / 30卷 / 01期

关键词：

global optimization; interval methods; multi-objective optimization;

D O I：

10.1007/s00158-004-0496-7

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents an interval algorithm for solving multi-objective optimization problems. Similar to other interval optimization techniques, [see Hansen and Walster (2004)], the interval algorithm presented here is guaranteed to capture all solutions, namely all points on the Pareto front. This algorithm is a hybrid method consisting of local gradient-based and global direct comparison components. A series of example problems covering convex, nonconvex, and multimodal Pareto fronts is used to demonstrate the method.

引用

页码：27 / 37

页数：11

共 15 条

[1]

Alefeld G., 1983, INTRO INTERVAL COMPU

[2]

Collette Y, 2003, MULTIOBJECTIVE OPTIM

[3] A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems [J].