Geodesic
Minimax routing problem with a system of priority tasks
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 62 (2023), pp. 96-124

Voir la notice de l'article provenant de la source Math-Net.Ru

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).
Keywords: dynamic programming
Mots-clés : decomposition, route. 
@article{IIMI_2023_62_a7,
     author = {A. G. Chentsov and A. A. Chentsov},
     title = {Minimax routing problem with a system of priority tasks},
     journal = {Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta},
     pages = {96--124},
     publisher = {mathdoc},
     volume = {62},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIMI_2023_62_a7/}
}
TY  - JOUR
AU  - A. G. Chentsov
AU  - A. A. Chentsov
TI  - Minimax routing problem with a system of priority tasks
JO  - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
PY  - 2023
SP  - 96
EP  - 124
VL  - 62
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIMI_2023_62_a7/
LA  - ru
ID  - IIMI_2023_62_a7
ER  - 
%0 Journal Article
%A A. G. Chentsov
%A A. A. Chentsov
%T Minimax routing problem with a system of priority tasks
%J Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
%D 2023
%P 96-124
%V 62
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIMI_2023_62_a7/
%G ru
%F IIMI_2023_62_a7
A. G. Chentsov; A. A. Chentsov. Minimax routing problem with a system of priority tasks. Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 62 (2023), pp. 96-124. http://geodesic.mathdoc.fr/item/IIMI_2023_62_a7/