Finding representative systems for discrete bicriterion optimization problems

被引:73
作者
Hamacher, Horst W.
Pedersen, Christian Roed
Ruzika, Stefan
机构
[1] Univ Kaiserslautern, Fachbereich Math, D-6750 Kaiserslautern, Germany
[2] Aarhus Univ, Dept Operat Res, Aarhus, Denmark
关键词
multicriteria optimization; efficient solution; approximation; representative systems; box algorithm; quality measures;
D O I
10.1016/j.orl.2006.03.019
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Given a discrete bicriterion optimization problem, we propose two box algorithms to compute a finite representative system for the non-dominated set satisfying a number of quality features. Its cardinality N and the accuracy Delta satisfy the relation O(A/Delta), where A is the area of a starting box defined by the ideal and the nadir point. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:336 / 344
页数:9
相关论文
共 24 条
[21]   The bicriterion semi-obnoxious location (BSL) problem solved by an ε-approximation [J].
Skriver, AJV ;
Andersen, KA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 146 (03) :517-528
[22]   INTRA-SET POINT GENERATION AND FILTERING IN DECISION AND CRITERION SPACE [J].
STEUER, RE ;
HARRIS, FW .
COMPUTERS & OPERATIONS RESEARCH, 1980, 7 (1-2) :41-53
[23]   APPROXIMATION OF PARETO OPTIMA IN MULTIPLE-OBJECTIVE, SHORTEST-PATH PROBLEMS [J].
WARBURTON, A .
OPERATIONS RESEARCH, 1987, 35 (01) :70-79
[24]   A method for convex curve approximation [J].
Yang, XQ ;
Goh, CJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 97 (01) :205-212