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.

Authors
Diveev A.I. 1, 2 , Bobr O.V. 1
Conference proceedings
Procedia Computer Science
Publisher
Elsevier B.V.
Language
English
Pages
52-58
Status
Published
DOI
10.1016/j.procs.2017.01.010
Volume
103
Year
2017
Organizations
  • 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
Keywords
genetic algorithm; small variations of the basic solutions; timetable
Date of creation
19.10.2018
Date of change
20.05.2021
Short link
https://repository.rudn.ru/en/records/article/record/6091/
Share

Other records