Short-term hydro generation scheduling of Xiluodu and Xiangjiaba cascade hydropower stations using improved binary-real coded bee colony optimization algorithm

被引:61
作者
Lu, Peng
Zhou, Jianzhong [1 ]
Wang, Chao
Qiao, Qi
Mo, Li
机构
[1] Huazhong Univ Sci & Technol, Sch Hydropower & Informat Engn, Wuhan 430074, Hubei, Peoples R China
关键词
Short-term hydro generation scheduling; Cascaded hydropower stations; Binary-real coded bee colony optimization; Heuristic repairing strategy; UNIT-COMMITMENT PROBLEM; ECONOMIC-DISPATCH PROBLEM; DIFFERENTIAL EVOLUTION; OPERATION; SEARCH;
D O I
10.1016/j.enconman.2014.11.036
中图分类号
O414.1 [热力学];
学科分类号
摘要
Short-term hydro generation scheduling (STHGS) of cascade hydropower stations is a typical nonlinear mixed integer optimization problem to minimize the total water consumption while simultaneously meeting the grid requirements and other hydraulic and electrical constraints. In this paper, STHGS problem is decomposed into two parallel sub-problems of unit commitment (UC) and economic load dispatch (ELD), and the methodology of improved binary-real coded bee colony optimization (IB-RBCO) algorithm is proposed to solve them. Firstly, the improved binary coded BCO is used to solve the UC sub-problem with 0-1 discrete variables, and the heuristic repairing strategy for unit state constrains is applied to generate the feasible unit commitment schedule. Then, the improved real coded BCO is used to solve the ELD sub-problem with continuous variables, and an effective method is introduced to handle various unit operation constraints. Especially, the new updating strategy of DE/best/2/bin method with dynamic parameter control mechanism is applied to real coded BCO to improve the search ability of IB-RBCO. Finally, to verify the feasibility and effectiveness of the proposed IB-RBCO method, it is applied to solve the STHGS problem of Xiluodu and Xiangjiaba cascaded hydropower stations, and the simulating results are compared with other intelligence algorithms. The simulation results demonstrate that the proposed IB-RBCO method can get higher-quality solutions with less water consumption and shorter calculating time when facing the complex STHGS problem. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:19 / 31
页数:13
相关论文
共 40 条
[1]   Improved differential evolution for short-term hydrothermal scheduling [J].
Basu, M. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2014, 58 :91-100
[2]   Mixed-Integer Nonlinear Programming Approach for Short-Term Hydro Scheduling [J].
Catalao, J. P. S. ;
Pousinho, H. M. I. ;
Mendes, V. M. F. .
IEEE LATIN AMERICA TRANSACTIONS, 2010, 8 (06) :658-663
[3]   Hydro energy systems management in Portugal: Profit-based evaluation of a mixed-integer nonlinear approach [J].
Catalao, J. P. S. ;
Pousinho, H. M. I. ;
Mendes, V. M. F. .
ENERGY, 2011, 36 (01) :500-507
[4]   Thermal unit commitment using binary/real coded artificial bee colony algorithm [J].
Chandrasekaran, K. ;
Hemamalini, S. ;
Simon, Sishaj P. ;
Padhy, Narayana Prasad .
ELECTRIC POWER SYSTEMS RESEARCH, 2012, 84 (01) :109-119
[5]  
Chen Y, 2008, J POWER SYST TECHNOL, V6, P014
[6]   Comparison of particle swarm optimization and dynamic programming for large scale hydro unit load dispatch [J].
Cheng, Chun-tian ;
Liao, Sheng-li ;
Tang, Zi-Tian ;
Zhao, Ming-yan .
ENERGY CONVERSION AND MANAGEMENT, 2009, 50 (12) :3007-3014
[7]   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
[8]   A solution to the unit-commitment problem using integer-coded genetic algorithm [J].
Damousis, IG ;
Bakirtzis, AG ;
Dokopoulos, PS .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2004, 19 (02) :1165-1172
[9]   A binary-real-coded differential evolution for unit commitment problem [J].
Datta, Dilip ;
Dutta, Saptarshi .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2012, 42 (01) :517-524
[10]   Adaptive simulated annealing schedule to the unit commitment problem [J].
Dudek, Grzegorz .
ELECTRIC POWER SYSTEMS RESEARCH, 2010, 80 (04) :465-472