Contents I. Introduction
For several real-word optimization problems, we often require expensive computing to obtain optimal solutions. In several situations, we pick the best solution from the pool of available solutions that satisfies all the constraints. However, it is not considered as the optimal solution. Optimization problems have different structures but have single or multi-objectives and combinatorial optimization problems [1]. The complexity of the problems is increasing, so it is necessary to locate new modified or hybrid algorithms to handle the pervasive computational issues. However, the algorithm should be efficient and should not be too expensive for computing. One concept is that we can carry out the process of optimization rapidly in areas where it is not more complex.