A Survey on Parallel Nature Inspired Algorithms

Many computation tasks in science and engineering with large amount of data involve complex optimization problems for researchers. Nature Inspired based Algorithms (NIAs) are mostly know for solving complex problems in real world but also these algorithms have one of the major drawbacks of computati...

Full description

Saved in:
Bibliographic Details
Published in:Wireless personal communications 2024, Vol.138 (3), p.1893-1918
Main Authors: Kumar, Lalit, Pandey, Manish, Ahirwal, Mitul Kumar
Format: Article
Language:English
Subjects:
Algorithms
Communications Engineering
Computation
Computer Communication Networks
Engineering
Networks
Optimization
Parallel processing
Signal,Image and Speech Processing
Task complexity
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Many computation tasks in science and engineering with large amount of data involve complex optimization problems for researchers. Nature Inspired based Algorithms (NIAs) are mostly know for solving complex problems in real world but also these algorithms have one of the major drawbacks of computation cost due to complex problems or increase in the dimension of the problems. Hence, several efforts are made to achieve better computation cost by using parallelization in Nature Inspired Algorithms (NIAs). Parallel Nature Inspired Algorithms (P-NIAs) come forward to overcome the cost of these type of optimization problems. Naturally some of the NIAs are inherently parallel and known for fast processing task. This survey presents a systematic review of existing literature related to parallelization in NIAs. We offered a systematic search to identify the literature through well-reputed publications as IEEE, Elsevier, Springer, ACM, Hindawi, Inderscience, and Wiley. Out of 100 studies 77 reputable studies were selected to identify the current research trends, challenges and opportunities for parallelization in NIAs. Moreover, some problems are also discussed related to algorithm’s computation and performance.
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-024-11584-4