Bacterial Foraging Algorithm with Varying Population for Optimal Power Flow
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 varying-population 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) .
KeywordsEvolutionary algorithm Bacterial foraging algorithm Varying population Optimal power flow
Unable to display preview. Download preview PDF.
- 1.Kennedy, J., Eberhart, R.C.: “Particle swarm optimization,”. In: IEEE international Conference on Neural Networks, vol. 4, pp. 1942–1948. IEEE Press, NJ, New York (1995)Google Scholar
- 2.Carpentier, J.: “Contribution to the econimoc dispatch problem,”. Bull. Soc. Franc. Elect. 8, 431–447 (1962)Google Scholar
- 11.Bar Tana, J., Howlett, B.J., Koshland, D.E.: “Flagellar formation in Escherichia coli electron transport mutants,”. Journal of Bacterial 130, 787–792 (1977)Google Scholar