A two-archive algorithm with decomposition and fitness allocation for multi-modal multi-objective optimization
| dc.cclicence | CC-BY-NC | en |
| dc.contributor.author | Li, Zhipan | |
| dc.contributor.author | Zou, Juan | |
| dc.contributor.author | Yang, Shengxiang | |
| dc.contributor.author | Zheng, Jinhua | |
| dc.date.acceptance | 2021-05-29 | |
| dc.date.accessioned | 2021-06-15T14:41:23Z | |
| dc.date.available | 2021-06-15T14:41:23Z | |
| dc.date.issued | 2021-06-05 | |
| 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 | This paper proposes a two-archive algorithm with decomposition and fitness allocation for multi-modal multi-objective optimization problems which have more than one Pareto-optimal solution set corresponding to the same objective vector. The general framework of the proposed method uses two archives, the convergence archive (CA) and the diversity archive (DA), which focus on the convergence and diversity of population, respectively. Both archives are based on a decomposition-based framework. In CA, the population update strategy adopts a fitness scheme, which is designed according to the change state of population during evolution, combining the convergence of the objective space with the diversity of the decision space. In DA, we use the crowding distance strategy to ensure the diversity of the decision space. Moreover, different neighborhood criteria are used to ensure the convergence and diversity of population for two archives. The algorithm is shown to not only locate and maintain a larger number of Pareto-optimal sets, but also to obtain good diversity and convergence in both the decision and objective spaces. In addition, the proposed algorithm is empirically compared with five state-of-the-art evolutionary algorithms on two series of test functions. Comparison results show that the proposed algorithm has better performance than the competing algorithms. | en |
| dc.funder | Other external funder (please detail below) | en |
| dc.funder.other | National Natural Science Foundation of China | en |
| dc.identifier.citation | Li, Z., Zou, J., Yang, S. and Zheng, J. (2021) A two-archive algorithm with decomposition and fitness allocation for multi-modal multi-objective optimization. Information Sciences. | en |
| dc.identifier.doi | https://doi.org/10.1016/j.ins.2021.05.075 | |
| dc.identifier.issn | 0020-0255 | |
| dc.identifier.uri | https://dora.dmu.ac.uk/handle/2086/21000 | |
| dc.language.iso | en_US | en |
| dc.peerreviewed | Yes | en |
| dc.projectid | 61876164, 61772178, and 61673331 | en |
| dc.publisher | Elsevier | en |
| dc.researchinstitute | Institute of Artificial Intelligence (IAI) | en |
| dc.subject | Multi-modal multi-objective optimization | en |
| dc.subject | two-archive | en |
| dc.subject | decomposition | en |
| dc.subject | fitness allocation | en |
| dc.subject | crowding distance strategy | en |
| dc.subject | neighborhood criteria | en |
| dc.title | A two-archive algorithm with decomposition and fitness allocation for multi-modal multi-objective optimization | en |
| dc.type | Article | en |