Development of the Authors' Method for Arranging Routes for Elimination of Unauthorized Dumps

Purpose of research is to develop a method for arraging routes for elimination of spontaneously formed unauthorized dumps on the territory of a municipal formation of a constituent entity of the Russian Federation. Methods . The development of a method for arraging routes for elimination of unauthorized dumps is based on the theory of graphs, which includes algorithms for finding the shortest path: Dijkstra's algorithm, Floyd-Warshall algorithm, Ford-Bellman algorithm, Hamiltonian cycle, etc. Having analyzed the peculiarities of using the listed algorithms, the authors have developed a method for arranging a route for the elimination of unauthorized dumps based on the Hamiltonian cycle. Results . The task of arranging a route is reduced to choosing those unauthorized dumps from the detected ones, which will be accepted as the vertices of the graph, between which it is necessary to find the shortest path. The authors' approach to the formation of a set of vertices of the graph is as follows. At the first stage, the initial and boundary conditions are set. The parking of special equipment (garbage trucks) is selected as the zero vertex of the graph, and the SMW polygon is selected as the last (nth) vertex. In this case, it should be taken in the account that after transporting waste from dumps to the place of their burial (landfill), the garbage truck must return back to the parking place. The limits taken into consideration are the maximum distance that the garbage truck can travel without refueling and the volume of the garbage truck body. Then, the closest to the starting point unauthorized dump which represents the greatest danger to the environment is chosen as the first vertex of the graph. An unauthorized dump closest to the first peak is chosen as the second, etc.. The search for vertices continues until the inequalities that take into account the given constraints are satisfied. Next, a graph, an adjacency matrix, and a route are formed. With this approach, for arranging a route, it is optimal to use the Hamiltonian cycle, which ensures finding the minimum path between all the vertices of the graph and returns to the starting point. Conclusion . Application of the authors' method for arranging routes for elimination of unauthorized dumps will make it possible to promptly clean up unauthorized dumps found in the city, which will significantly reduce the environmental load.