Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems
- Title
- Heterogeneous cognitive learning particle swarm optimization for large-scale optimization problems
- Author
- 전상운
- Keywords
- Heterogeneous cognitive learning; Particle swarm optimization; Random elite cognitive learning; Stochastic dominant cognitive learning; Large-scale optimization
- Issue Date
- 2023-07
- Publisher
- ELSEVIER SCIENCE INC
- Citation
- INFORMATION SCIENCES, v. 633, Page. 321.0-342.0
- Abstract
- Large-scale optimization problems (LSOPs) become increasingly ubiquitous but complicated in real-world scenarios. Confronted with such sophisticated optimization problems, most existing optimizers dramatically lose their effectiveness. To tackle this type of problems effectively, we propose a heterogeneous cognitive learning particle swarm optimizer (HCLPSO). Unlike most existing particle swarm optimizers (PSOs), HCLPSO partitions particles in the current swarm into two categories, namely superior particles (SP) and inferior particles (IP), based on their fitness, and then treats the two categories of particles differently. For inferior particles, this paper devises a random elite cognitive learning (RECL) strategy to update each one with a random superior particle chosen from SP. For superior particles, this paper designs a stochastic dominant cognitive learning (SDCL) strategy to evolve each one by randomly selecting one guiding exemplar from SP and then updating it only when the selected exemplar is better. With the collaboration between these two learning mechanisms, HCLPSO expectedly evolves particles effectively to explore the search space and exploit the found optimal zones appropriately to find optimal solutions to LSOPs. Furthermore, to help HCLPSO traverse the vast search space with promising compromise between intensification and diversification, this paper devises a dynamic swarm partition scheme to dynamically separate particles into the two categories. With this dynamic strategy, HCLPSO gradually switches from exploring the search space to exploiting the found optimal zones intensively. Experiments are executed on the publicly acknowledged CEC2010 and CEC2013 LSOP benchmark suites to compare HCLPSO with several state-of-the-art approaches. Experimental results reveal that HCLPSO is effective to tackle LSOPs, and attains considerably competitive or even far better optimization performance than the compared state-of-the-art largescale methods. Furthermore, the effectiveness of each component in HCLPSO and the good scalability of HCLPSO are also experimentally verified.
- URI
- https://www.sciencedirect.com/science/article/pii/S0020025523003924?via%3Dihubhttps://repository.hanyang.ac.kr/handle/20.500.11754/180681
- ISSN
- 0020-0255;1872-6291
- DOI
- 10.1016/j.ins.2023.03.086
- Appears in Collections:
- COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > MILITARY INFORMATION ENGINEERING(국방정보공학과) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML