IDEAS home Printed from https://ideas.repec.org/a/bpj/mcmeap/v24y2018i1p71-77n3.html
   My bibliography  Save this article

A new hybrid cuckoo search and firefly optimization

Author

Listed:
  • Elkhechafi Mariam

    (Department of Mathematics, Ibn Tofail University, B.P 241, Kenitra, Morocco)

  • Hachimi Hanaa

    (National School of Applied Sciences, Ibn Tofail University, B.P 242, Kenitra, Morocco)

  • Elkettani Youssfi

    (Department of Mathematics, Ibn Tofail University, B.P 241, Kenitra, Morocco)

Abstract

In this paper, we present a new hybrid algorithm which is a combination of a hybrid Cuckoo search algorithm and Firefly optimization. We focus in this research on a hybrid method combining two heuristic optimization techniques, Cuckoo Search (CS) and Firefly Algorithm (FA) for the global optimization. Denoted as CS-FA. The hybrid CS-FA technique incorporates concepts from CS and FA and creates individuals in a new generation not only by random walk as found in CS but also by mechanisms of FA. To analyze the benefits of hybridization, we have comparatively evaluated the classical Cuckoo Search and Firefly Algorithms versus the proposed hybridized algorithms (CS-FA).

Suggested Citation

  • Elkhechafi Mariam & Hachimi Hanaa & Elkettani Youssfi, 2018. "A new hybrid cuckoo search and firefly optimization," Monte Carlo Methods and Applications, De Gruyter, vol. 24(1), pages 71-77, March.
    • Handle: RePEc:bpj:mcmeap:v:24:y:2018:i:1:p:71-77:n:3
    DOI: 10.1515/mcma-2018-0003
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/mcma-2018-0003
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/mcma-2018-0003?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:bpj:mcmeap:v:24:y:2018:i:1:p:71-77:n:3. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.