A Solution to the Profit Based Unit Commitment Problem Using Integer-Coded Bacterial Foraging Algorithm

T. Venkatesan(1*), C. Muniraj(2)

(1) K S Rangasamy College of Technology, Tiruchengode, India,
(2) K.S.Rangasamy College of Technology, Tiruchengode, India,
(*) Corresponding author

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


In this paper, the Integer-Coded Bacterial Foraging Algorithm is proposed to solve the Profit Based Unit Commitment problem under deregulated environment. The objective function of Bacterial Foraging Algorithm is formulated to maximize the Generation Companies profit. A Profit Based Unit Commitment problem is one of the most difficult and complex problems for the power sectors under deregulated environment. This work, explains the softer demand constraint to allocate fixed and transitional cost to the scheduled hours. The Integer-Code Bacterial Foraging Algorithm (ICBFA) is on the base of foraging behavior of E-coli Bacteria in the human intestine.

This proposed algorithm is simulated using MATLAB software. The IEEE 39 bus10 unit test system with 24 hour data is taken as the input for simulation. It is observed from the simulation results that the proposed algorithm provides maximum profit with less computational time compared to previously reported result
Copyright © 2014 Praise Worthy Prize - All rights reserved.

Full Text:



  • There are currently no refbacks.

Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2022 Praise Worthy Prize