Cross-Generation Elites Guided Particle Swarm Optimization for Large Scale Optimization

被引:0
作者
Xie, Han-Yu [1 ]
Yang, Qiang [1 ,2 ]
Hu, Xiao-Min [3 ]
Chen, Wei-Neng [2 ]
机构
[1] Sun Yat Sen Univ, Sch Data & Comp Sci, Guangzhou, Guangdong, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China
[3] Guangdong Univ Technol, Sch Comp Sci & Engn, Guangzhou, Guangdong, Peoples R China
来源
PROCEEDINGS OF 2016 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI) | 2016年
基金
中国国家自然科学基金;
关键词
Cross-Generation Elites; Elites; Partilce Swarm Optimization; Large Scale Optimization; Numerical Optimization; COOPERATIVE COEVOLUTION; EVOLUTIONARY ALGORITHM; ARCHIVES; MEMORY;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Elites have been widely used in many evolutionary algorithms. However, only elites in current generation are utilized to guide the learning/updating of particles/individuals in existing algorithms. Usually, elites in different generations are different and elites in the past generations may contain experienced knowledge and thus may be helpful for guiding particles/individuals to promising areas. Inspired from this, we propose a Cross-generation Elites Guided Particle Swarm Optimizer in this paper. Specifically, the swarm in current generation is divided into two separate sets: the elite set containing the top best particles and the non-elite set consisting of the rest particles. Since these elite particles are the most promising ones in the current generation, we remain these elites unchanged and let them directly enter next generation. Then the rest non-elite particles are updated through learning from elites in both the current generation and the last generation. Through this, a potential balance between exploration and exploitation can be achieved. Particularly, the proposed algorithm is applied to deal with large scale optimization, which is very challenging and difficult and has received a lot of attention in recent years. Extensive experiments are conducted on two sets of large scale benchmark functions and experimental results verify the competitive effectiveness and efficiency of the proposed algorithm in comparison with several state-of-the-art large scale evolutionary algorithms.
引用
收藏
页数:8
相关论文
共 50 条
  • [1] [Anonymous], 1997, THESIS
  • [2] [Anonymous], 2012, APPL COMPUT INTELL S
  • [3] [Anonymous], 2010, BENCHMARK FUNCTIONS
  • [4] [Anonymous], BENCHMARK FUNCTIONS
  • [5] [Anonymous], ACM T MATH IN PRESS
  • [6] Bare Bones Particle Swarm Optimization With Scale Matrix Adaptation
    Campos, Mauro
    Krohling, Renato A.
    Enriquez, Ivan
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (09) : 1567 - 1578
  • [7] An Evolutionary Algorithm with Double-Level Archives for Multiobjective Optimization
    Chen, Ni
    Chen, Wei-Neng
    Gong, Yue-Jiao
    Zhan, Zhi-Hui
    Zhang, Jun
    Li, Yun
    Tan, Yu-Song
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (09) : 1851 - 1863
  • [8] Particle Swarm Optimization with an Aging Leader and Challengers
    Chen, Wei-Neng
    Zhang, Jun
    Lin, Ying
    Chen, Ni
    Zhan, Zhi-Hui
    Chung, Henry Shu-Hung
    Li, Yun
    Shi, Yu-Hui
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2013, 17 (02) : 241 - 258
  • [9] A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
    Chen, Wei-Neng
    Zhang, Jun
    Chung, Henry S. H.
    Zhong, Wen-Liang
    Wu, Wei-Gang
    Shi, Yu-hui
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (02) : 278 - 300
  • [10] A Competitive Swarm Optimizer for Large Scale Optimization
    Cheng, Ran
    Jin, Yaochu
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2015, 45 (02) : 191 - 204