Metaheuristic Optimization Algorithms and recent applications: A comprehensive survey

Optimization is the process of searching optimal solution of complex problems more efficiently. There is a class of problems which is called NP (nondeterministic polynomial) problem which means that solution of NP problem based on metaheuristic approach may be verified in polynomial time which might take exponential number of steps to find the solution. To solve such problems, we may use special type of algorithm which is called Meta Heuristic (MA’s) algorithm. MA’s are able to provide near optimal solution by introducing randomization technique with deterministic approach. In this paper, we have discussed some meta heuristic algorithms and their applications in research areas.