Emission Constraint Profit based Unit Commitment Problem using Improved Bacterial Foraging Algorithm

Objectives: The main objective function is to increase the Generation Companies profit and reduce the GHG gas emission of the thermal generating units. Methods/Analysis: During the most recent few centuries, emission control has become a very big problem of worlds concern due to the frequently increasing pollution of earth’s atmosphere. In order to reach the emission control in this paper the Improved Bacterial Foraging Algorithm (IBFA) is proposed. The Bacterial Foraging Algorithm is formed by foraging behavior of E-coli Bacteria in the human intestine. But the BF algorithm leads to some convergence problem while solving the large problems. So for improving the performance of the large problems the new integer coded Improved Bacterial Foraging Algorithm is proposed. Findings: The proposed method is implemented to the IEEE 39 bus10 unit system with one day time period. This proposed algorithm is simulated using MATLAB software and the output results are compared with traditional Unit Commitment Method. Novelty/Improvement: The restructuring of electric power industry is used to reform the electric supply industry. The generation scheduling of thermal generating units in deregulated environment is named as Profit Based Unit Commitment. In PBUC problem the normal Demand constraint is changed to modified power demand constraint to increase the GENeration Companies (GENCO) profit.

[1]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[2]  Mohammad Shahidehpour,et al.  Market operations in electric power systems , 2002 .

[3]  Sukumar Mishra,et al.  A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation , 2005, IEEE Transactions on Evolutionary Computation.

[4]  Sukumar Mishra,et al.  Hybrid least-square adaptive bacterial foraging strategy for harmonic estimation , 2005 .

[5]  A. Conejo,et al.  Decision making under uncertainty in electricity markets , 2010, 2006 IEEE Power Engineering Society General Meeting.

[6]  S. Mishra,et al.  Bacteria Foraging-Based Solution to Optimize Both Real Power Loss and Voltage Stability Limit , 2007, IEEE Transactions on Power Systems.

[7]  C. N. Bhende,et al.  Bacterial Foraging Technique-Based Optimized Active Power Filter for Load Compensation , 2007, IEEE Transactions on Power Delivery.

[8]  Ying Tan,et al.  Dispersed particle swarm optimization , 2008, Inf. Process. Lett..

[9]  B. Vahidi,et al.  Bacterial Foraging-Based Solution to the Unit-Commitment Problem , 2009, IEEE Transactions on Power Systems.

[10]  Joao P. S. Catalao,et al.  A practical approach for profit-based unit commitment with emission limitations , 2010 .

[11]  William D'haeseleer,et al.  Effect of the accuracy of price forecasting on profit in a Price Based Unit Commitment , 2010 .

[12]  K. Selvakumar,et al.  Shuffled Frog Leaping Algorithm for solving profit based unit commitment problem , 2012, 2012 International Conference on Computing, Communication and Applications.

[13]  K. Selvakumar,et al.  Price Based Unit Commitment Problem Solution using Shuffled Frog Leaping Algorithm , 2012, IEEE-International Conference On Advances In Engineering, Science And Management (ICAESM -2012).

[14]  Alireza Gharegozi,et al.  A New Approach for Solving the Unit Commitment Problem by Cuckoo Search Algorithm , 2013 .

[15]  C. Muniraj,et al.  A Solution to the Profit Based Unit Commitment Problem Using Integer-Coded Bacterial Foraging Algorithm , 2014 .

[16]  K. Selvakumar,et al.  Unit Commitment Problem with POZ Constraint Using Dynamic Programming Method , 2014 .

[17]  Reza Effatnejad,et al.  Unit Commitment in Power System t by Combination of Dynamic Programming (DP), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) , 2014 .

[18]  R. Palanisamy,et al.  SFLA to Solve Short Term Thermal Unit Commitment Problem with Startup and Shutdown Ramp Limits , 2015 .

[19]  R. K. Santhi,et al.  Best Compromised Schedule for Multi-Objective Unit Commitment Problems , 2016 .