|
|
|
| Unit Commitment Problem Based on PSO With Heuristic-Adjusted Strategies |
| Yuan Xiaohui1, Su Anjun1, Nie Hao1, Cao Bo2, Yang Bo2 |
| 1. Huazhong University of Science and Technology Wuhan 430074 China 2. Central China Grid Company Limited Wuhan 430077 China |
|
|
|
|
Abstract This paper proposes a new approach combining of particle swarm optimization (PSO) and heuristic-adjusted strategies to solve unit commitment (UC) problem in power system. The UC problem is decomposed into two embedded optimization sub-problems: one the unit on/off status schedule problem with integer variables that could be solved by the discrete binary particle swarm optimization method and the other load economic dispatch problem with continuous variables that could be solved by the equal Lambda-iteration method. At the same time, shutdown-adjusted and replacement-adjusted strategies are performed on the optimal results to raise solution quality, which could be effectively enhanced the algorithm’s global optimization performance and computational efficiency. The feasibility and effectiveness of the proposed method are demonstrated for five test systems with the number of generating units in the range of 10 to 100, and the computational results are compared with those previously reported in literature. Simulation results show that the proposed method has advantages for solving UC problem with high precision and quickly convergence speed.
|
|
Received: 28 September 2008
Published: 18 February 2014
|
|
|
|
|
|
[1] 袁晓辉, 袁艳斌, 张勇传.电力系统中机组组合的现代智能优化方法综述[J]. 电力自动化设备, 2003, 23(2): 73-78.
[2] 王成文, 韩勇, 谭忠富, 等. 一种求解机组组合优化问题的降维半解析动态规划方法[J]. 电工技术学报, 2006, 21(5): 110-116.
[3] Samer T, John B. Using integer programming to refine Lagrangian-based unit commitment solutions[J]. IEEE Trans. on Power Syst., 2000, 15(1): 151-156.
[4] Dieu V, Ongsakul W. Enhanced augmented Lagr- angian hopfield network for unit commitment[J]. IEE Proc. Gener. Transm. Distrib., 2006, 153(6): 624-632.
[5] Cheng C, Liu C. Unit commitment by Lagrangian relaxation and genetic algorithms[J]. IEEE Trans. on Power Systems, 2000, 15(2): 707-714.
[6] Kazarlis S, Bakirtzis A, Petridis V. A genetic algorithm solution to the unit commitment problem[J]. IEEE Trans. on Power Systems, 1996, 11(1): 83-92.
[7] Juste K, Kita H, Tanaka E. An evolutionary programming solution to the unit commitment problem[J]. IEEE Trans. on Power Systems, 1999, 14(4): 1452-1459.
[8] Zhuang F, Galiana F. Unit commitment by an enhanced simulated annealing algorithm[J]. IEEE Trans. on Power Systems, 2006, 21(1): 68-76.
[9] 袁晓辉, 王乘, 袁艳斌, 等. 一种求解机组组合问题的新型改进粒子群方法[J]. 电力系统自动化, 2005, 29(1): 34-38.
[10] Balci H, Valenzuela J. Scheduling electric power generations using particle swarm optimization combined with the Lagrangian relaxation method[J]. Int. J. Appl. Math. Comput. Sci., 2004, 14(3): 411-421.
[11] Kennedy J, Eberhart R. A discrete binary version of the particle swarm algorithm[C]. Proceedings of the Conference on Systems, Man, and Cybernetics, 1997: 4104-4108. |
|
|
|
2009, Vol. 24 
