Random Contrastive Interaction for Particle Swarm Optimization in High-Dimensional Environment
Qiang Yang, Gong-Wei Song, Wei–Neng Chen, Ya-Hui Jia, Xudong Gao, Zhenyu Lu, Sang-Woon Jeon, Jun Zhang
Nanjing University of Information Science and Technology South China University of Technology Hanyang University Zhejiang Normal University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
In high dimensional environment, the interaction among particles significantly affects their movements in searching the vast solution space and thus plays a vital role in assisting particle swarm optimization (PSO) to attain good performance. To this end, this paper designs a random contrastive interaction (RCI) strategy for PSO, resulting in RCI-PSO, to tackle large-scale optimization problems (LSOPs) effectively and efficiently. Unlike existing interaction mechanisms for low-dimensional problems, RCI randomly chooses several different peers from the current swarm to construct a random interaction topology for each particle. Then, it lets the particle interact with the selected peers based on their current evolutionary information instead of their historical evolutionary information. Within the topology, RCI only propagates the evolutionary information of two contrastive dominators with the largest difference in fitness to direct the evolution of the particle. Therefore, particles with no more than two dominators in their topologies are not updated. Furthermore, a dynamic topology size adjustment scheme is devised to gradually enlarge the interaction topology. In this way, the swarm gradually switches from exploring the immense search space dispersedly to exploiting the found optimal regions intensively as the evolution continues. With these two strategies, RCI-PSO expectedly compromises search diversity and search convergence well at the swarm level and the particle level. At last, extensive experiments executed on two public LSOP suites verify that RCI-PSO performs competitively with or even much better than totally 40 state-of-theart large-scale approaches and preserves a good capability and scalability in tackling complex LSOPs.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIMetaheuristic Optimization Algorithms Research
Advanced Multi-Objective Optimization Algorithms · Vehicle Routing Optimization Methods
参考文献 96
此处列出前 3 条
引用本文 74
按被引量排序,此处列出前 3 条