A solution to particle swarm optimization algorithm with adaptive inertia weight for unit commitment

Unit commitment is a large-scale and mixed-integer non-linear programming problem. An adaptive inertia weight of particle swarm optimization algorithm (AWPSO) is presented to increase the global and local search. The population is divided into two sub-populations according to the value of fitness, a...

Full description

Saved in:
Bibliographic Details
Published inDianli Xitong Baohu yu Kongzhi Vol. 37; no. 15; pp. 15 - 18
Main Authors Chang, Wen-Ping, Yu, Hai, Hua, Da-Peng
Format Journal Article
LanguageChinese
Published 01.08.2009
Online AccessGet full text

Cover

More Information
Summary:Unit commitment is a large-scale and mixed-integer non-linear programming problem. An adaptive inertia weight of particle swarm optimization algorithm (AWPSO) is presented to increase the global and local search. The population is divided into two sub-populations according to the value of fitness, and the inertia weight is formulated as a function of evolution speed and stagnate state. The algorithm is tested with well-known benchmark functions and the simulation results with systems of up to 10 units and 24-h scheduling horizon are presented. The experiments show that the convergence accuracy is increased.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1674-3415