IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

A Generalized and Robust Anti-Predatory Nature-Inspired Algorithm for Complex Problems

A Generalized and Robust Anti-Predatory Nature-Inspired Algorithm for Complex Problems
View Sample PDF
Author(s): Rohit Kumar Sachan (Motilal Nehru National Institute of Technology Allahabad, Allahabad, India)and Dharmender Singh Kushwaha (Motilal Nehru National Institute of Technology Allahabad, Allahabad, India)
Copyright: 2019
Volume: 10
Issue: 1
Pages: 17
Source title: International Journal of Applied Metaheuristic Computing (IJAMC)
Editor(s)-in-Chief: Peng-Yeng Yin (Ming Chuan University, Taiwan)
DOI: 10.4018/IJAMC.2019010105

Purchase

View A Generalized and Robust Anti-Predatory Nature-Inspired Algorithm for Complex Problems on the publisher's website for pricing and purchasing information.

Abstract

This article describes how nature-inspired algorithms (NIAs) have evolved as efficient approaches for addressing the complexities inherent in the optimization of real-world applications. These algorithms are designed to imitate processes in nature that provide some ways of problem solving. Although various nature-inspired algorithms have been proposed by various researchers in the past, a robust and computationally simple NIA is still missing. A novel nature-inspired algorithm that adapts to the anti-predatory behavior of the frog is proposed. The algorithm mimics the self defense mechanism of a frog. Frogs use their reflexes as a means of protecting themselves from the predators. A mathematical formulation of these reflexes forms the core of the proposed approach. The robustness of the proposed algorithm is verified through performance evaluation on sixteen different unconstrained mathematical benchmark functions based on best and worst values as well as mean and standard deviation of the computed results. These functions are representative of different properties and characteristics of the problem domain. The strength and robustness of the proposed algorithm is established through a comparative result analysis with six well-known optimization algorithms, namely: genetic, particle swarm, differential evolution, artificial bee colony, teacher learning and Jaya. The Friedman rank test and the Holm-Sidak test have been used for statistical analysis of obtained results. The proposed algorithm ranks first in the case of mean result and scores second rank in the case of “standard deviation”. This proves the significance of the proposed algorithm.

Related Content

. © 2024.
Maryam AlJame, Aisha Alnoori, Mohammad G. Alfailakawi, Imtiaz Ahmad. © 2023. 27 pages.
Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar. © 2023. 16 pages.
Preeti Pragyan Mohanty, Subrat Kumar Nayak. © 2022. 32 pages.
Parag Verma, Ankur Dumka, Anuj Bhardwaj, Alaknanda Ashok. © 2022. 21 pages.
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran. © 2022. 22 pages.
Sajad Ahmad Rather, P. Shanthi Bala. © 2022. 39 pages.
Body Bottom