Study on Spatial Distance Optimization of Delivery of Mails from the Nearest Postal Location

The study's main objective is to develop a model using the Travelling Salesman Problem (TSP) technique to create efficient routes for postmen delivering articles in their beat areas. The goal is to minimize spatial distance while meeting customer service standards in the shortest time. The methodology analyses geographical data, beat areas, and past delivery patterns to formulate TSP instances for each postman's route. The 2-opt algorithm optimizes the routes. The model's performance is evaluated by comparing delivery time and spatial coverage to the manual routing system. The study aims to enhance delivery efficiency and service quality, benefiting both postmen and customers. The successful application of the TSP-based RL approaches significantly optimized mail delivery routes, reducing travel distance and time. On average, the model achieved a 15% reduction in delivery time compared to conventional routing. This enhanced efficiency and customer satisfaction, providing clear, concise, and optimized routes for postmen. The research contributes to modernizing postal services through spatial distance diversification and route optimization. The combination of TSP and RL techniques revolutionizes delivery processes, reducing operational costs and improving the overall customer experience. This study's outcomes showcase the power of advanced algorithms for solving real-world challenges and hold promise for future logistics and delivery optimizations