Individual-Level Dominant Exemplar Selection for Particle Swarm Optimization
Leading exemplars play significant roles in updating particles to seek optimal solutions for Particle Swarm Optimization (PSO). Along this road, this paper devises an Individual-level Dominant Exemplar Selection (IDES) framework for PSO, giving rise to a new PSO variant named IDESPSO. Specifically, instead of using their own personally best positions and the globally best position of the entire swarm to update particles, IDES first randomly chooses two different exemplars for each particle from all personally best positions. Then, it compares the two selected exemplars with the personally best position of this particle. Based on the comparison results, different updating strategies are utilized to update different particles. This method notably enriches the variety among the chosen leading exemplars, thereby substantially bolstering the updating diversity of particles. Under IDES, this paper further develops seven selection strategies to help IDESPSO pick up promising exemplars for particles to evolve. Specifically, the seven selection schemes are the roulette wheel selection, the tournament selection, and five hybridizations of two basic models. A series of experiments have been undertaken on the universally used CEC2014 problem suite to compare IDESPSO with the seven selection schemes and two classic PSOs. The empirical results show that IDESPSO paired with anyone of the seven selection methods, markedly outperforms the two classical PSO variants, highlighting its significant performance.
Authors
- Qiang Yang (ORCID: https://orcid.org/0000-0003-0277-3077)
- Zhenyu Lu (ORCID: https://orcid.org/0000-0002-5066-4716)
- Dan-Ting Duan (ORCID: https://orcid.org/0009-0005-3861-2488)
- Peilan Xu (ORCID: https://orcid.org/0000-0002-6627-2514)
- Hui Wang (ORCID: https://orcid.org/0000-0001-8213-1626)
- Xudong Gao (ORCID: https://orcid.org/0000-0002-0750-9198)
- Xin Lin
- Jun Zhang (ORCID: https://orcid.org/0000-0002-5245-7956)
Institutions
- Nanjing University of Information Science and Technology (CN)
- Hanyang University (KR)
- Communication University of China (CN)
Publication Details
- Published
- 2024-10-06
- DOI
- https://doi.org/10.1109/smc54092.2024.10831847
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Hanyang University
- National Key Research and Development Program of China