A high-performance Spring Boot application that solves the Vehicle Routing Problem (VRP) by optimally allocating delivery orders to a fleet of vehicles. It uses a custom Greedy Nearest-Neighbor Algorithm with the Haversine Formula to minimize total travel distance while strictly respecting priority tiers and vehicle capacity constraints.
java spring-boot tdd maven optimization rest-api dispatch junit vehicle-routing-problem logistics fleet-management greedy-algorithm haversine-formula delivery route-optimization jpa-hibernate delivery-optimization
-
Updated
Feb 12, 2026 - Java