Аннотация
With the rapid development of cities and their infrastructure, the demand for high-quality urban deliveries is increasing at the same rate. This work explores the possibilities of dynamically allocating delivery zones for courier deliveries based on data provided by the courier company. Traditional manually created delivery zones often do not ensure that the picture is relevant to the real situation in the city (weather, traffic, roads, etc.). This study presents the results of how K-Means and DBSCAN clustering algorithms can contribute to the dynamic distribution of delivery zones in clusters. The comparative analysis includes consideration of such indicators as Silhouette value and computational complexity of Big-O Notation. The results show that the K-Means algorithm creates structured and uniform clusters, while DBSCAN shows results in defining flexible clusters based on the density of data in the region. Multi-level DBSCAN provides an opportunity to reduce the concentration of “noise”, thereby increasing the coverage of all delivery points. The results obtained highlight the advantages of using clustering algorithms in creating dynamic delivery zones to improve the distribution of orders between couriers and reduce operating costs. Further research should include obtaining continuous real-time data flow to monitor the operation of algorithms in a dynamic environment.