Advanced search×

Bacterial foraging algorithm with varying population

M S Li, T Y Ji, W J Tang, Q H Wu, and J R Saunders

Biosystems 100(3):13 (2010) PMID 20347927

Most of evolutionary algorithms (EAs) are based on a fixed population. However, due to this feature, such algorithms do not fully explore the potential of searching ability and are time consuming. This paper presents a novel nature-inspired heuristic optimization algorithm: bacterial foraging algorithm with varying population (BFAVP), based on a more bacterially-realistic model of bacterial foraging patterns, which incorporates a varying population framework and the underlying mechanisms of bacterial chemotaxis, metabolism, proliferation, elimination and quorum sensing. In order to evaluate its merits, BFAVP has been tested on several benchmark functions and the results show that it performs better than other popularly used EAs, in terms of both accuracy and convergency.

Copyright © 2010 Elsevier Ltd. All rights reserved.

DOI: 10.1016/j.biosystems.2010.03.003
Version: za2963e q8za7 q8zbc q8zc9 q8zd4 q8ze9 q8zf2 q8zg6

Similar articles you may find interesting…

  1. Quantifying the sorting efficiency of self-propelled run-and-tumble swimmers by geometrical ratchets
    I Berdakin, A V Silhanek, and C A Condat

    arXiv:1305.5434 [physics.bio-ph] 23 May 2013

    We study numerically how the Separation process depends on the specific motility strategies of the Microorganisms involved. Crucial properties such as the separation efficiency And the separation time for two bacterial strains are precisely defined and Evaluated. In particular, the sorting of two ba...
    View PDF
  2. Neural circuits and motivational processes for hunger.
    Scott M Sternson, J Nicholas Betley, and Zhen Fang Huang Cao

    Curr Opin Neurobiol (2013) PMID 23648085

    We review recent progress into neural circuit analysis of hunger in the mouse by focusing on a starvation-sensitive neuron population in the hypothalamus that is sufficient to promote voracious eating. We also consider research into the motivational processes that are thought to underlie hunger in o...
  3. Inference in Kingman's Coalescent with Particle Markov Chain Monte Carlo Method
    Yifei Chen and Xiaohui Xie

    arXiv:1305.0855 [stat.ML] 3 May 2013

    We propose a new algorithm to do posterior sampling of Kingman's coalescent, Based upon the Particle Markov Chain Monte Carlo methodology. Specifically, the Algorithm is an instantiation of the Particle Gibbs Sampling method, which Alternately samples coalescent times conditioned on coalescent tree...
    View PDF