The area of metaheuristics has grown immensely in the past two decades as a solution to real-world optimisation problems. They are able to perform well in situations where exact optimisation techniques fail to deliver satisfactory results. For complex optimisation problems (Nondeterministic
polynomial time-hard problems), metaheuristic techniques are able to generate good quality solution in relatively much less time than traditional optimisation techniques. Metaheuristics find applications in a wide range of areas including finance, planning, scheduling and engineering design.
This paper presents a review of various metaheuristic algorithms, their methodology, recent trends and applications.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
Affiliations:1: ECE Department, Northern India Engineering College, GGSIP University, FC-26, Shastri Park, Delhi, 110053, India 2: ECE Department, Indira Gandhi Institute of Technology, GGSIP University, Delhi, India