TY - GEN
T1 - Parameter evolution for a particle swarm optimization algorithm
AU - Zhou, Aimin
AU - Zhang, Guixu
AU - Konstantinidis, Andreas
PY - 2010
Y1 - 2010
N2 - Setting appropriate parameters of an evolutionary algorithm (EA) is challenging in real world applications. On one hand, the characteristics of a real world problem are usually unknown. On the other hand, in different running stages of an EA, the best parameters may be different. Thus adaptively tuning algorithm parameters online is preferred. In this paper, we propose to use an estimation of distribution algorithm (EDA) to do this for a particle swarm optimization (PSO) algorithm. The major characteristic of our approach is that there are two evolving processes simultaneously: one for tackling the original problem, and the other for optimizing PSO parameters. For the former evolving process, a set of particles are maintained; while for the later, a probability distribution model of the PSO parameters is maintained throughout the run. In the reproduction procedure, the PSO parameters are firstly sampled from the model, and then new particles are generated by the PSO operator. The feedback from the newly generated particles is used to evaluate the PSO parameters and thus to update the probability model. The new approach is applied to a set of test instances and the preliminary results are promising.
AB - Setting appropriate parameters of an evolutionary algorithm (EA) is challenging in real world applications. On one hand, the characteristics of a real world problem are usually unknown. On the other hand, in different running stages of an EA, the best parameters may be different. Thus adaptively tuning algorithm parameters online is preferred. In this paper, we propose to use an estimation of distribution algorithm (EDA) to do this for a particle swarm optimization (PSO) algorithm. The major characteristic of our approach is that there are two evolving processes simultaneously: one for tackling the original problem, and the other for optimizing PSO parameters. For the former evolving process, a set of particles are maintained; while for the later, a probability distribution model of the PSO parameters is maintained throughout the run. In the reproduction procedure, the PSO parameters are firstly sampled from the model, and then new particles are generated by the PSO operator. The feedback from the newly generated particles is used to evaluate the PSO parameters and thus to update the probability model. The new approach is applied to a set of test instances and the preliminary results are promising.
UR - https://www.scopus.com/pages/publications/78649522935
U2 - 10.1007/978-3-642-16493-4_4
DO - 10.1007/978-3-642-16493-4_4
M3 - 会议稿件
AN - SCOPUS:78649522935
SN - 3642164927
SN - 9783642164927
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 33
EP - 43
BT - Advances in Computation and Intelligence - 5th International Symposium, ISICA 2010, Proceedings
T2 - 5th International Symposium on Advances in Computation and Intelligence, ISICA 2010
Y2 - 22 October 2010 through 24 October 2010
ER -