IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/409478.html
   My bibliography  Save this article

An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning

Author

Listed:
  • Xiaohui Yan
  • Yunlong Zhu
  • Hao Zhang
  • Hanning Chen
  • Ben Niu

Abstract

Bacterial Foraging Algorithm (BFO) is a recently proposed swarm intelligence algorithm inspired by the foraging and chemotactic phenomenon of bacteria. However, its optimization ability is not so good compared with other classic algorithms as it has several shortages. This paper presents an improved BFO Algorithm. In the new algorithm, a lifecycle model of bacteria is founded. The bacteria could split, die, or migrate dynamically in the foraging processes, and population size varies as the algorithm runs. Social learning is also introduced so that the bacteria will tumble towards better directions in the chemotactic steps. Besides, adaptive step lengths are employed in chemotaxis. The new algorithm is named BFOLS and it is tested on a set of benchmark functions with dimensions of 2 and 20. Canonical BFO, PSO, and GA algorithms are employed for comparison. Experiment results and statistic analysis show that the BFOLS algorithm offers significant improvements than original BFO algorithm. Particulary with dimension of 20, it has the best performance among the four algorithms.

Suggested Citation

  • Xiaohui Yan & Yunlong Zhu & Hao Zhang & Hanning Chen & Ben Niu, 2012. "An Adaptive Bacterial Foraging Optimization Algorithm with Lifecycle and Social Learning," Discrete Dynamics in Nature and Society, Hindawi, vol. 2012, pages 1-20, November.
    • Handle: RePEc:hin:jnddns:409478
    DOI: 10.1155/2012/409478
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2012/409478.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2012/409478.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/409478?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnddns:409478. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.