Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/24855
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Xue, Y | - |
dc.contributor.author | Li, M | - |
dc.contributor.author | Liu, X | - |
dc.date.accessioned | 2022-07-12T11:10:40Z | - |
dc.date.available | 2022-07-12T11:10:40Z | - |
dc.date.issued | 2022-10-20 | - |
dc.identifier | ORCID iDs: Yani Xue https://orcid.org/0000-0002-7526-9085; Xiaohui Liu https://orcid.org/0000-0003-1589-1267 | - |
dc.identifier | arXiv:2205.15884 [cs.NE] | - |
dc.identifier.citation | Xue, Y., Li, M. and Liu, X. (2022) 'An effective and efficient evolutionary algorithm for many-objective optimization', Information Sciences, 617, pp. 211 - 233. doi: 10.1016/j.ins.2022.10.077. | en_US |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/24855 | - |
dc.description | Accepted manuscript, available online at arXiv: https://doi.org/10.48550/arXiv.2205.15884 | en_US |
dc.description.abstract | In evolutionary multi-objective optimization, effectiveness refers to how an evolutionary algorithm performs in terms of converging its solutions into the Pareto front and also diversifying them over the front. This is not an easy job, particularly for optimization problems with more than three objectives, dubbed many-objective optimization problems. In such problems, classic Pareto-based algorithms fail to provide sufficient selection pressure towards the Pareto front, whilst recently developed algorithms, such as decomposition-based ones, may struggle to maintain a set of well-distributed solutions on certain problems (e.g., those with irregular Pareto fronts). Another issue in some many-objective optimizers is rapidly increasing computational requirement with the number of objectives, such as hypervolume-based algorithms and shift-based density estimation (SDE) methods. In this paper, we aim to address this problem and develop an effective and efficient evolutionary algorithm (E3A) that can handle various many-objective problems. In E3A, inspired by SDE, a novel population maintenance method is proposed. We conduct extensive experiments and show that E3A performs better than 11 state-of-the-art many-objective evolutionary algorithms in quickly finding a set of well-converged and well-diversified solutions. | en_US |
dc.format.medium | Print-Electronic | - |
dc.language.iso | en_US | en_US |
dc.relation.uri | https://doi.org/10.48550/arXiv.2205.15884 | - |
dc.rights | Copyright © 2022 Elsevier Inc. All rights reserved. his is the accepted manuscript version of an article which has been published in final form at https://doi.org/10.1016/j.ins.2022.10.077, made available on this repository under a Creative Commons CC BY-NC-ND attribution licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). | - |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.subject | evolutionary algorithms | en_US |
dc.subject | many-objective optimization | en_US |
dc.subject | effectiveness | en_US |
dc.subject | efficiency | en_US |
dc.title | An effective and efficient evolutionary algorithm for many-objective optimization | en_US |
dc.type | Article | en_US |
dc.identifier.doi | https://doi.org/10.1016/j.ins.2022.10.077 | - |
pubs.notes | 25 pages, 5 figures, to appear in Information Sciences | - |
dc.identifier.eissn | 1872-6291 | - |
dc.rights.holder | Elsevier Inc. | - |
Appears in Collections: | Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Copyright © 2022 Elsevier Inc. All rights reserved. his is the accepted manuscript version of an article which has been published in final form at https://doi.org/10.1016/j.ins.2022.10.077, made available on this repository under a Creative Commons CC BY-NC-ND attribution licence (https://creativecommons.org/licenses/by-nc-nd/4.0/). | 1.6 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License