A survey on nature inspired meta-heuristic algorithms with its domain specifications

Nature inspired metaheuristics algorithms are well known economical approaches for solving several hard optimization problems. This paper furnishes a survey of some of the main metaheuristics. It provides the components and concepts that are employed in these algorithms so as to research their similarities and variations. The classification adopted in this paper differentiates by the behaviors obtained to develop the wide variety of nature inspired algorithms. The literature survey is guided by the presentation of control parameters, intensification, and diversification used in these algorithms and its domain specifications.