A NEW PERSPECTIVE OF METAHEURISTIC ALGORITHMS

Abstract

Optimization is the art of modeling in order to produce the optimal outcome under the given conditions. The objective of optimization is to maximize or decrease the consequences that best satisfy technological and management procedures. In view of the findings, this paper provides a brief survey of methods for examining the optimization problem space, illustrates the mechanics of metaheuristic and developmental calculations, and defines their connection to constructing optimization problems. In addition to covering the encoding of metaheuristic and developmental calculations and the management of constraints, this paper also delves into the periods of introductory or provisional arrangements, the iterative determination of arrangements, and the assessment of the execution of metaheuristic and developmental calculations. All meta-heuristic and developmental calculations are shown to share a single calculation with their respective phases highlighted.