THE USE OF THE GENETIC ALGORITHM FOR SOLVING THE COOPERATION PLANNING TASK
The article defines the air defense units’ interaction planning task as a scheduling problem with limited resources. Offered solution is based on a heuristic method, namely on the genetic algorithm. Suggested mathematical formalization of the task concerning scheduling the interaction of air defense...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
National Defence University of Ukraine named after Ivan Cherniakhovsky
2015-12-01
|
| Series: | Sučasnì Informacìjnì Tehnologìï u Sferì Bezpeki ta Oboroni |
| Subjects: | |
| Online Access: | http://sit.nuou.org.ua/article/view/73980 |
| Summary: | The article defines the air defense units’ interaction planning task as a scheduling problem with limited resources. Offered solution is based on a heuristic method, namely on the genetic algorithm. Suggested mathematical formalization of the task concerning scheduling the interaction of air defense units. It allows to tackle the task aiming to develop the schedule table that reflects the interaction of air defence forces and facilities by three optimization criteria. The first criterion is the minimum time needed to accomplish the task; the second one is the minimum resources involved in task fulfillment; and the third relates to the minimum duration of the air defense units in active mode. Genetic algorithm suggested by the author of the article allows to develop near optimal variant of the schedule table showing interaction of air defense units by three criteria, as well as make alterations in compliance with occurred changes in real time. |
|---|---|
| ISSN: | 2311-7249 2410-7336 |