An adaptive chaotic artificial bee colony algorithm for short-term hydrothermal generation scheduling

被引:85
作者
Liao, Xiang [1 ,2 ]
Zhou, Jianzhong [1 ,2 ]
Ouyang, Shuo [1 ,2 ]
Zhang, Rui [1 ,2 ]
Zhang, Yongchuan [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Hydropower & Informat Engn, Wuhan 430074, Hubei, Peoples R China
[2] Huazhong Univ Sci & Technol, Hubei Key Lab Digital Valley Sci & Technol, Wuhan 430074, Hubei, Peoples R China
基金
中国国家自然科学基金; 高等学校博士学科点专项科研基金;
关键词
Hydrothermal scheduling; Artificial bee colony algorithm; Adaptive; Constrained optimization; Swarm intelligence; RESERVOIR NETWORK CONTROL; POWER-SYSTEMS; DIFFERENTIAL EVOLUTION; CASCADED RESERVOIRS; EMISSION DISPATCH; OPTIMAL OPERATION; NEURAL-NETWORK; OPTIMIZATION; MODEL; LOAD;
D O I
10.1016/j.ijepes.2013.04.004
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Short-term hydrothermal scheduling (SHS) is a complicated nonlinear optimization problem with a set of constraints, which plays an important role in power system operations. In this paper, we propose to use an adaptive chaotic artificial bee colony (ACABC) algorithm to solve the SHS problem. In the proposed method, chaotic search is applied to help the artificial bee colony (ABC) algorithm to escape from a local optimum effectively. Furthermore, an adaptive coordinating mechanism of modification rate in employed bee phase is introduced to increase the ability of the algorithm to avoid premature convergence. Moreover, a new constraint handling method is combined with the ABC algorithm in order to solve the equality coupling constraints. We used a hydrothermal test system to demonstrate the effectiveness of the proposed method. The numerical results obtained by ACABC are compared with those obtained by the adaptive ABC algorithm (AABC), the chaotic ABC algorithm (CABC) and other methods mentioned in literature. The simulation results indicate that the proposed method outperforms those established optimization algorithms. (c) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:34 / 42
页数:9
相关论文
共 34 条
[1]   Optimization model for allocating water in a river basin, during a drought [J].
Abolpour, Behrouz ;
Javan, Mahmood .
JOURNAL OF IRRIGATION AND DRAINAGE ENGINEERING, 2007, 133 (06) :559-572
[2]   A hybrid real coded genetic algorithm - Pattern search approach for selective harmonic elimination of PWM AC/AC voltage controller [J].
Al-Othman, A. K. ;
Ahmed, Nabil A. ;
AlSharidah, M. E. ;
AlMekhaizim, Hanan A. .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 44 (01) :123-133
[3]  
[Anonymous], 2005, Technical Report-TR06
[4]   Goal-attainment method based on simulated annealing technique for economic-environmental-dispatch of hydrothermal power systems with cascaded reservoirs [J].
Basu, M .
ELECTRIC POWER COMPONENTS AND SYSTEMS, 2004, 32 (12) :1269-1286
[5]   Optimal economic emission dispatch of hydrothermal power systems [J].
Chiang, Chao-Lung .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2007, 29 (06) :462-469
[6]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[7]   A multi-objective optimization based solution for the combined economic-environmental power dispatch problem [J].
Gjorgiev, Blaze ;
Cepin, Marko .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (01) :417-429
[8]   Optimal Multipurpose-Multireservoir Operation Model with Variable Productivity of Hydropower Plants [J].
Goor, Q. ;
Kelman, R. ;
Tilmant, A. .
JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT, 2011, 137 (03) :258-267
[9]   Solving the combined economic load and emission dispatch problems using new heuristic algorithm [J].
Hamedi, Hadi .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2013, 46 :10-16
[10]   Comparison of different chaotic maps in particle swarm optimization algorithm for long-term cascaded hydroelectric system scheduling [J].
He, Yao-Yao ;
Zhou, Jian-Zhong ;
Xiang, Xiu-Qiao ;
Chen, Heng ;
Qin, Hui .
CHAOS SOLITONS & FRACTALS, 2009, 42 (05) :3169-3176