Modification of Genetic Algorithm Based on Extinction Events and Migration

Abstract

This article presents a genetic algorithm modification inspired by events related to great extinctions. The main objective of the modification was to minimize the number of objective function solutions until the minimum for the function was established. It was assumed that, within each step, a population should be smaller than that recommended in the applicable literature, the number of iterations should be limited, the solution area should be variable, and a great extinction event should take place following several iterations. Calculations were performed for 10 individuals within a population, 10 iterations, two generations each, with a great extinction event happening once every three iterations. The developed algorithm was presented, capable of indicating the minimum number of Eggholder and Rastrigin functions, with a higher probability than the master algorithm (default “ga” in MATLAB) at the same number of objective function solutions. An algorithm was proposed focusing on minimizing the randomization of the objective function, which may be an alternative to the surrogate model. Typically, the emphasis is on achieving as much accuracy as possible. This article presents a method for minimizing the randomization of the objective function and obtaining the highest possible accuracy. A method is presented which minimizes the disadvantages of the largest computation time and the need to generate many samples for typical genetic algorithms (GAs). Optimization results for the classic GA, GEGA, WOA, SMA, and SSA algorithms for the Eggholder and Rastrigin functions were compared. A modification of the genetic algorithm was made to obtain a global extreme with satisfactory accuracy and a sufficiently high probability, while minimizing the number of samples calculated on the basis of the objective function. The developed methodology was used to fulfill the target function for the turbine disc.