An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization
Abstract Sparse large-scale multiobjective optimization problems (sparse LSMOPs) are characterized by an enormous number of decision variables, and their Pareto optimal solutions consist of a majority of decision variables with zero values. This property of sparse LSMOPs presents a great challenge i...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-01-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-024-01752-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1823861484838453248 |
|---|---|
| author | Panpan Zhang Hang Yin Ye Tian Xingyi Zhang |
| author_facet | Panpan Zhang Hang Yin Ye Tian Xingyi Zhang |
| author_sort | Panpan Zhang |
| collection | DOAJ |
| description | Abstract Sparse large-scale multiobjective optimization problems (sparse LSMOPs) are characterized by an enormous number of decision variables, and their Pareto optimal solutions consist of a majority of decision variables with zero values. This property of sparse LSMOPs presents a great challenge in terms of how to rapidly and precisely search for Pareto optimal solutions. To deal with this issue, this paper proposes an adjoint feature-selection-based evolutionary algorithm tailored for tackling sparse LSMOPs. The proposed optimization strategy combines two distinct feature selection approaches. Specifically, the paper introduces the sequential forward selection approach to investigate independent sparse distribution, denoting it as the best sequence of decision variables for generating a high-quality initial population. Furthermore, it introduces the Relief approach to determine the relative sparse distribution, identifying crucial decisive variables with dynamic updates to guide the population in a promising evolutionary direction. Experiments are conducted on eight benchmark problems and two real-world problems, and experimental results verify that the proposed algorithm outperforms the existing state-of-the-art evolutionary algorithms for solving sparse LSMOPs. |
| format | Article |
| id | doaj-art-93ec0fcaee4241db882df7f201c45148 |
| institution | Kabale University |
| issn | 2199-4536 2198-6053 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Springer |
| record_format | Article |
| series | Complex & Intelligent Systems |
| spelling | doaj-art-93ec0fcaee4241db882df7f201c451482025-02-09T13:01:11ZengSpringerComplex & Intelligent Systems2199-45362198-60532025-01-0111211810.1007/s40747-024-01752-1An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimizationPanpan Zhang0Hang Yin1Ye Tian2Xingyi Zhang3School of Electrical Engineering, Xi’an University of TechnologyInstitutes of Physical Science and Information Technology, Anhui UniversitySchool of Computer Science and Technology, Anhui UniversitySchool of Computer Science and Technology, Anhui UniversityAbstract Sparse large-scale multiobjective optimization problems (sparse LSMOPs) are characterized by an enormous number of decision variables, and their Pareto optimal solutions consist of a majority of decision variables with zero values. This property of sparse LSMOPs presents a great challenge in terms of how to rapidly and precisely search for Pareto optimal solutions. To deal with this issue, this paper proposes an adjoint feature-selection-based evolutionary algorithm tailored for tackling sparse LSMOPs. The proposed optimization strategy combines two distinct feature selection approaches. Specifically, the paper introduces the sequential forward selection approach to investigate independent sparse distribution, denoting it as the best sequence of decision variables for generating a high-quality initial population. Furthermore, it introduces the Relief approach to determine the relative sparse distribution, identifying crucial decisive variables with dynamic updates to guide the population in a promising evolutionary direction. Experiments are conducted on eight benchmark problems and two real-world problems, and experimental results verify that the proposed algorithm outperforms the existing state-of-the-art evolutionary algorithms for solving sparse LSMOPs.https://doi.org/10.1007/s40747-024-01752-1Large-scale multiobjective optimizationSparse optimizationEvolutionary algorithmAdjoint feature selectionSparse distribution |
| spellingShingle | Panpan Zhang Hang Yin Ye Tian Xingyi Zhang An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization Complex & Intelligent Systems Large-scale multiobjective optimization Sparse optimization Evolutionary algorithm Adjoint feature selection Sparse distribution |
| title | An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization |
| title_full | An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization |
| title_fullStr | An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization |
| title_full_unstemmed | An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization |
| title_short | An adjoint feature-selection-based evolutionary algorithm for sparse large-scale multiobjective optimization |
| title_sort | adjoint feature selection based evolutionary algorithm for sparse large scale multiobjective optimization |
| topic | Large-scale multiobjective optimization Sparse optimization Evolutionary algorithm Adjoint feature selection Sparse distribution |
| url | https://doi.org/10.1007/s40747-024-01752-1 |
| work_keys_str_mv | AT panpanzhang anadjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT hangyin anadjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT yetian anadjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT xingyizhang anadjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT panpanzhang adjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT hangyin adjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT yetian adjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization AT xingyizhang adjointfeatureselectionbasedevolutionaryalgorithmforsparselargescalemultiobjectiveoptimization |