CHESS-changing horizon efficient set search: A simple principle for multiobjective optimization

Pedro Manuel F. C. Borges

    Research output: Contribution to journalJournal articleResearchpeer-review

    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 languageEnglish
    JournalJournal of Heuristics
    Volume6
    Issue number3
    Pages (from-to)405-418
    ISSN1381-1231
    Publication statusPublished - 2000

    Fingerprint Dive into the research topics of 'CHESS-changing horizon efficient set search: A simple principle for multiobjective optimization'. Together they form a unique fingerprint.

    Cite this