A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
dc.cclicence | N/A | en |
dc.contributor.author | Bai, Hui | en |
dc.contributor.author | Zheng, Jinhua | en |
dc.contributor.author | Yu, Guo | en |
dc.contributor.author | Yang, Shengxiang | en |
dc.contributor.author | Zou, Juan | en |
dc.date.acceptance | 2018-10-18 | en |
dc.date.accessioned | 2018-11-22T15:40:06Z | |
dc.date.available | 2018-11-22T15:40:06Z | |
dc.date.issued | 2018-10-30 | |
dc.description | The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link. | en |
dc.description.abstract | Evolutionary algorithms (EAs) have shown to be efficient in dealing with many-objective optimization problems (MaOPs) due to their ability to obtain a set of compromising solutions which not only converge toward the Pareto front (PF), but also distribute well. The Pareto-based multi-objective evolutionary algorithms are valid for solving optimization problems with two and three objectives. Nevertheless, when they encounter many-objective problems, they lose their effectiveness due to the weakening of selection pressure based on the Pareto dominance relation. Our major purpose is to develop more effective diversity maintenance mechanisms which cover convergence besides dominance in order to enhance the Pareto-based many-objective evolutionary algorithms. In this paper, we propose a Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation, abbreviated as SPSAT. The space partitioning selection increases selection pressure and maintains diversity simultaneously, which we realize through firstly dividing the normalized objective space into many subspaces and then selecting only one individual with the best proximity estimation value in each subspace. To further enhance convergence and diversity, the angle-based truncation calculates the angle values of any pair of individuals in the critical layer and then gradually removes the individuals with the minimum angle values. From the comparative experimental results with six state-of-the-art algorithms on a series of well-defined optimization problems with up to 20 objectives, the proposed algorithm shows its competitiveness in solving many-objective optimization problems. | en |
dc.funder | National Natural Science Foundation of China | en |
dc.funder | National Natural Science Foundation of China | en |
dc.funder | National Natural Science Foundation of China | en |
dc.identifier.citation | Bai, H., Zheng, J., Yu, G., Yang, S., and Zou, J. (2019) A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation. Information Sciences,478, pp. 186-207. | en |
dc.identifier.doi | https://doi.org/10.1016/j.ins.2018.10.027 | |
dc.identifier.issn | 0020-0255 | |
dc.identifier.uri | http://hdl.handle.net/2086/17260 | |
dc.language.iso | en_US | en |
dc.peerreviewed | Yes | en |
dc.projectid | 61876164 | en |
dc.projectid | 61502408 | en |
dc.projectid | 61673331 | en |
dc.publisher | Elsevier | en |
dc.researchgroup | Centre for Computational Intelligence | en |
dc.researchinstitute | Institute of Artificial Intelligence (IAI) | en |
dc.subject | Evolutionary multi-objective optimization | en |
dc.subject | Many-objective optimization | en |
dc.subject | Pareto optimality | en |
dc.subject | Space partitioning | en |
dc.subject | Angle-based truncation | en |
dc.title | A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation | en |
dc.type | Article | en |