Modeling of the optimal patrol route of the outfit by the method of branches and borders
Abstract
Modeling of the optimal patrol route of the outfit by the method of branches and borders
Incoming article date: 21.03.2023The article is devoted to solving optimization problems related to determining the optimal patrol route of the units of the territorial bodies of the Ministry of Internal Affairs of Russia when they are serving to ensure the protection of public order and public safety on the streets and in other public places, by using one of the mathematical methods of discrete optimization to find the shortest possible movement of employees in the conditions of their limited number and changing operational the situation. The practical implementation of the technology for obtaining the best solution to the traveling salesman problem by the method of branches and boundaries, to achieve the result of which numerical modeling was used, is considered. The possibilities of finding the optimal path of movement are shown when the conditions of the problem being solved change. In conclusion, conclusions are drawn about the need to improve the classical method of branches and boundaries to obtain a more accurate result.
Keywords: mathematical modeling, optimization problem, method of branches and borders, traveling salesman, internal affairs bodies, public order protection, public safety, operational situation, forces and means, patrol route, efficient allocation of resources