1916 Adaptive Range Particle Swarm Optimization
Satoshi KITAYAMA, Koetsu YAMAZAKI, Masao ARAKAWA · Keisan Rikigaku Koenkai koen ronbunshu/Keisan Rikigaku Kouenkai kouen rombunshuu · 2005
This paper proposes a new method which is called as Adaptive Range Particle Swarm Optimization (ARPSO), based on Adaptive Range Genetic Algorithm. That is, the search domain is determined by using the mean and standard deviation of each design variable. At the initial search stage it is preferable to explore the design domain widely, and is also preferable to explore the small design domain as the search goes on. To achieve this objective, new parameter which determines the search domain is introduced. Through numerical examples, the effectiveness and validity of proposed method are examined.