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

A Novel Fuzzy Logic-Based Improved Cuckoo Search Algorithm

Author

Listed:
  • Krishna Gopal Dhal

    (Midnapore College (Autonomous), India)

  • Arunita Das

    (Midnapore College (Autonomous), India)

  • Jorge Gálvez

    (Universidad de Guadalajara, Mexico)

Abstract

Cuckoo Search (CS) algorithm is a nature-inspired optimization algorithm (NIOA) with less control parameters that is stable, versatile, and easy to implement. CS has good global search capabilities, but it is prone to local optima problems. As a result, it may be possible to improve the classic CS algorithm's optimization capability. Centered on fuzzy set theory, this paper introduces an improved CS version. The population of solutions has been divided into two fuzzy sets, and each solution is assigned to one of the sets based on its fitness. The fuzzy collection centroids, global best solution advice, and Lévy distribution dependent mutation are all used to boost the population's solutions. With well-accepted objective functions such as Otsu inter class variance and Kapur's entropy, the experimental analysis has been conducted on the CEC-2014 test suite and image multi-level thresholding domain. The proposed fuzzy cuckoo search (FCS) algorithm is compared to the classical CS, PSO, FA, SMA, and BA algorithm and provides satisfactory results.

Suggested Citation

  • Krishna Gopal Dhal & Arunita Das & Jorge Gálvez, 2022. "A Novel Fuzzy Logic-Based Improved Cuckoo Search Algorithm," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 13(1), pages 1-29, January.
    • Handle: RePEc:igg:jamc00:v:13:y:2022:i:1:p:1-29
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAMC.292516
    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:13:y:2022:i:1:p:1-29. 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.