Experiments with classification-based scalarizing functions in interactive multiobjective optimization
2006 (English)In: European Journal of Operational Research, ISSN 0377-2217, Vol. 175, no 2, 931-947 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2006. Vol. 175, no 2, 931-947 p.
Multiple objective programming, Classification, Interactive methods, Test problems, Guaranteeing Pareto optimality
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-83672DOI: 10.1016/j.ejor.2005.06.019ISI: 000241063500018OAI: oai:DiVA.org:kth-83672DiVA: diva2:498897
QC 201202272012-02-122012-02-122012-02-27Bibliographically approved