Chaotic differential bee colony optimization algorithm for dynamic economic dispatch problem with valve-point effects

Author(s):  
Peng Lu ◽  
Jianzhong Zhou ◽  
Huifeng Zhang ◽  
Rui Zhang ◽  
Chao Wang
Energy ◽  
2015 ◽  
Vol 93 ◽  
pp. 2175-2190 ◽  
Author(s):  
Anbo Meng ◽  
Hanwu Hu ◽  
Hao Yin ◽  
Xiangang Peng ◽  
Zhuangzhi Guo

Author(s):  
Wanchai Khamsen ◽  
Chiraphon Takeang ◽  
Patiphat Aunban

This article is focused on hybrid method for solving the non-smooth cost function economic dispatch problem. The techniques were divided into two parts according to: the incremental cost rates are used to find the initial solution and bee colony optimization is used to find the optimal solution. The constraints of economic dispatch are power losses, load demand and practical operation constraints of generators. To verify the performance of the proposed algorithm, it is operated by the simulation on the MATLAB program and tests three case studies; three, six and thirteen generator units which compared to particle swarm optimization, cuckoo search algorithm, bat algorithm, firefly algorithm and bee colony optimization. The results show that the proposed algorithm is able to obtain higher quality solution efficiently than the others methods.


2018 ◽  
Vol 185 ◽  
pp. 00033 ◽  
Author(s):  
Chia-Sheng Tu ◽  
Hsi-Shan Huang ◽  
Ming-Tang Tsai ◽  
Fu-Sheng Cheng

Dynamic economic dispatch is to minimize the cost of power production of all the participating generators over a time horizon of 24 hours in one day. The dynamic economic dispatch with non-smooth cost functions, for which is formulated the optimal dispatch model of generations by considering the ramp up/down scheduling of power. This paper presents a Bee Colony Optimization (BCO) that applies the Taguchi Method (TM) to solve the Dynamic Economic Dispatch problem. The Taguchi method that involves the use of orthogonal arrays in estimating of the non-smooth cost function and Bee Colony Optimization is used to find the objective function under the operational of system constraints. The Taguchi method can global optimization for fast local convergence by minimizing the cost function in a few iterations. The effectiveness and efficiency of the TM-BCO is demonstrated by using a 10 unit of IEEE case with non-smooth fuel cost functions and is more effective than other previously developed algorithms. Moreover, the proposed approach presents significant computational benefits than traditional random search method especially for multi-unit systems with larger numbers of non-smooth cost functions and more complicated dynamic economic dispatch.


Sign in / Sign up

Export Citation Format

Share Document