Kai-Xuan Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Kai-Xuan Zhang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Dong-Dong Xu
School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing 210044, China
1 shared publication - Jun Zhang
Hanyang University, ERICA Campus
1 shared publication - Qiang Yang
Nanjing University of Information Science and Technology
1 shared publication - Sang-Woon Jeon
Department of Electrical and Electronic Engineering, Hanyang University, Ansan, South Korea
1 shared publication - Xu-Dong Gao
School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing 210044, China
1 shared publication - Zhen-Yu Lu
School of Artificial Intelligence, Nanjing University of Information Science and Technology, Nanjing 210044, China
1 shared publication
Latest Publications
- Open Access
- 26 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (7) , 1072
A Dimension Group-Based Comprehensive Elite Learning Swarm Optimizer for Large-Scale Optimization
High-dimensional optimization problems are more and more common in the era of big data and the Internet of things (IoT), which seriously challenge the optimization performance of existing optimizers. To solve these kinds of problems effectively, this paper devises a dimension group-based comprehensive elite learning swarm optimizer (DGCELSO) by integrating valuable evolutionary information in different elite particles in the swarm to guide the updating of inferior ones. Specifically, the swarm is first separated into two exclusive sets, namely the elite set (ES) containing the top best individuals, and the non-elite set (NES), consisting of the remaining individuals. Then, the dimensions of each particle in NES are randomly divided into several groups with equal sizes. Subsequently, each dimension group of each non-elite particle is guided by two different elites randomly selected from ES. In this way, each non-elite particle in NES is comprehensively guided by multiple elite particles in ES. Therefore, not only could high diversity be maintained, but fast convergence is also likely guaranteed. To alleviate the sensitivity of DGCELSO to the associated parameters, we further devise dynamic adjustment strategies to change the parameter settings during the evolution. With the above mechanisms, DGCELSO is expected to explore and exploit the solution space properly to find the optimum solutions for optimization problems. Extensive experiments conducted on two commonly used large-scale benchmark problem sets demonstrate that DGCELSO achieves highly competitive or even much better performance than several state-of-the-art large-scale optimizers.
- 26 March 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (7) , 1072
Open AccessA Dimension Group-Based Comprehensive Elite Learning Swarm Optimizer for Large-Scale Optimization
High-dimensional optimization problems are more and more common in the era of big data and the Internet of things (IoT), which seriously challenge the optimization performance of existing optimizers. To solve these kinds of problems effectively, this paper devises a dimension group-based comprehensive elite learning swarm optimizer (DGCELSO) by integrating valuable evolutionary information in different elite particles in the swarm to guide the updating of inferior ones. Specifically, the swarm is first separated into two exclusive sets, namely the elite set (ES) containing the top best individuals, and the non-elite set (NES), consisting of the remaining individuals. Then, the dimensions of each particle in NES are randomly divided into several groups with equal sizes. Subsequently, each dimension group of each non-elite particle is guided by two different elites randomly selected from ES. In this way, each non-elite particle in NES is comprehensively guided by multiple elite particles in ES. Therefore, not only could high diversity be maintained, but fast convergence is also likely guaranteed. To alleviate the sensitivity of DGCELSO to the associated parameters, we further devise dynamic adjustment strategies to change the parameter settings during the evolution. With the above mechanisms, DGCELSO is expected to explore and exploit the solution space properly to find the optimum solutions for optimization problems. Extensive experiments conducted on two commonly used large-scale benchmark problem sets demonstrate that DGCELSO achieves highly competitive or even much better performance than several state-of-the-art large-scale optimizers.