dc.contributor.author | Chugh, T | |
dc.contributor.author | Sindhya, K | |
dc.contributor.author | Hakanen, J | |
dc.contributor.author | Miettinen, K | |
dc.date.accessioned | 2018-02-28T08:05:35Z | |
dc.date.issued | 2017-12-11 | |
dc.description.abstract | 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, also referred to as surrogates or metamodels are commonly used in the literature to reduce the computation time. This paper presents a survey of 45 different recent algorithms proposed in the literature between 2008 and 2016 to handle computationally expensive multiobjective optimization problems. Several algorithms are discussed based on what kind of an approximation such as problem, function or fitness approximation they use. Most emphasis is given to function approximation-based algorithms. We also compare these algorithms based on different criteria such as metamodeling technique and evolutionary algorithm used, type and dimensions of the problem solved, handling constraints, training time and the type of evolution control. Furthermore, we identify and discuss some promising elements and major issues among algorithms in the literature related to using an approximation and numerical settings used. In addition, we discuss selecting an algorithm to solve a given computationally expensive multiobjective optimization problem based on the dimensions in both objective and decision spaces and the computation budget available. | en_GB |
dc.description.sponsorship | The research of Tinkle Chugh was funded by the COMAS Doctoral Program (at the University of Jyväskylä) and FiDiPro Project DeCoMo (funded by Tekes, the Finnish Funding Agency for Innovation), and the research of Dr. Karthik Sindhya was funded by SIMPRO project funded by Tekes as well as DeCoMo. | en_GB |
dc.identifier.citation | pp. 1 - 30 | en_GB |
dc.identifier.doi | 10.1007/s00500-017-2965-0 | |
dc.identifier.uri | http://hdl.handle.net/10871/31730 | |
dc.language.iso | en | en_GB |
dc.publisher | Springer Verlag | en_GB |
dc.rights.embargoreason | Under embargo until 12 December 2018 in compliance with publisher policy. | en_GB |
dc.rights | © Springer-Verlag GmbH Germany, part of Springer Nature 2017 | en_GB |
dc.subject | Surrogate | en_GB |
dc.subject | Metamodel | en_GB |
dc.subject | Machine learning | en_GB |
dc.subject | Multicriteria optimization | en_GB |
dc.subject | Computational cost | en_GB |
dc.subject | Response surface approximation | en_GB |
dc.subject | Pareto optimality | en_GB |
dc.title | A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms | en_GB |
dc.type | Article | en_GB |
dc.identifier.issn | 1432-7643 | |
dc.description | This is the author accepted manuscript. The final version is available from Springer Verlag via the DOI in this record. | en_GB |
dc.identifier.journal | Soft Computing | en_GB |
refterms.dateFOA | 2019-11-04T12:17:54Z | |