IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v11y2020i1p1-23.html
   My bibliography  Save this article

Anti-Predatory NIA for Unconstrained Mathematical Optimization Problems

Author

Listed:
  • Rohit Kumar Sachan

    (Motilal Nehru National Institute of Technology Allahabad, Allahabad, India)

  • Dharmender Singh Kushwaha

    (Motilal Nehru National Institute of Technology Allahabad, Allahabad, India)

Abstract

Nature-Inspired Algorithms (NIAs) are one of the most efficient methods to solve the optimization problems. A recently proposed NIA is the anti-predatory NIA, which is based on the anti-predatory behavior of frogs. This algorithm uses five different types of self-defense mechanisms in order to improve its anti-predatory strength. This paper demonstrates the computation steps of anti-predatory for solving the Rastrigin function and attempts to solve 20 unconstrained minimization problems using anti-predatory NIA. The performance of anti-predatory NIA is compared with the six competing meta-heuristic algorithms. A comparative study reveals that the anti-predatory NIA is a more promising than the other algorithms. To quantify the performance comparison between the algorithms, Friedman rank test and Holm-Sidak test are used as statistical analysis methods. Anti-predatory NIA ranks first in both cases of “Mean Result” and “Standard Deviation.” Result measures the robustness and correctness of the anti-predatory NIA. This signifies the worth of anti-predatory NIA in the domain of mathematical optimization.

Suggested Citation

  • Rohit Kumar Sachan & Dharmender Singh Kushwaha, 2020. "Anti-Predatory NIA for Unconstrained Mathematical Optimization Problems," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 11(1), pages 1-23, January.
  • Handle: RePEc:igg:jsir00:v:11:y:2020:i:1:p:1-23
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2020010101
    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:jsir00:v:11:y:2020:i:1:p:1-23. 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.