Hybrid algorithm application for inhomogeneous minimax problem solution by using strong mutation

Abstract

Hybrid algorithm application for inhomogeneous minimax problem solution by using strong mutation

Kobak V.G., Zhukovskiy A.G., Kuzin A.P.

Incoming article date: 11.12.2018

The article deals with the problem of the minimax solving that are a typical problem for the theory of schedules. As a possible method for solving this problem, we consider a hybrid model, which is one of newest of genetic algorithms. A effency this model based on comprasion result accuracy, obtained by using two-point crossover, hybrid algorithm, simple and strong mutations.

Keywords: two-point crossover, hybrid algorithm, modified Goldberg model, mutation, minimax problem, scheduling theory, strong mutation, individual, generation