An interactive surrogate-based method for computationally expensive multiobjective optimisation
Tabatabaei, M., Hartikainen, M., Sindhya, K., Hakanen, J., & Miettinen, K. (2019). An interactive surrogate-based method for computationally expensive multiobjective optimisation. Journal of the Operational Research Society, 70(6), 898-914. https://doi.org/10.1080/01605682.2018.1468860
Published in
Journal of the Operational Research SocietyAuthors
Date
2019Discipline
TietotekniikkaMultiobjective Optimization GroupLaskennallinen tiedeMathematical Information TechnologyMultiobjective Optimization GroupComputational ScienceCopyright
© 2018 Operational Research Society
Many disciplines involve computationally expensive multiobjective optimisation problems. Surrogate-based methods are commonly used in the literature to alleviate the computational cost. In this paper, we develop an interactive surrogate-based method called SURROGATE-ASF to solve computationally expensive multiobjective optimisation problems. This method employs preference information of a decision-maker. Numerical results demonstrate that SURROGATE-ASF efficiently provides preferred solutions for a decision-maker. It can handle different types of problems involving for example multimodal objective functions and nonconvex and/or disconnected Pareto frontiers.
Publisher
Palgrave Macmillan Ltd.ISSN Search the Publication Forum
0160-5682Keywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/28059820
Metadata
Show full item recordCollections
Related funder(s)
Research Council of FinlandFunding program(s)
Academy Project, AoFAdditional information about funding
This work was partly funded by the COMAS Doctoral Program at the University of Jyvaskyla, the Academy of Finland [project No. 287496], Early Career Scheme (ECS) sponsored by the Research Grants Council of Hong Kong [project No. 21201414 (Dr. Matthias Hwai Yong Tan)] and the KAUTE Foundation.License
Related items
Showing items with similar title or keywords.
-
Handling expensive multiobjective optimization problems with evolutionary algorithms
Chugh, Tinkle (University of Jyväskylä, 2017)Multiobjective optimization problems (MOPs) with a large number of conflicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ... -
On approaches for solving computationally expensive multiobjective optimization problems
Tabatabaei, Seyed Mohammad Mehdi (University of Jyväskylä, 2016)In this thesis, we consider solving computationally expensive multiobjective optimization problems that take into account the preferences of a decision maker (DM). The aim is to support the DM in identifying the most ... -
Data-driven interactive multiobjective optimization using cluster based surrogate in discrete decision space
Malmberg, Jose (2018)Tutkielma esittää klusteripohjaisen sijaismallin diskreetin päätöksentekoavaruuden dimension pienentämiseksi ja lineaaristen kokonaislukuoptimointitehtävien yksinkertaistamiseksi. Sijaismalli on suunnattu erityisesti ... -
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
Interactive data-driven multiobjective optimization of metallurgical properties of microalloyed steels using the DESDEO framework
Saini, Bhupinder Singh; Chakrabarti, Debalay; Chakraborti, Nirupam; Shavazipour, Babooshka; Miettinen, Kaisa (Elsevier BV, 2023)Solving real-life data-driven multiobjective optimization problems involves many complicated challenges. These challenges include preprocessing the data, modelling the objective functions, getting a meaningful formulation ...