DocumentCode
2879045
Title
A dynamic neighbourhood particle swarm optimisation algorithm for constrained optimisation
Author
Li, Lily D. ; Yu, Xinghuo ; Li, Xiaodong ; Guo, William
Author_Institution
Sch. of Sch. of Inf. & Commun. Technol., CQ Univ., Rockhampton, QLD, Australia
fYear
2011
fDate
7-10 Nov. 2011
Firstpage
3042
Lastpage
3047
Abstract
This paper presents a dynamic neighbourhood Particle Swarm Optimisation (PSO) algorithm for constrained optimisation problems. The constraint dominance concept is adopted for constraint handling. The dynamic neighbourhood aims to enhance communication between particles from different groups in order to improve searching performance. Simulation to the benchmark functions demonstrates the proposed dynamic neighbourhood PSO outperforms the static neighbourhood PSO in finding consistent quality results.
Keywords
particle swarm optimisation; constrained optimisation; constraint dominance concept; dynamic neighbourhood PSO; dynamic neighbourhood particle swarm optimisation; searching performance; static neighbourhood PSO; Educational institutions; Heuristic algorithms; Indexes; Optimization; Particle swarm optimization; Topology; Constrained Optimisation; Evolutionary Computation; PSO algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
IECON 2011 - 37th Annual Conference on IEEE Industrial Electronics Society
Conference_Location
Melbourne, VIC
ISSN
1553-572X
Print_ISBN
978-1-61284-969-0
Type
conf
DOI
10.1109/IECON.2011.6119795
Filename
6119795
Link To Document