An evolutionary algorithm based on dynamic sparse grouping for sparse large scale multiobjective optimization
dc.cclicence | CC-BY-NC-ND | en |
dc.contributor.author | Zou, Yingjie | |
dc.contributor.author | Liu, Yuan | |
dc.contributor.author | Zou, Juan | |
dc.contributor.author | Yang, Shengxiang | |
dc.contributor.author | Zheng, Jinhua | |
dc.date.acceptance | 2023-02-18 | |
dc.date.accessioned | 2023-03-09T15:43:24Z | |
dc.date.available | 2023-03-09T15:43:24Z | |
dc.date.issued | 2023-03-09 | |
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 | Sparse large scale multiobjective optimization problems (sparse LSMOPs) contain numerous decision variables, and their Pareto optimal solutions' decision variables are very sparse (i.e., the majority of these solutions' decision variables are zero-valued). This poses grand challenges to an algorithm in converging to the Pareto set. Numerous evolutionary algorithms (EAs) tailored for sparse LSMOPs have been proposed in recent years. However, the final population generated by these EAs is not sparse enough because the location of the nonzero decision variables is difficult to locate accurately and there is insufficient interaction between the nonzero decision variables' locating process and the nonzero decision variables' optimizing process. To address this issue, we propose a dynamic sparse grouping evolutionary algorithm (DSGEA) that dynamically groups decision variables in the population that have a comparable amount of nonzero decision variables. Improved evolutionary operators are introduced to optimize the decision variables in groups. As a result, the population obtained by DSGEA can stably evolve towards the sparser Pareto optimal that has a precise location of nonzero decision variables. The proposed algorithm outperforms existing up-to-date EAs for sparse LSMOPs in experiments on three real-world problems and eight benchmark problems. | en |
dc.funder | Other external funder (please detail below) | en |
dc.funder.other | National Natural Science Foundation of China | en |
dc.funder.other | atural Science Foundation of Hunan Province, China | en |
dc.identifier.citation | Y. Zou, Y. Liu, J. Zou, S. Yang, and J. Zheng. (2023) An evolutionary algorithm based on dynamic sparse grouping for sparse large scale multiobjective optimization. Information Sciences, 631, pp. 449-467 | en |
dc.identifier.doi | https://doi.org/10.1016/j.ins.2023.02.062 | |
dc.identifier.uri | https://hdl.handle.net/2086/22588 | |
dc.language.iso | en_US | en |
dc.peerreviewed | Yes | en |
dc.projectid | 62176228, 61876164 | en |
dc.projectid | 2022JJ40452, 2020JJ4590 | en |
dc.publisher | Elsevier | en |
dc.researchinstitute | Institute of Artificial Intelligence (IAI) | en |
dc.subject | Decision variable grouping | en |
dc.subject | Evolutionary algorithm | en |
dc.subject | Large scale multiobjective optimization | en |
dc.subject | Sparse multiobjective optimization | en |
dc.title | An evolutionary algorithm based on dynamic sparse grouping for sparse large scale multiobjective optimization | en |
dc.type | Article | en |