Particle swarm optimization with adaptive linkage learning

被引:11
作者
Devicharan, D [1 ]
Mohan, CK [1 ]
机构
[1] Syracuse Univ, Ctr Sci & Technol, Dept EECS, Syracuse, NY 13244 USA
来源
CEC2004: PROCEEDINGS OF THE 2004 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1 AND 2 | 2004年
关键词
D O I
10.1109/CEC.2004.1330902
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many problems, the quality of solutions and computational effort required by optimization algorithms can be improved by exploiting knowledge found in the linkages or interrelations between problem dimensions or components. These linkages are sometimes known a priori from the nature of the problem itself; in other cases linkages can be learned by sampling the data space prior to the application of the optimization algorithm. This paper presents a new version of the particle swarm optimization algorithm (PSO) that utilizes linkages between components, performing more frequent simultaneous updates on subsets of particle position components that are strongly linked. Prior to application of this Linkage-Sensitive PSO algorithm, problem-specific linkages can be learned by examining a randomly chosen collection of points in the search space to determine correlations in fitness changes resulting from perturbations in pairs of components of particle positions. The resulting algorithm, Adaptive-Linkage PSO (ALiPSO) has performed significantly better than the classical PSO, in simulations conducted so far on several test problems. In many problems, the quality of solutions and computational effort required by optimization algorithms can be improved by exploiting knowledge found in the linkages or interrelations between problem dimensions or components. These linkages are sometimes known a priori from the nature of the problem itself; in other cases linkages can be learned by sampling the data space prior to the application of the optimization algorithm. This paper presents a new version of the particle swarm optimization algorithm (PSO) that utilizes linkages between components, performing more frequent simultaneous updates on subsets of particle position components that are strongly linked. Prior to application of this Linkage-Sensitive PSO algorithm, problem-specific linkages can be learned by examining a randomly chosen collection of points in the search space to determine correlations in fitness changes resulting from perturbations in pairs of components of particle positions. The resulting algorithm, Adaptive-Linkage PSO (ALiPSO) has performed significantly better than the classical PSO, in simulations conducted so far on several test problems.
引用
收藏
页码:530 / 535
页数:6
相关论文
共 16 条
[1]  
[Anonymous], 1997, Proceedings of the Seventh International Conference on Genetic Algorithms
[2]  
[Anonymous], 2007, ANAL PARTICLE SWARM
[3]  
Beyer H.-G., 2001, NAT COMP SER
[4]  
CLERC M, 1999, P 1999 C EV COMP, P1927
[5]  
Eberhart R, 1995, MHS 95 P 6 INT S MIC, P39, DOI DOI 10.1109/MHS.1995.494215
[6]  
EBERHART RC, 1998, P 7 INT C EV PROGR S
[7]  
GOLDBERG DE, P INT C GEN ALG, P10
[8]  
HARIK G, 97005 ILLIGAL
[9]  
Holland JH, 1992, ADAPTATION NATURAL A, DOI DOI 10.7551/MITPRESS/1090.001.0001
[10]   The particle swarm: Social adaptation of knowledge [J].
Kennedy, J .
PROCEEDINGS OF 1997 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '97), 1997, :303-308