DEVELOPMENT OF AN ALGORITHM FOR OPTIMIZING THE ROUTING OF GOODS DELIVERY

This article examines the problem of optimizing delivery routes in urban logistics. The goal of the study is to develop an efficient routing algorithm that minimizes total delivery costs while meeting customer time windows. The paper analyzes classical methods for solving the vehicle routing problem and identifies their limitations in modern conditions. A combined algorithm is proposed, combining the Clark-Wright heuristic for generating initial solutions with a local search procedure and a permutation operator for improving them. The algorithm takes into account key practical constraints: vehicle carrying capacity, delivery time windows, and driver workday hours. Results of computational experiments on test data demonstrate the advantage of the proposed algorithm over the classical "nearest neighbor" heuristic: a 17.3% reduction in total mileage and a 12.5% reduction in the number of vehicles deployed. The developed algorithm can be integrated into delivery management systems to improve the operational efficiency of logistics companies.