?????????? ??????????? ???????????? ????????? ???????? ???????? ????????: ?????????? ????????, ????????? ???????? ?? ????? ????? ? ???
Електронний архів Житомирського державного технологічного університету
View Archive Info| Field | Value | |
| Title |
?????????? ??????????? ???????????? ????????? ???????? ???????? ????????: ?????????? ????????, ????????? ???????? ?? ????? ????? ? ???
Comparison of the results of the experiment scheduling procedures methods: genetic algorithm, ant algorithm and the branch and bound method |
|
| Creator |
???????????, ?.?.
?????????, ?.?. Danylchenko, ?.?. Kravchenko, S.M. |
|
| Subject |
??????????????
?????????? ???? ?????????? ???????? ????? ????? ? ??? ????? ??????? ???????? matchings bipartite graph genetic algorithm branch and bound method the method of exhaustive search |
|
| Description |
? ?????? ???????? ?????????? ??????????? ???????????? ????????? ???????? ???????? ?????????? ????????? (?? ???????? ????????? ???????? (??????????? ???.)) ?? ?????????????? ???????? (?????????? ????????, ????????? ???????? ?? ????? ????? ?? ???) ?? ??????????? (?????????, ?????????? ??????????), ?? ???? ???????????? ??????? ??? ?????? ????????????? ?????????????? ? ??????????? ????? ?? ?????????? ????????? ??????????. ??????????? ?????????? ??????? ????????? ?? ?????????????? ?????????? ?? ????????? ??????????? ??????????? ???????? ICS_DENISH. ??????? ?????? ??????? ?? ????????? ??????????? ?? ???????????? ??????????. ? ?????? ????????????? ??????????????? ???????????? ???????????? ?????? ????????? ? ????????? ?????????????? ?????????? ??? ??????????? ???????????? ???? ? ?????????? ???????? ???????. The article presents the results of an experiment comparing scheduling procedures (for example, sanatorium ?Denyshi? (Zhytomyr region).) Methods: genetic algorithm, ant algorithm and branch and bound method, patients resort to different methods (ant, branch and bound, depletion of finding a solution options) and algorithms (for example genetic algorithms) that have been modified by the author for finding maximum matching in bipartite graphs and consider limiting compatibility. The experiment was conducted to compare different methods of computing platforms using software copyright ICS_DENISH. Reviewed by time spent on calculations and algorithms efficiency. The basis of comparative numerical experiment is necessary to select the algorithm with the least computational complexity for application use in health resorts of Ukraine. |
|
| Date |
2016-03-18T09:02:12Z
2016-03-18T09:02:12Z 2015 |
|
| Type |
Article
|
|
| Identifier |
http://eztuir.ztu.edu.ua/123456789/2084
|
|
| Language |
uk
|
|
| Relation |
?????? ????. ?????: ???????? ?????;2(73)
|
|
| Publisher |
????
|
|