dc.contributor.author | Habib, A | |
dc.contributor.author | Chugh, T | |
dc.contributor.author | Singh, HK | |
dc.contributor.author | Ray, T | |
dc.contributor.author | Miettinen, K | |
dc.date.accessioned | 2019-02-13T11:55:47Z | |
dc.date.issued | 2019-02-12 | |
dc.description.abstract | Many-objective optimization problems (MaOP) contain four or more conflicting objectives to be optimized. A number of efficient decomposition-based evolutionary algorithms have been developed in the recent years to solve them. However, computationally expensive MaOPs have been scarcely investigated. Typically, surrogate-assisted methods have been used in the literature to tackle computationally expensive problems, but such studies have largely focused on problems with 1-3 objectives. In this study, we present an approach called HSMEA to solve computationally expensive MaOPs. The key features of the approach include (a) the use of multiple surrogates to effectively approximate a wide range of objective functions, (b) use of two sets of reference vectors for improved performance on irregular Pareto fronts, (c) effective use of archive solutions during offspring generation and (d) a local improvement scheme for generating high quality infill solutions. Furthermore, the approach includes constraint handling which is often overlooked in contemporary algorithms. The performance of the approach is benchmarked extensively on a set of unconstrained and constrained problems with regular and irregular Pareto fronts. A statistical comparison with the existing techniques highlights the efficacy and potential of the approach. | en_GB |
dc.description.sponsorship | Natural Environment Research Council (NERC) | en_GB |
dc.description.sponsorship | Australian Research Council (ARC) | en_GB |
dc.identifier.citation | Published Online 12 February 2019 | en_GB |
dc.identifier.doi | 10.1109/TEVC.2019.2899030 | |
dc.identifier.grantnumber | NE/P017436/1 | en_GB |
dc.identifier.grantnumber | DP190101271 | en_GB |
dc.identifier.uri | http://hdl.handle.net/10871/35930 | |
dc.language.iso | en | en_GB |
dc.publisher | Institute of Electrical and Electronics Engineers | en_GB |
dc.relation.url | https://ieeexplore.ieee.org/document/8640100 | en_GB |
dc.rights | © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be
obtained for all other uses, in any current or future media, including
reprinting/republishing this material for advertising or promotional purposes, creating new
collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted
component of this work in other works. | en_GB |
dc.subject | multiobjective optimisation | en_GB |
dc.subject | machine learning | en_GB |
dc.subject | metamodels | en_GB |
dc.subject | heuristics | en_GB |
dc.subject | optimisation | en_GB |
dc.subject | evolutionary computation | en_GB |
dc.title | A multiple surrogate assisted decomposition based evolutionary algorithm for expensive multi/many-objective optimization | en_GB |
dc.type | Article | en_GB |
dc.date.available | 2019-02-13T11:55:47Z | |
dc.identifier.issn | 1089-778X | |
dc.description | This is the author accepted manuscript. The final version is available from the publisher via the DOI in this record | en_GB |
dc.identifier.journal | IEEE Transactions on Evolutionary Computation | en_GB |
dc.rights.uri | http://www.rioxx.net/licenses/all-rights-reserved | en_GB |
dcterms.dateAccepted | 2019-02-03 | |
rioxxterms.version | AM | en_GB |
rioxxterms.licenseref.startdate | 2019-02-12 | |
rioxxterms.type | Journal Article/Review | en_GB |
refterms.dateFCD | 2019-02-13T10:35:11Z | |
refterms.versionFCD | AM | |
refterms.dateFOA | 2019-02-13T11:55:48Z | |
refterms.panel | B | en_GB |