Article

Article title ALGORITHMIC IMPROVEMENT OF GENETIC ALGORITHM FOR ODD QUANTITY OF HOMOGENEOUS DEVICES
Authors V.G. Kobak, D.V. Titov, V.I. Kalyuka, V.V. Slesarev
Section SECTION III. ALGORITHMIC AND HARDWARE MAINTENANCE
Month, Year 05, 2011 @en
Index UDC 681.3+681.5
DOI
Abstract In the given work the new approach to increase in accuracy of the decision of a homogeneous distributive problem for the systems consisting of odd quantity of devices, at the expense of stage-by-stage application of genetic algorithm is considered. Efficiency such strongly the approach depends on an amount of arrangements: than amount of handling arrangements, especially the best effects more are gained at application of the given approach. The offered expedient of the solution of distributive problems for an odd amount of arrangements by means of genetic algorithm is recommended for formulation of schedules for the intelligence systems consisting of an odd amount of processors on which the great many of jobs arrives.

Download PDF

Keywords The theory of the schedules; homogeneous distributive problems; genetic algorithms.
References 1. Коффман Э.Г. Теория расписания и вычислительные машины. – M.: Наука, 1987.
2. Нейдорф Р.А., Кобак В.Г., Титов Д.В. Сравнительный анализ эффективности вариантов турнирного отбора генетического алгоритма решения однородных распределительных задач // Вестник ДГТУ. – 2009. – Т. 9. – № 3 (42). – С. 410-418.
3. Титов Д.В. Модификация генетического алгоритма распределения для четного количества однородных приборов // Известия вузов. Сев.-Кавк. регион. Технические науки.
– 2010. – № 1. – С. 3-6.

Comments are closed.