Geodesic
The routing bottlenecks problem (optimization within zones)
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 34 (2024) no. 2, pp. 267-285

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

A minimax routing problem with decomposition elements is considered. In the simplest case, it is supposed that the whole set of tasks is divided into a sum of two subsets (clusters), and execution of tasks from the second subset can be started only after the completion of all tasks from the first subset. For above-mentioned two-cluster problem, an algorithm has been constructed for finding the optimal compositional solution, including a route (permutation of task indices) and a starting point, which is based on the use of a broadly understood dynamic programming. Based on this approach, an algorithm was also constructed to solve the routing problem in the case of an arbitrary ordered finite set of clusters. The algorithm was implemented on a PC, and a computational experiment was carried out. Possible applications may be associated with some logistics tasks in small aviation, when it is necessary to ensure visits to many points by one vehicle (airplane, helicopter) with a limited non-stop flight range.
Keywords: dynamic programming, precedence conditions
Mots-clés : route 
@article{VUU_2024_34_2_a5,
     author = {A. G. Chentsov and A. A. Chentsov and P. A. Chentsov},
     title = {The routing bottlenecks problem (optimization within zones)},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {267--285},
     publisher = {mathdoc},
     volume = {34},
     number = {2},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2024_34_2_a5/}
}
TY  - JOUR
AU  - A. G. Chentsov
AU  - A. A. Chentsov
AU  - P. A. Chentsov
TI  - The routing bottlenecks problem (optimization within zones)
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2024
SP  - 267
EP  - 285
VL  - 34
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VUU_2024_34_2_a5/
LA  - ru
ID  - VUU_2024_34_2_a5
ER  - 
%0 Journal Article
%A A. G. Chentsov
%A A. A. Chentsov
%A P. A. Chentsov
%T The routing bottlenecks problem (optimization within zones)
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2024
%P 267-285
%V 34
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VUU_2024_34_2_a5/
%G ru
%F VUU_2024_34_2_a5
A. G. Chentsov; A. A. Chentsov; P. A. Chentsov. The routing bottlenecks problem (optimization within zones). Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 34 (2024) no. 2, pp. 267-285. http://geodesic.mathdoc.fr/item/VUU_2024_34_2_a5/