Back to Projects
A fair-allocation and vehicle-routing engine that protects regional equity while reducing travel distance under a 70% stock constraint.
The planner solves allocation and routing together. It first protects the minimum regional service ratio, then improves regional balance, and only then minimizes distance. A modular C++ architecture keeps allocation, routing, validation, metrics, and visualization independent.
Core Features
Fair regional targets derived from available stock and regional demand
Capacity-constrained cheapest-insertion route construction
2-opt and fairness-preserving local search for distance reduction
Strict validation of stock, demand, vehicle capacity, and route uniqueness
Interactive route dashboard for three official CVRPLIB instances
Built With
C++
CVRP
Local Search
2-opt
SVG
70%Available stock
3Benchmark instances
5Vehicles per instance
3Optimization priorities
Project Previews
Illustrative interface concepts for Fair Relief Routing.
Preview 2 of 3