Variational Genetic Algorithm for NP-hard Scheduling Problem Solution

The article is devoted to the study of metaheuristic method for scheduling problems solution. The article describes genetic algorithm successfully applied to solve the problems. The article considers the model of a problem of an optimal timetable development, describes genetic algorithm applied to the problem. The results of the algorithm are provided. © 2017 The Authors.

Авторы
Diveev A.I. 1, 2 , Bobr O.V. 1
Conference proceedings
Procedia Computer Science
Издательство
Elsevier B.V.
Язык
English
Страницы
52-58
Статус
Published
DOI
10.1016/J.PROCS.2017.01.010
Том
103
Год
2017
Организации
  • 1 Peoples' Friendship University of Russia, Miklukho-Maklaya str. 6, Moscow, 117198, Russian Federation
  • 2 Dorodnicyn Computing Centre of FRC Computer Science and Control, Russian Academy of Sciences, Vavilova str. 40, Moscow, 119333, Russian Federation
Ключевые слова
genetic algorithm; small variations of the basic solutions; timetable
Цитировать
ГОСТ MLA RIS BibTex
Поделиться

Другие записи