Interactive multiobjective optimization of an extremely computationally expensive pump design problem
Burkotová, J., Aghaei Pour, P., Krátký, T., & Miettinen, K. (2023). Interactive multiobjective optimization of an extremely computationally expensive pump design problem. Engineering Optimization, Early online. https://doi.org/10.1080/0305215x.2023.2247369
Published in
Engineering OptimizationDate
2023Discipline
Laskennallinen tiedeMultiobjective Optimization GroupHyvinvoinnin tutkimuksen yhteisöPäätöksen teko monitavoitteisestiComputational ScienceMultiobjective Optimization GroupSchool of WellbeingDecision analytics utilizing causal models and multiobjective optimizationCopyright
© 2023 the Authors
The hydraulic design of a pump is a challenging optimization problem. It has multiple conflicting objective functions based on computationally very expensive (16–20 hours) numerical simulations, and simulation failures, meaning that simulation calls can be unsuccessful. In this article, a surrogate-assisted evolutionary interactive multiobjective optimization method is applied to designing a pump stator. A decision maker's preferences are iteratively incorporated into the solution process and the advantages of an interactive method are demonstrated in two areas: (1) reducing the computation time; and (2) finding a preferred solution that reflects the decision maker's preferences with a low cognitive load. The decision maker was satisfied with the interactive solution process and the final solution reflected his preferences well. Additionally, because he was familiar with the domain of the problem, the preferences he provided guided the search in directions where no failed simulations were encountered. Importantly, the applied method could save days of computation time.
...
Publisher
Taylor & FrancisISSN Search the Publication Forum
0305-215XKeywords
Publication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/184767800
Metadata
Show full item recordCollections
Additional information about funding
This research was supported by the Ministry of Education, Youth and Sports of the Czech Republic under the project ‘Hydrodynamic design of pumps’ [CZ.02.1.01/0.0/0.0/17_049/0008408] and under the project ‘Support of Mobility at Palacký University Olomouc II' [CZ.02.2.69/0.0/0.0/18_053/0016919]; computational resources were supplied by the project ‘e-Infrastruktura CZ’ [e-INFRA CZ LM2018140] supported by the Ministry of Education, Youth and Sports of the Czech Republic. ...License
Related items
Showing items with similar title or keywords.
-
On solving computationally expensive multiobjective optimization problems with interactive methods
Ojalehto, Vesa (University of Jyväskylä, 2014) -
Approximation method for computationally expensive nonconvex multiobjective optimization problems
Haanpää, Tomi (University of Jyväskylä, 2012) -
An interactive surrogate-based method for computationally expensive multiobjective optimisation
Tabatabaei, Mohammad; Hartikainen, Markus; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Palgrave Macmillan Ltd., 2019)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 ... -
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 ... -
A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms
Chugh, Tinkle; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Springer, 2019)Evolutionary algorithms are widely used for solving multiobjective optimization problems but are often criticized because of a large number of function evaluations needed. Approximations, especially function approximations, ...