THE OPTIMIZATION OF TRANSPORT NETWORK’S ROUTES FOR SNOW CLEANING PROCESS ON THE EXAMPLE OF TOMSK CITY

UDC 608.2

M.S. Krutko, T.E. Grigorieva


The optimization of snow cleaning routes was conducted using the example of Tomsk city in order to minimize idling and disturbing of vehicle traffic. It that regard routes of the Tomsk snow-removing vehicles are described, the analysis of which showed that they are not the best. The graph theory is proposed to be applied in order to construct an optimal route of snow removal vehicles, because transport network is a connected oriented graph. Specifically, the lowest total length of the Hamiltonian contour is searched using the traveling salesman problem with branch and bound algorithm. The approved snow removal regulations are considered, when selecting the optimal route. According to these regulations the first category streets should be cleaned in 4 hours, the streets of category II – in 8 hours, the streets of category III – in 12 hours. Based on calculations, the obtained optimal route theoretically can improve the process of snow removal in the city. Moreover, construction of route’s graph is not tied to specifics of the city streets location, so this optimization can be considered universal. It should not only reduce the time of harvesting snow in general, but also reduce the time of building routes themselves.

Keywords: snow cleaning, routes, optimization, graphs.

Full text:
KrutkoGrigorieva_3_18_1.pdf