Last-Mile Fleet Routing & Spatial Optimization
This project tackles the Capacitated Vehicle Routing Problem (CVRP) for a simulated last-mile delivery network in Kolkata. By integrating Unsupervised Machine Learning (K-Means Clustering) with Operations Research heuristics, the algorithm dynamically partitions delivery zones and calculates the mathematically shortest route for a multi-truck fleet. The goal of this project is to demonstrate how algorithmic decision-making can directly reduce fuel consumption, balance driver workloads, and improve overall supply chain efficiency.