PSO参数设置.pdf

Information Processing Letters 85 (2003) 317–325 /locate/ipl The particle swarm optimization algorithm: convergence analysis and parameter selection Ioan Cristian Trelea INA P-G, UMR Génie et Microbiologie des Procédés Alimentaires, BP 01, 78850 Thiverval-Grignon, France Received 10 July 2002; received in revised form 12 September 2002 Communicated by S. Albers Abstract The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory. Graphical parameter selection guidelines are derived. The exploration–exploitation tradeoff is discussed and illustrated. Examples of performance on benchmark functions superior to previously published results are given.  2002 Elsevier Science B.V. All rights reserved. Keywords: Particle swarm optimization; Stochastic optimization; Analysis of algorithms; Parallel algorithms 1. Introduction often stated as the exploration–exploitation tradeoff: Exploration is the ability to test various regions in The particle swarm optimization (PSO) is a paral- the problem space in order to locate a good optimum, lel evolutionary computation technique developed by hopefully the global one. Exploitation is the ability to Kennedy and Eberhart [4] based on the social behav- concentrate the search around a promising candidate ior metaphor. A standard textbook on PSO, treating solution