Просмотреть запись

A bottleneck routing problem with a system of priority tasks

Электронный научный архив УРФУ

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие A bottleneck routing problem with a system of priority tasks
 
Автор Chentsov, A. G.
 
Тематика DYNAMIC PROGRAMMING
PRECEDENCE CONDITIONS
ROUTE
 
Описание We consider a minimax routing problem related to visiting megacities under precedence conditions and cost functions with task list dependence. It is supposed that some megacity system requiring visiting above all is selected. For solving, an approach with decomposition into a set of two minimax routing problems is proposed. A two-step widely understood dynamic programming procedure realizing an optimal composition solution is constructed. The above-mentioned optimality is established by theoretical methods. Application of the results obtained is possible under investigation of multi-stage processes connected with regular allocation of resources. Another variant of application concerns the particular case of one-element megacities (i. e., cities) and may be related to the issues of aviation logistics under organization of flights using one tool (airplane or helicopter) under system of tasks on the realization of passing cargo transportation with prioritization of visits realized above all. © 2023 The Author(s).
Ministry of Education and Science of the Russian Federation, Minobrnauka: 075-02-2023-913
Funding. The work was performed as part of research conducted in the Ural Mathematical Center with the financial support of the Ministry of Science and Higher Education of the Russian Federation (Agreement number 075-02-2023-913).
 
Дата 2024-04-05T16:26:18Z
2024-04-05T16:26:18Z
2023
 
Тип Article
Journal article (info:eu-repo/semantics/article)
|info:eu-repo/semantics/publishedVersion
 
Идентификатор Ченцов, АГ 2023, 'ЗАДАЧА МАРШРУТИЗАЦИИ «НА УЗКИЕ МЕСТА» С СИСТЕМОЙ ПЕРВООЧЕРЕДНЫХ ЗАДАНИЙ', Известия Института математики и информатики Удмуртского государственного университета, Том. 61, стр. 156-186. https://doi.org/10.35634/2226-3594-2023-61-09
Ченцов, А. Г. (2023). ЗАДАЧА МАРШРУТИЗАЦИИ «НА УЗКИЕ МЕСТА» С СИСТЕМОЙ ПЕРВООЧЕРЕДНЫХ ЗАДАНИЙ. Известия Института математики и информатики Удмуртского государственного университета, 61, 156-186. https://doi.org/10.35634/2226-3594-2023-61-09
2226-3594
Final
All Open Access, Bronze
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85162837059&doi=10.35634%2f2226-3594-2023-61-09&partnerID=40&md5=0772b3b0fb8182cbaad9979753758d18
https://www.mathnet.ru/php/getFT.phtml?jrnid=iimi&paperid=447&what=fullt&option_lang=eng
http://elar.urfu.ru/handle/10995/130571
53741294
10.35634/2226-3594-2023-61-09
85162837059
001005574800009
 
Язык ru
 
Права Open access (info:eu-repo/semantics/openAccess)
 
Формат application/pdf
 
Издатель Udmurt State University
 
Источник Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta