By Topic

Bacterial Foraging Algorithm for Optimal Power Flow in Dynamic Environments

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tang, W.J. ; Dept. of Electr. Eng. & Electron., Univ. of Liverpool, Liverpool ; Li, M.S. ; Wu, Q.H. ; Saunders, J.R.

Optimal power flow (OPF) problem has already been attempted as a static optimization problem, by adopting conventional gradient-based methods and more recently, nonconventional ones, such as evolutionary algorithms. However, as the loads, generation capacities and network connections in a power system are always in a changing status, these static-oriented methods are of limited use for this issue. This paper presents a new algorithm, dynamic bacterial foraging algorithm (DBFA), for solving an OPF problem in a dynamic environment in which system loads are changing. DBFA is based on the recently proposed BFA which mimics the basic foraging behavior of E. coli bacteria. A selection scheme for bacteria's reproduction is employed in DBFA, which explores the self-adaptability of each bacterium in the group searching activities. DBFA has been evaluated, for optimizing the power system fuel cost with the OPF embedded, on the standard IEEE 30-bus and 118-bus test systems, respectively, with a range of load changes which occurred in different probabilities. The simulation results show that DBFA can more rapidly adapt to load changes, and more closely trace the global optimum of the system fuel cost, in comparison with BFA and particle swarm optimizer.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:55 ,  Issue: 8 )