Bacterial foraging algorithm with varying population for optimal power flow

23Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a novel optimization algorithm, Bacterial Foraging Algorithm with Varying Population (BFAVP), to solve Optimal Power Flow (OPF) problems. Most of the conventional Evolutionary Algorithms (EAs) are based on fixed population evaluation, which does not achieve the full potential of effective search. In this paper, a varying population algorithm is developed from the study of bacterial foraging behavior. This algorithm, for the first time, explores the underlying mechanisms of bacterial Chemotaxis, quorum sensing and proliferation, etc., which have been successfully merged into the varyingpopulation frame. The BFAVP algorithm has been applied to the OPF problem and it has been evaluated by simulation studies, which were undertaken on an IEEE 30-bus test system, in comparison with a Particle Swarm Optimizer (PSO) [1]. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Li, M. S., Tang, W. J., Tang, W. H., Wu, Q. H., & Saunders, J. R. (2007). Bacterial foraging algorithm with varying population for optimal power flow. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 32–41). Springer Verlag. https://doi.org/10.1007/978-3-540-71805-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free