АЛГОРИТМ ПОИСКА ОПТИМАЛЬНОЙ СЕТИ ПОЛИГОНОВ СБОРА ТВЕРДЫХ КОММУНАЛЬНЫХ ОТХОДОВ

Abstract

The aim of the study is to develop an algorithm for constructing a network of polygons for storing, recycling and neutralizing industrial and consumer waste in a certain region, taking into account the generated mass of solid communal waste and the existing transport network, allowing one to come to an economically optimal solution. The mathematical methods presented in the scientific literature are aimed at solving problems of determining the optimal location of logistics infrastructure objects, namely a manufacturing plant, a warehouse, a distribution centre, a retail outlet. The paper formulates and implements an algorithm for constructing an optimal network of polygons, which would minimize economic costs for logistics, construction, and operation of the polygons. The main factors taken into account are the mass of generated solid communal waste, the transportation cost from the temporary accumulation site to the solid communal waste polygon, the distance between administrative centres. The basic principle of searching for the logistics extremum is based on determining the main node, that is the one with the largest mass of solid communal waste along all available road junctions and choosing the polygon location based on the condition of the maximum difference in annual logistics costs. Using the proposed algorithm, the paper solves the problem of determining the number and location of solid communal waste polygons for the southern part of the Komi Republic.