An SFLA Approach to Solving Profit-Based Unit Commitment Problem Under Deregulation
The IUP Journal of Electrical & Electronics Engineering, Vol. X, No. 4, October 2017, pp. 27-38
Posted: 10 Aug 2018
Date Written: October 26, 2017
Abstract
In this paper, a Shuffled Frog Leaping Algorithm (SFLA) is proposed to address the Profit-Based Unit Commitment (PBUC) problem under deregulation. The PBUC problem is one of the major tasks for a power producer and is a highly complex, multi-constrained, nonlinear optimization problem. Some of the recently developed algorithms like GA, PSO, BBO, ACO, etc. are available to solve this complex problem, but so far there has been no such ideal technique which can completely handle the computational time and the large dimensionality of the problem. In this scenario, an attempt is made to solve this problem using SFLA. The problem is formulated as a biobjective optimization problem with profit maximization of generation companies as one objective and emission level limitation of generating units as second objective. The proposed algorithm is tested on IEEE 10 unit 10 hours load demand as input data for simulation using MATLAB. The results are compared with GA and PSO. From the results, it is observed that SFLA effectively handles the dimension of the problem and achieves maximum profit and minimum production cost with less computational time.
Keywords: Profit-Based Unit Commitment (PBUC) problem, Shuffled Frog Leaping Algorithm (SFLA) , Deregulation, Profit
Suggested Citation: Suggested Citation