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

Environmental Adaption Method: A Heuristic Approach for Optimization

Environmental Adaption Method: A Heuristic Approach for Optimization
View Sample PDF
Author(s): Anuj Chandila (IEC-CET, Greater Noida, India), Shailesh Tiwari (CSED, ABES Engineering College, Ghaziabad, India), K. K. Mishra (MNNIT Allahabad, India)and Akash Punhani (ABES Engineering College, Ghaziabad, India)
Copyright: 2019
Volume: 10
Issue: 1
Pages: 25
Source title: International Journal of Applied Metaheuristic Computing (IJAMC)
Editor(s)-in-Chief: Peng-Yeng Yin (Ming Chuan University, Taiwan)
DOI: 10.4018/IJAMC.2019010107

Purchase

View Environmental Adaption Method: A Heuristic Approach for Optimization on the publisher's website for pricing and purchasing information.

Abstract

This article describes how optimization is a process of finding out the best solutions among all available solutions for a problem. Many randomized algorithms have been designed to identify optimal solutions in optimization problems. Among these algorithms evolutionary programming, evolutionary strategy, genetic algorithm, particle swarm optimization and genetic programming are widely accepted for the optimization problems. Although a number of randomized algorithms are available in literature for solving optimization problems yet their design objectives are same. Each algorithm has been designed to meet certain goals like minimizing total number of fitness evaluations to capture nearly optimal solutions, to capture diverse optimal solutions in multimodal solutions when needed and also to avoid the local optimal solution in multi modal problems. This article discusses a novel optimization algorithm named as Environmental Adaption Method (EAM) foable 3r solving the optimization problems. EAM is designed to reduce the overall processing time for retrieving optimal solution of the problem, to improve the quality of solutions and particularly to avoid being trapped in local optima. The results of the proposed algorithm are compared with the latest version of existing algorithms such as particle swarm optimization (PSO-TVAC), and differential evolution (SADE) on benchmark functions and the proposed algorithm proves its effectiveness over the existing algorithms in all the taken cases.

Related Content

Abid Sabrina, Debbat Fatima. © 2024. 20 pages.
Maryam AlJame, Aisha Alnoori, Mohammad G. Alfailakawi, Imtiaz Ahmad. © 2023. 27 pages.
Trust Tawanda, Philimon Nyamugure, Elias Munapo, Santosh Kumar. © 2023. 16 pages.
Sarab Almuhaideb, Najwa Altwaijry, Shahad AlMansour, Ashwaq AlMklafi, AlBandery Khalid AlMojel, Bushra AlQahtani, Moshail AlHarran. © 2022. 22 pages.
Preeti Pragyan Mohanty, Subrat Kumar Nayak. © 2022. 32 pages.
Sajad Ahmad Rather, P. Shanthi Bala. © 2022. 39 pages.
Ines Sbai, Saoussen Krichen. © 2022. 34 pages.
Body Bottom