Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Dynamic programming and questions of solvability of route bottleneck problem with resource constraints
|
|
| Автор |
Chentsov, A. G.
Chentsov, A. A. |
|
| Тематика |
DYNAMIC PROGRAMMING
PRECEDENCE CONDITIONS ROUTE |
|
| Описание |
The article deals with the problem of admissible routing for a system of cycles each of which contains exterior permutation and works connected with megalopolises (non-empty finite sets) visiting. In the initial setting, a resource constraint is given; this constraint should be fulfilled for every cycle under permutation. The solvability conditions in this problem are connected with the extremum of the auxiliary bottleneck routing problem without above-mentioned constraint, in which the apparatus of widely understood dynamic programming (DP) is used. A particular case of the setting is the known bottleneck courier problem which can be used (in particular) for routing a vehicle (airplane or helicopter) aiming to realize the given shipping system with a limited fuel reserve on each flight. An algorithm implemented on a personal computer is constructed. © 2022 Authors. All rights reserved.
Ministry of Education and Science of the Russian Federation, Minobrnauka, (075–02–2022–874) Funding. This work was funded within the framework of research at the Ural Mathematical Center supported by the Ministry of Science and Higher Education of the Russian Federation (agreement number 075–02–2022–874). |
|
| Дата |
2024-04-08T11:07:55Z
2024-04-08T11:07:55Z 2022 |
|
| Тип |
Article
Journal article (info:eu-repo/semantics/article) Published version (info:eu-repo/semantics/publishedVersion) |
|
| Идентификатор |
Ченцов, АГ & Ченцов, АА 2022, 'Динамическое программирование и вопросы разрешимости задачи маршрутизации «на узкие места» с ресурсными ограничениями', Вестник Удмуртского университета. Математика. Механика. Компьютерные науки, Том. 32, № 4, стр. 569-592. https://doi.org/10.35634/vm220406
Ченцов, А. Г., & Ченцов, А. А. (2022). Динамическое программирование и вопросы разрешимости задачи маршрутизации «на узкие места» с ресурсными ограничениями. Вестник Удмуртского университета. Математика. Механика. Компьютерные науки, 32(4), 569-592. https://doi.org/10.35634/vm220406 1994-9197 Final All Open Access; Bronze Open Access https://www.mathnet.ru/php/getFT.phtml?jrnid=vuu&paperid=827&what=fullt&option_lang=eng https://www.mathnet.ru/php/getFT.phtml?jrnid=vuu&paperid=827&what=fullt&option_lang=eng http://elar.urfu.ru/handle/10995/131538 49954429 10.35634/vm220406 85148663496 000904711300006 |
|
| Язык |
ru
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
|
|
| Формат |
application/pdf
|
|
| Издатель |
Udmurt State University
|
|
| Источник |
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki
Vestnik Udmurtskogo Universiteta: Matematika, Mekhanika, Komp'yuternye Nauki |
|