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

Minimax routing problem with a system of priority tasks

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

Информация об архиве | Просмотр оригинала
 
 
Поле Значение
 
Заглавие Minimax routing problem with a system of priority tasks
 
Автор Chentsov, A. G.
Chentsov, A. A.
 
Тематика DECOMPOSITION
DYNAMIC PROGRAMMING
ROUTE
 
Описание For a minimax routing problem with precedence conditions and cost functions that allow dependence on the list of tasks, we study the statement for which some of the tasks are allocated as first-priority ones. Other tasks can be started only after the fulfillment of priority tasks. The tasks themselves are connected with visiting megacities and, in particular, individual cities (terms corresponding to works in the field of solving the traveling salesman problem). One needs to find the extremum of arising two-stage problem with a minimax criterion, as well as the optimal compositional solution. In the paper, the optimal algorithm implemented on a PC is substantiated and built; a computational experiment is carried out. Possible applications may be related to some problems of aviation logistics in which it is required to ensure the visit of one vehicle (airplane or helicopter) to a system of aerodromes under a limited fuel reserve at each stage of the flight task; refueling is expected at points of visit (it is also assumed that a set of priority tasks is allocated). © 2024 Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta. All rights reserved.
 
Дата 2024-04-05T16:39:12Z
2024-04-05T16:39:12Z
2023
 
Тип Article
Journal article (info:eu-repo/semantics/article)
|info:eu-repo/semantics/publishedVersion
 
Идентификатор Ченцов, АГ & Ченцов, АА 2023, 'МИНИМАКСНАЯ ЗАДАЧА МАРШРУТИЗАЦИИ С СИСТЕМОЙ ПЕРВООЧЕРЕДНЫХ ЗАДАНИЙ', Известия Института математики и информатики Удмуртского государственного университета, Том. 62, стр. 96-124. https://doi.org/10.35634/2226-3594-2023-62-08
Ченцов, А. Г., & Ченцов, А. А. (2023). МИНИМАКСНАЯ ЗАДАЧА МАРШРУТИЗАЦИИ С СИСТЕМОЙ ПЕРВООЧЕРЕДНЫХ ЗАДАНИЙ. Известия Института математики и информатики Удмуртского государственного университета, 62, 96-124. https://doi.org/10.35634/2226-3594-2023-62-08
2226-3594
Final
All Open Access, Bronze
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85183621424&doi=10.35634%2f2226-3594-2023-62-08&partnerID=40&md5=5e269d705b11ecea6676f8349a41aff7
https://www.mathnet.ru/php/getFT.phtml?jrnid=iimi&paperid=456&what=fullt&option_lang=eng
http://elar.urfu.ru/handle/10995/131130
54938928
10.35634/2226-3594-2023-62-08
85183621424
001163723700008
 
Язык 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