Bacterial Foraging-Based Solution to the Unit-Commitment Problem

The unit commitment (UC) problem is one of the most difficult optimization problems in power system, because this problem has many variables and constraints. The objective is the minimization of the total production cost over the scheduling horizon while the constraints must be satisfied, too. This...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 2009-08, Vol.24 (3), p.1478-1488
Main Authors: Eslamian, M., Hosseinian, S.H., Vahidi, B.
Format: Article
Language:English
Subjects:
Bacteria
Bacterial foraging algorithm
Biological cells
Constraint optimization
Costs
Dynamic programming
generation scheduling
Genetics
Microorganisms
Power generation
Power systems
Processor scheduling
Production
unit commitment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The unit commitment (UC) problem is one of the most difficult optimization problems in power system, because this problem has many variables and constraints. The objective is the minimization of the total production cost over the scheduling horizon while the constraints must be satisfied, too. This paper employs a new evolutionary algorithm known as bacterial foraging (BF) for solving the UC problem. This new integer-code algorithm is on the base of foraging behavior of E-coli Bacteria in the human intestine. By integer coding of the problem, computation time decreases and the minimum up/down-time constraints may be coded directly, and therefore, there is no need to use penalty functions for these constraints. From simulation results, satisfactory solutions are obtained in comparison with previously reported results.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2009.2021216