DocumentCode :
2998346
Title :
A new particle swarm optimiser for linearly constrained optimisation
Author :
Paquet, Ulrich ; Engelbrecht, Andries P.
Author_Institution :
Dept. of Comput. Sci., Pretoria Univ., South Africa
Volume :
1
fYear :
2003
fDate :
8-12 Dec. 2003
Firstpage :
227
Abstract :
A new PSO algorithm, the linear PSO (LPSO), is developed to optimise functions constrained by linear constraints of the form Ax = b. A crucial property of the LPSO is that the possible movement of particles through vector spaces is guaranteed by the velocity and position update equations. This property makes the LPSO ideal in optimising linearly constrained problems. The LPSO is extended to the converging linear PSO, which is guaranteed to always find at least a local minimum.
Keywords :
constraint theory; convergence; evolutionary computation; optimisation; vectors; PSO algorithm; converging linear PSO; functions optimisation; linear constraints; linearly constrained optimisation; local minimum; particle movement; particle swarm optimiser; position update equations; vector spaces; velocity update equations; Africa; Computer science; Constraint optimization; Ear; Equations; Optimization methods; Organisms; Particle swarm optimization; Topology; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN :
0-7803-7804-0
Type :
conf
DOI :
10.1109/CEC.2003.1299579
Filename :
1299579
Link To Document :
بازگشت