Experiments with classification-based scalarizing functions in interactive multiobjective optimization

In multiobjective optimization methods, the multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions and such functions may be constructed in many ways. We compare both theoretically and numerically the performance of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 175; H. 2; S. 931 - 947
Hauptverfasser: Miettinen, Kaisa, Mäkelä, Marko M., Kaario, Katja
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.12.2006
Elsevier
Elsevier Sequoia S.A
Schriftenreihe:European Journal of Operational Research
Schlagworte:
Applied sciences
Classification
Exact sciences and technology
Guaranteeing Pareto optimality
Interactive methods
Mathematical programming
Multiple objective programming
Operational research and scientific management
Operational research. Management science
Optimization
Pareto optimum
Studies
Test problems
Interactive methods
Test problems
Guaranteeing Pareto optimality
Multiple objective programming
Classification
Pareto optimum
Interactive mode
Multiobjective programming
Scalarization
Guarantee
Location problem
Optimization
ISSN:0377-2217, 1872-6860, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In multiobjective optimization methods, the multiple conflicting objectives are typically converted into a single objective optimization problem with the help of scalarizing functions and such functions may be constructed in many ways. We compare both theoretically and numerically the performance of three classification-based scalarizing functions and pay attention to how well they obey the classification information. In particular, we devote special interest to the differences the scalarizing functions have in the computational cost of guaranteeing Pareto optimality. It turns out that scalarizing functions with or without so-called augmentation terms have significant differences in this respect. We also collect a set of mostly nonlinear benchmark test problems that we use in the numerical comparisons.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
1872-6860
DOI:10.1016/j.ejor.2005.06.019