Not checkedNot checked for notices yet.
Improving the efficiency of the hybrid algorithm for solving inhomogeneous minimax problem
Kobak V, Zhukovskiy A, Porksheyan V and 1 more
E3S Web of Conferences · 2020
doi:10.1051/e3sconf/202022401012 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
The article deals with the problem of inhomogeneous minimax problem solution, what is typical of scheduling theory. This problem is NPcomplete, and there is no exact algorithm for it, which has a polynomial time for large-scale problems. Therefore a quick algorithm that gets approximate tables is used. A possible method for solving this problem is considered a hybrid model, representing the synthesis of two genetic algorithms models, namely models Goldberg and CGS. Goldberg’s model is viewed from multiple crossovers and most promising mutation. As it is difficult to make calculations analytically and often impossible to make it in practice, the computational experiment was carried out in this article. The results of the experiment are described in the tables, which graphically show a comparison of the hybrid model effectiveness. The comparison is based on the accuracy results obtained for two types of crossovers with the basic parameters of genetic algorithm. It is proved that the use of hybrid algorithm leads to the results which are more précised to the optimal ones, despite the deterioration in the temporary search characteristics solutions.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.