IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v11y2020i2p27-55.html
   My bibliography  Save this article

Hybridizing Bees Algorithm with Firefly Algorithm for Solving Complex Continuous Functions

Author

Listed:
  • Mohamed Amine Nemmich

    (Department of Computer Science, University Mustapha Stambouli of Mascara, Mascara, Algeria)

  • Fatima Debbat

    (Department of Computer Science, University Mustapha Stambouli of Mascara, Mascara, Algeria)

  • Mohamed Slimane

    (Université de Tours, Laboratoire d'Informatique Fondamentale et Appliquée de Tours (LIFAT), Tours, France)

Abstract

In this article, two hybrid schemes using the Bees Algorithm (BA) and the Firefly Algorithm (FA) are presented for numerical complex problem resolution. The BA is a recent population-based optimization algorithm, which tries to imitate the natural behaviour of honey bees foraging for food. The FA is a swarm intelligence technique based upon the communication behaviour and the idealized flashing features of tropical fireflies. The first approach, called the Hybrid Bee Firefly Algorithm (HBAFA), centres on improvements to the BA with FA during the local search thus increasing exploitation in each research zone. The second one, namely the Hybrid Firefly Bee Algorithm (HFBA), uses FA in the initialization step for a best exploration and detection of promising areas in research space. The performance of the novel hybrid algorithms was investigated on a set of various benchmarks and compared with standard BA, and other methods found in the literature. The results show that the proposed algorithms perform better than the Standard BA, and confirm their effectiveness in solving continuous optimization functions.

Suggested Citation

  • Mohamed Amine Nemmich & Fatima Debbat & Mohamed Slimane, 2020. "Hybridizing Bees Algorithm with Firefly Algorithm for Solving Complex Continuous Functions," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 11(2), pages 27-55, April.
  • Handle: RePEc:igg:jamc00:v:11:y:2020:i:2:p:27-55
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.2020040102
    Download Restriction: no
    ---><---

    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:igg:jamc00:v:11:y:2020:i:2:p:27-55. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.