Adaptação da heurística clarke-wright para o problema de roteamento com múltiplos depósitos, entregas divididas e em lotes

Abstract

This work presents an adaptation of the Clarke-Wright savings algorithm for the Multi-Depot Split Delivery Vehicle Routing Problem with Batch Deliveries (SDVRP-MD). The problem consists of determining efficient routes for vehicles departing from multiple depots and making split and batch deliveries to customers. The implementation was carried out in Python, allowing a single customer to be served by multiple vehicles. The objective is to minimize the total traveled distance while ensuring a better distribution of deliveries among depots. The results will be compared with an existing work to evaluate the effectiveness of the proposed approach in optimizing routes and allocating deliveries.