An improved particle swarm optimization algorithm for unit commitment

被引:154
作者
Zhao, B. [1 ]
Guo, C. X. [1 ]
Bai, B. R. [1 ]
Cao, Y. J. [1 ]
机构
[1] Zhejiang Univ, Coll Elect Engn, Hangzhou 310027, Zhejiang, Peoples R China
关键词
unit commitment; particle swarm optimization; global optimization; power system;
D O I
10.1016/j.ijepes.2006.02.011
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents an improved particle swarm optimization algorithm (IPSO) for power system unit commitment. IPSO is an extension of the standard particle swarm optimization algorithm (PSO) which uses more particles' information to control the mutation operation, and is similar to the social society in that a group of leaders could make better decisions. The convergence property of the proposed IPSO method is analyzed using standard results from the dynamic system theory and some guidelines are derived for proper algorithm parameter selection. A new adaptive strategy for choosing parameters is also proposed to assure convergence of IPSO method, and the proposed algorithm adopts the orthogonal design to generate initial population that are scattered uniformly over feasible solution space. Furthermore, this method combines relaxation technique to zero-one variable and penalty function method to transform the problem to a nonlinear continuous variable optimization one by taking into account more constraints. The feasibility of the proposed method is demonstrated from 10 to 100 unit systems, and the test results are compared with those obtained by Evolutionary Programming (EP) and Genetic Algorithm (GA) in terms of solution quality and convergence properties. The simulation results show that the proposed method is capable of obtaining higher quality solutions. (C) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码:482 / 490
页数:9
相关论文
共 27 条
[1]   Optimal power flow using particle swarm optimization [J].
Abido, MA .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2002, 24 (07) :563-571
[2]  
BURNS RM, IEEE PES 1975 SUMM M
[3]   Cooperative Coevolutionary Algorithm for unit commitment [J].
Chen, HY ;
Wang, XF .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2002, 17 (01) :128-133
[4]   Unit commitment by Lagrangian relaxation and genetic algorithms [J].
Cheng, CP ;
Liu, CW ;
Liu, GC .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2000, 15 (02) :707-714
[5]   The particle swarm - Explosion, stability, and convergence in a multidimensional complex space [J].
Clerc, M ;
Kennedy, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (01) :58-73
[6]   A BRANCH-AND-BOUND ALGORITHM FOR UNIT COMMITMENT [J].
COHEN, AI ;
YOSHIMURA, M .
IEEE TRANSACTIONS ON POWER APPARATUS AND SYSTEMS, 1983, 102 (02) :444-451
[7]  
Eberhart RC, 2000, IEEE C EVOL COMPUTAT, P84, DOI 10.1109/CEC.2000.870279
[8]  
EDWIN KW, 1978, IEEE T POWER APPARAT, V97, P2156
[9]   Particle swarm optimization to solving the economic dispatch considering the generator constraints [J].
Gaing, ZL .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (03) :1187-1195
[10]   Genetic algorithms based economic dispatch for cogeneration units considering multiplant multibuyer wheeling [J].
Hong, YY ;
Li, CY .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2002, 17 (01) :134-140