On Using Decision Maker Preferences with ParEGO
Hakanen, J., & Knowles, J. D. (2017). On Using Decision Maker Preferences with ParEGO. In H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. Wiecek, Y. Jin, & C. Grimme (Eds.), Evolutionary Multi-Criterion Optimization : 9th International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, Proceedings (pp. 282-297). Springer International Publishing. Lecture Notes in Computer Science, 10173. https://doi.org/10.1007/978-3-319-54157-0_20
Julkaistu sarjassa
Lecture Notes in Computer ScienceToimittajat
Päivämäärä
2017Tekijänoikeudet
© 2017 Springer International Publishing AG. This is a final draft version of an article whose final and definitive form has been published by Springer. Published in this repository with the kind permission of the publisher.
In this paper, an interactive version of the ParEGO algorithm is introduced for identifying most preferred solutions for computationally expensive multiobjective optimization problems. It enables a decision maker to guide the search with her preferences and change them in case new insight is gained about the feasibility of the preferences. At each interaction, the decision maker is shown a subset of non-dominated solutions and she is assumed to provide her preferences in the form of preferred ranges for each objective. Internally, the algorithm samples reference points within the hyperbox defined by the preferred ranges in the objective space and uses a DACE model to approximate an achievement (scalarizing) function as a single objective to scalarize the problem. The resulting solution is then evaluated with the real objective functions and used to improve the DACE model in further iterations. The potential of the proposed algorithm is illustrated via a four-objective optimization problem related to water management with promising results.
...
Julkaisija
Springer International PublishingEmojulkaisun ISBN
978-3-319-54156-3Konferenssi
International Conference on Evolutionary Multi-Criterion OptimizationKuuluu julkaisuun
Evolutionary Multi-Criterion Optimization : 9th International Conference, EMO 2017, Münster, Germany, March 19-22, 2017, ProceedingsISSN Hae Julkaisufoorumista
0302-9743Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/26560837
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
Saini, Bhupinder Singh; Emmerich, Michael; Mazumdar, Atanu; Afsar, Bekir; Shavazipour, Babooshka; Miettinen, Kaisa (Springer Science and Business Media LLC, 2022)We introduce novel concepts to solve multiobjective optimization problems involving (computationally) expensive function evaluations and propose a new interactive method called O-NAUTILUS. It combines ideas of trade-off ... -
Data-Driven Interactive Multiobjective Optimization Using a Cluster-Based Surrogate in a Discrete Decision Space
Hakanen, Jussi; Malmberg, Jose; Ojalehto, Vesa; Eyvindson, Kyle (Springer, 2019)In this paper, a clustering based surrogate is proposed to be used in offline data-driven multiobjective optimization to reduce the size of the optimization problem in the decision space. The surrogate is combined with an ... -
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
Approximation through interpolation in nonconvex multiobjective optimization
Hartikainen, Markus (University of Jyväskylä, 2011) -
Surrogate assisted interactive multiobjective optimization in energy system design of buildings
Aghaei Pour, Pouya; Rodemann, Tobias; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2022)In this paper, we develop a novel evolutionary interactive method called interactive K-RVEA, which is suitable for computationally expensive problems. We use surrogate models to replace the original expensive objective ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.