Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization: From Population Diversity Perspective

被引:51
作者
Cheng, Shi [1 ,2 ]
Shi, Yuhui [2 ]
Qin, Quande [3 ]
机构
[1] Univ Liverpool, Dept Elect Engn & Elect, Liverpool, Merseyside, England
[2] Xian Jiaotong Liverpool Univ, Dept Elect & Elect Engn, Suzhou, Peoples R China
[3] Shenzhen Univ, Coll Management, Shenzhen, Peoples R China
基金
中国国家自然科学基金;
关键词
Boundary Constraints Handling; Exploration and Exploitation; Particle Swarm Optimization; Population Diversity; Position Diversity;
D O I
10.4018/jsir.2011070104
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Premature convergence happens in Particle Swarm Optimization (PSO) for solving both multimodal problems and unimodal problems. With an improper boundary constraints handling method, particles may get "stuck in" the boundary. Premature convergence means that an algorithm has lost its ability of exploration. Population diversity is an effective way to monitor an algorithm's ability of exploration and exploitation. Through the population diversity measurement, useful search information can be obtained. PSO with a different topology structure and a different boundary constraints handling strategy will have a different impact on particles' exploration and exploitation ability. In this paper, the phenomenon of particles gets "stuck in" the boundary in PSO is experimentally studied and reported. The authors observe the position diversity time-changing curves of PSOs with different topologies and different boundary constraints handling techniques, and analyze the impact of these setting on the algorithm's ability of exploration and exploitation. From these experimental studies, an algorithm's ability of exploration and exploitation can be observed and the search information obtained; therefore, more effective algorithms can be designed to solve problems.
引用
收藏
页码:43 / 69
页数:27
相关论文
共 28 条
  • [1] Bentley P, 1999, EVOLUTIONARY DESIGN
  • [2] Blackwell TM, 2002, IEEE C EVOL COMPUTAT, P1691, DOI 10.1109/CEC.2002.1004497
  • [3] Defining a standard for particle swarm optimization
    Bratton, Daniel
    Kennedy, James
    [J]. 2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, : 120 - +
  • [4] Chen S., 2011, P 13 ANN C COMP GEN, P811
  • [5] Cheng S., 2011, P 2011 IEEE S SWARM, P110
  • [6] Cheng S, 2011, LECT NOTES COMPUT SC, V6728, P38, DOI 10.1007/978-3-642-21515-5_5
  • [7] Improving Classical and Decentralized Differential Evolution with New Mutation Operator and Population Topologies
    Dorronsoro, Bernabe
    Bouvry, Pascal
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (01) : 67 - 98
  • [8] Eberhart R., 2007, COMPUTATIONAL INTELL
  • [9] Eberhart R., 1999, P 6 INT S MICROMACHI, V3-267, P39, DOI [DOI 10.1109/MHS.1995.494215, 10.1.1.470.3577]
  • [10] Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374