DocumentCode
3047603
Title
Variable Velocity Limit Chaotic Particle Swarm Optimization
Author
Wang, Guiyan
Author_Institution
Dept. of Basement, Harbin Financial Coll., Harbin, China
fYear
2010
fDate
20-23 June 2010
Firstpage
1661
Lastpage
1666
Abstract
This paper analyzes the effects and the relationship of the parameters in the velocity updating of PSO. To velocity limit, the decreasing with different patterns are applied to play the varying part in the whole searching process. And the properties of the patterns are discussed. To overcome the shortage of the chaotic series, the logistic series and the improved tent series are introduced to replace the random numbers in PSO searching process. And the Variable Velocity Limit Chaotic Particle Swarm Optimization(VVL-CPSO) is proposed. In the numerical experiment, several benchmarks are applied to test the capabilities of the algorithms. The exploring ratio of the feasible region is defined. And the results show that the VVL-CPSO is better than the standard PSO and the Chaotic PSO. The VVL-CPSO, which is based on the improved tent series, has the best searching results on most of the benchmarks than other algorithms.
Keywords
chaos; particle swarm optimisation; search problems; PSO searching process; chaotic series; logistic series; tent series; variable velocity limit chaotic particle swarm optimization; Artificial intelligence; Automation; Benchmark testing; Birds; Chaos; Educational institutions; Information analysis; Logistics; Marine animals; Particle swarm optimization; Chaos; Improved tent series; PSO; Variable velocity limit;
fLanguage
English
Publisher
ieee
Conference_Titel
Information and Automation (ICIA), 2010 IEEE International Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4244-5701-4
Type
conf
DOI
10.1109/ICINFA.2010.5512244
Filename
5512244
Link To Document