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.

1. Iordanov A.A., Gnezdilova A.V. [Public administration in the field of solid municipal waste management]. Molodezh' i XXI vek - 2017. Materialy VII Mezhdunarodnoi molodezh-noi nauchnoi konferentsii. Molodezh' i XXI vek - 2017 materialy VII Mezhdunarodnoi molodezhnoi nauchnoi konferentsii [Youth and the XXI century-2017. Proceedings of the VII International Youth Scientific Conference]. Kursk, 2017, pp. 385-387 (In Russ.)

2. Martynova K.I., Iordanova A.V. [Investigation of environmental pollution by solid municipal waste in the Kursk region]. Aktual'nye problemy ekologii i okhrany truda. Sbornik statei XI Mezhdunarodnoi nauchno-prakticheskoi konferentsii [Actual problems of ecology and labor protection: collection of articles of the XI International scientific and practical conference]. Kursk, 2019, pp. 235-240 (In Russ.).

3. Iordanova A.V. [Research of the contribution of interdisciplinary scientific approaches to solving environmental problems related to the disposal of municipal waste]. Istoricheskie, filosofskie i metodologicheskie problemy sovremennoi nauki. Sbornik statei 2-i Mezhdu-narodnoi nauchnoi konferentsii molodykh uchenykh [Historical, philosophical and methodological problems of modern science. Collection of articles of the 2nd International scientific conference of young scientists]. Kursk, 2019, pp. 238-242 (In Russ.).

4. Yushin V.V., Popov V.M., Kiril'chuk I.O., Korovina A.Yu. Osobennosti protsedury otsenki riska negativnogo vozdeistviya ob"ektov razmeshcheniya otkhodov na okruzhayushchuyu sredu i zdorov'e naseleniya [Features of the procedure for assessing the risk of negative impact of waste disposal facilities on the environment and public health]. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta. Seriya: Tekhnika i tekhnologii = Proceedings of the Southwest State University. Series: Engineering and Technologies, 2018, no. 3 (28), pp.36-49 (In Russ.).

5. Klochkova E. N. Obosnovanie vybora algoritma poiska puti resheniya zadach postroeniya marshruta k mestu naznacheniya [Justification of the choice of the algorithm for finding a way to solve the problems of building a route to the destination]. Vestnik Moskovskogo universiteta MVD Rossii = Vestnik of Moscow University of the Ministry of Internal Affairs of Russia, 2015, no. 5, pp.205-209 (In Russ.).

6. Sven Peyer, Dieter Rautenbach, Jens Vygen. A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing. Journal of Discrete Algorithms, 2009, no.7, pp. 377-390.

7. Chowdhury M., Rahman M., Boutaba R. Vineyard: Virtual network embedding algorithms with coordinated node and link mapping. IEEE ACM Trans. Netw, 2012, no.20(1), pp. 206-219.

8. Pape U. Implementation and efficiency of moor-algorithms for the shortest route problem. Mathematical programming, 2012, 7, pp. 212-222.

9. Bi Yu Chen, Xiao-Wei Chena, Hui-Ping Chen, William H.K. Lam. Efficient algorithm for finding k shortest paths based on reoptimization technique. Transportation Research Part E. 2020. Available at: https://www.sciencedirect.com/science/article/pii/S1366554519305678

10. Ladik A. S., Masloboev A.V. Razrabotka avtomatizirovannoi informatsionnoi sis-temy upravleniya logistikoi bytovykh otkhodov (na primere g. Apatity) [Development of an automated information system for managing logistics of household waste (on the example of Apatity)]. VestnikMGTU = Vestnik of MSTU, 2016, no. 19, 1: pp. 207-216. (In Russ.)

11. Ramzaev V. M., Khaimovich I. N., Martynov I. V. [Methods of searching for shortest paths on graphs in organizational and economic systems and their implementation]. Sbornik V Mezhdunarodnoi konferentsii i molodezhnoi shkoly «Informatsionnye tekhnologii i nanotekhnologii» [Collection of the V International conference and youth school "Information technologies and nanotechnologies"]. Samara, 2019, pp. 1-8 (In Russ.)

12. Popov V.M., Merkulova E.V., Chepikov N.A., Rykunova I.O. Otsenka zagryazneniya gorodskoi sredy s primeneniem GIS-tekhnologii [Assessment of urban pollution using GIS technologies]. Izvestiya Orlovskogo gosudarstvennogo tekhnicheskogo universiteta. Seriya: Stroitel'stvo i transport = Proceedings of the Orel State Technical University. Series: Building. Stroitel'stvo. Transport, 2008, no. 2-18, pp. 48-51 (In Russ.)

13. Kiril'chuk I.O., Yushin V.V. Adaptirovannaya sistema kriteriev tipizatsii nesanktsionirovannykh svalok [Adapted system of criteria for typing unauthorized dumps]. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta. Seriya: Tekhnika i tekhnologii = Proceedings of the Southwest State University. Series: Engineering and Technologies, 2017, no. 2 (23), pp. 85-93 (In Russ.)

14. Yushin V.V., Popov V.M., Kiril'chuk I.O., Gnezdilova A.V. Razrabotka elementov informatsionno-analiticheskoi sistemy ucheta nesanktsionirovannykh svalok [Development of elements of an information and analytical system for recording unauthorized dumps]. Izvestiya Yugo-Zapadnogo gosudarstvennogo universiteta. Seriya: Upravlenie, vychislitel'naya tekhnika, informatika. Meditsinskoe priborostroenie = Proceedings of the Southwest State University. Series: Control, Computing Engineering, Information Science. Medical Instruments Engineering, 2018, vol. 8, no. 3 (28), pp. 68-80. (In Russ.)

15. Yushin V.V., Kiril'chuk I.O. Geoinformatsionnyi uchet i otsenka opasnosti stikhiinykh nesanktsionirovannykh svalok [Geoinformation accounting and risk assessment of natural unauthorized dumps]. Bezopasnost' zhiznedeyatel'nosti = Life Safety, 2017, no. 6 (198), pp. 34-42. (In Russ.)

16. Sabry A. H., Bacha A., Benhra J. A contribution to solving the traveling salesman problem using ant colony optimization and web mapping platforms Application to logistics in a urban context. in Codit'14, Metz, France, 2014.

17. Sabry A. H., Benhra J., Hicham E. H. Comparison of the performance of genetic algorithms and ant algorithms in relation to the traveling salesman problem. International Journal of Computer Applications. 2015, 19.

18. Minji Choi, Seokho Chi. Optimal route selection model for fire evacuations based on hazard prediction data. Simulation Modelling Practice and Theory, 2019, no. 94, pp. 321-333.

19. Semenov S. S., Pedan A. V., Volovikov V. S., Klimov I. S. Analiz trudoemkosti razlichnykh algoritmicheskikh podkhodov dlya resheniya zadachi kommivoyazhera [Analysis of the complexity of various algorithmic approaches for solving the traveling salesman problem. Sistemy upravleniya, svyazi i bezopasnosti = Management Systems, communications and security, 2017, no. 1, pp. 116-131. Available at: http://sccs.intelgr.com/archive/2017-01/08-Semenov.pdf (In Russ.)

20. Baldacci R., Mingozzi A., Roberti R. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research. 2012, no. 218, pp. 1-6.