Geodesic
The choice of algorithms for solving a multi-agent routing problem based on solving related problems
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 34 (2024) no. 3, pp. 449-465

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

The paper considers the problem of reducing the complexity of $NP$-hard problems by using related problems for which an optimal or acceptable solution is already known. For multi-agent routing tasks, a technique is used based on network clustering consistent with traveling salesman routes on each cluster and constructing routes that take into account the limitation of delivery time windows. A mathematical model is presented that corresponds to a block of pseudo-Boolean conditional optimization with constraints in the form of disjunctive normal forms that allows polynomial solvability and a block of time constraints. The results of choosing metaheuristics based on related problems are used in a program for the delivery of goods by many agents to consumers located at the vertices of the regional infrastructure road network.
Keywords: multi-agent traveling salesman problem, time windows, metaheuristics, applied routing problem 
@article{VUU_2024_34_3_a8,
     author = {M. G. Kozlova and V. A. Lukyanenko and O. O. Makarov},
     title = {The choice of algorithms for solving a multi-agent routing problem based on solving related problems},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {449--465},
     publisher = {mathdoc},
     volume = {34},
     number = {3},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2024_34_3_a8/}
}
TY  - JOUR
AU  - M. G. Kozlova
AU  - V. A. Lukyanenko
AU  - O. O. Makarov
TI  - The choice of algorithms for solving a multi-agent routing problem based on solving related problems
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2024
SP  - 449
EP  - 465
VL  - 34
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VUU_2024_34_3_a8/
LA  - ru
ID  - VUU_2024_34_3_a8
ER  - 
%0 Journal Article
%A M. G. Kozlova
%A V. A. Lukyanenko
%A O. O. Makarov
%T The choice of algorithms for solving a multi-agent routing problem based on solving related problems
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2024
%P 449-465
%V 34
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VUU_2024_34_3_a8/
%G ru
%F VUU_2024_34_3_a8
M. G. Kozlova; V. A. Lukyanenko; O. O. Makarov. The choice of algorithms for solving a multi-agent routing problem based on solving related problems. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 34 (2024) no. 3, pp. 449-465. http://geodesic.mathdoc.fr/item/VUU_2024_34_3_a8/