The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Environmental Adaption Method: A Heuristic Approach for Optimization
|
|
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: 2021
Pages: 28
Source title:
Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-8048-6.ch016
Purchase
|
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
|
Shailendra Aote, Mukesh M. Raghuwanshi.
© 2021.
34 pages.
|
|
Anjana Mishra, Bighnaraj Naik, Suresh Kumar Srichandan.
© 2021.
15 pages.
|
|
Thendral Puyalnithi, Madhuviswanatham Vankadara.
© 2021.
15 pages.
|
|
Geng Zhang, Xiansheng Gong, Xirui Chen.
© 2021.
13 pages.
|
|
Jhuma Ray, Siddhartha Bhattacharyya, N. Bhupendro Singh.
© 2021.
19 pages.
|
|
Pijush Samui, Viswanathan R., Jagan J., Pradeep U. Kurup.
© 2021.
18 pages.
|
|
Ravinesh C. Deo, Sujan Ghimire, Nathan J. Downs, Nawin Raj.
© 2021.
32 pages.
|
|
|