An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource
M.Y. Sakhno
Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Omsk, Russia
Keywords: genetic algorithm, optimized crossover, adaptive scheme, parallelizable job, energy, schedule
Abstract
Some scheduling problems taking into account energy consumption are considered. Such problems arise in multiprocessor computer systems and take into account resource constraints and parallelization capabilities. For these problems, some algorithms of greedy and list types with guaranteed accuracy estimates in the worst case are known. In this paper, we propose an adaptive genetic algorithm with decoding solutions based on the specifics of the problem statements. A peculiarity is that the crossover operator solves a problem of optimal recombination in full and truncated versions. The call of the crossover operators is implemented adaptively. The categorical and numerical parameters are adjusted adaptively by using modern packages. The results of an experimental study show a statistically significant advantage over the known algorithms on a series of problems of different structure.
|
