Abstract
This paper presents a new concept for generating approximations to the non-dominated set in multiobjective optimization problems. The approximation set A is constructed by solving several single-objective minimization problems in which a particular function D(A, z) is minimized. A new algorithm to calculate D(A, z) is proposed.
Original language | English |
---|---|
Journal | Journal of Heuristics |
Volume | 6 |
Issue number | 3 |
Pages (from-to) | 405-418 |
ISSN | 1381-1231 |
Publication status | Published - 2000 |