Particle swarm optimization (PSO). A tutorial

被引:1006
作者
Marini, Federico [1 ]
Walczak, Beata [2 ]
机构
[1] Univ Roma La Sapienza, Dept Chem, I-00185 Rome, Italy
[2] Univ Silesia, Dept Analyt Chem, PL-40006 Katowice, Poland
关键词
Particle swarm optimization (PSO); Variable selection; Warping algorithms; Continue and discrete optimization; Swarm intelligence; MULTIVARIATE CURVE RESOLUTION; VARIABLE SELECTION; ALIGNMENT; ALGORITHMS; PROJECTION; AMBIGUITY;
D O I
10.1016/j.chemolab.2015.08.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Swarm-based algorithms emerged as a powerful family of optimization techniques, inspired by the collective behavior of social animals. In particle swarm optimization (PSO) the set of candidate solutions to the optimization problem is defined as a swarm of particles which may flow through the parameter space defining trajectories which are driven by their own and neighbors' best performances. In the present paper, the potential of particle swarm optimization for solving various kinds of optimization problems in chemometrics is shown through an extensive description of the algorithm (highlighting the importance of the proper choice of its metaparameters) and by means of selected worked examples in the fields of signal warping, estimation robust PCA solutions and variable selection. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:153 / 165
页数:13
相关论文
共 70 条
[1]  
Ackley D., 1987, A Connectionist Machine for Genetic Hillclimbing
[2]  
[Anonymous], 2011, Em 2011 Third World Congress on Nature and Biologically Inspired Computing, paginas, DOI [DOI 10.1109/NABIC.2011.6089659, 10.1109/NaBIC.2011.6089659]
[3]  
[Anonymous], 2001, Swarm Intelligence
[4]  
[Anonymous], 2004, ANT COLONY OPTIMIZAT
[5]  
[Anonymous], 2008, APPL INTELL
[6]  
[Anonymous], 2001, An Analysis of Particle Swarm Optimizers'
[7]  
[Anonymous], 2000, PRACTICAL METHODS OP
[8]  
[Anonymous], 1989, MULTIVARIATE CALIBRA
[9]  
[Anonymous], 1999, NATURAL ARTIFICIAL S
[10]  
[Anonymous], 1992, Ph.D. thesis