ГЕНЕТИЧЕСКИЙ АЛГОРИТМ РЕШЕНИЯ ЗАДАЧИ ОПТИМИЗАЦИИ ПОСЛЕДОВАТЕЛЬНОСТИ И ВРЕМЕН ПОСАДОК ВОЗДУШНЫХ СУДОВ

Abstract

The article considers a graph mapping problem (in general an NP-hard one) which occurs in the process of running a parallel task on a multiprocessor computing system. We propose a hybrid genetic algorithm to solve the problem.