Zur Kurzanzeige

dc.contributor.author
Brockhoff, Dimo
dc.contributor.author
Zitzler, Eckart
dc.date.accessioned
2017-06-09T06:04:37Z
dc.date.available
2017-06-09T06:04:37Z
dc.date.issued
2006-02
dc.identifier.uri
http://hdl.handle.net/20.500.11850/23823
dc.description.abstract
A common approach in multiobjective optimization is to perform the decision making process after the search process: first, a search heuristic approximates the set of Pareto-optimal solutions, and then the decision maker chooses an appropriate trade-off solution from the resulting approximation set. Both processes are strongly affected by the number of optimization criteria. The more objectives are involved the more complex is the optimization problem and the choice for the decision maker. In this context, the question arises whether all objectives are actually necessary and whether some of the objectives may be omitted; this question in turn is closely linked to the fundamental issue of conflicting and non-conflicting optimization criteria. Besides a general definition of conflicts between objective sets, we here introduce the problem of computing a minimum subset of objectives without losing information (MOSS) and show that this is an NP-hard problem. Furthermore, we present for MOSS both an approximation algorithm with optimum approximation ratio and an exact algorithm which works well for small input instances. The paper concludes with experimental results for random sets and the multiobjective 0/1-knapsack problem.
dc.language.iso
en
dc.publisher
TIK
dc.title
On Objective Conflicts and Objective Reduction in Multiple Criteria Optimization
dc.type
Report
ethz.journal.title
TIK-Report
ethz.journal.volume
243
ethz.size
21 p.
ethz.notes
.
ethz.identifier.nebis
000901696
ethz.publication.place
Zürich
ethz.publication.status
published
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02140 - Dep. Inf.technologie und Elektrotechnik / Dep. of Inform.Technol. Electrical Eng.::02640 - Inst. f. Technische Informatik und Komm. / Computer Eng. and Networks Lab.::03429 - Thiele, Lothar / Thiele, Lothar
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02140 - Dep. Inf.technologie und Elektrotechnik / Dep. of Inform.Technol. Electrical Eng.::02640 - Inst. f. Technische Informatik und Komm. / Computer Eng. and Networks Lab.::03429 - Thiele, Lothar / Thiele, Lothar
ethz.identifier.url
http://www.tik.ee.ethz.ch/sop/publicationListFiles/bz2006a.pdf
ethz.date.deposited
2017-06-09T06:04:40Z
ethz.source
ECIT
ethz.identifier.importid
imp59364d1b341e259231
ethz.ecitpid
pub:38914
ethz.eth
yes
ethz.availability
Metadata only
ethz.rosetta.installDate
2017-07-14T14:34:10Z
ethz.rosetta.lastUpdated
2018-10-01T09:24:00Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=On%20Objective%20Conflicts%20and%20Objective%20Reduction%20in%20Multiple%20Criteria%20Optimization&rft.jtitle=TIK-Report&rft.date=2006-02&rft.volume=243&rft.au=Brockhoff,%20Dimo&Zitzler,%20Eckart&rft.genre=report&
 Suchen via SFX

Dateien zu diesem Eintrag

DateienGrößeFormatIm Viewer öffnen

Zu diesem Eintrag gibt es keine Dateien.

Publikationstyp

Zur Kurzanzeige