Anna Chakra reaches the 2026 Edelman final with OR-based route optimisation saving ₹250 crore for 810 M beneficiaries; pseudo-compact MIP formulations make stochastic CVRP solvable in Gurobi without scenario enumeration; and the Term of the Day is Predict-then-Optimize.
Transcript ▼
Welcome to the Decision Optimisation Radar for 24 April 2026.
Today we cover three things. First, Anna Chakra: India's Department of Food and Public Distribution, partnering with IIT Delhi and the World Food Programme, has been named a 2026 Franz Edelman finalist for deploying an operations-research-based route optimisation system across India's national foodgrain supply chain. The system serves over 810 million beneficiaries, saves an estimated 250 crore rupees per year in transport cost, and cuts logistics emissions by 35 percent — all from integrating a standard routing solver with live government GIS and rail-freight data.
Second, in research: Tomazella, Munari, and Morabito post the first family of pseudo-compact MIP formulations for the Capacitated Vehicle Routing Problem with Stochastic Demands. For the first time, practitioners can solve stochastic routing to optimality using Gurobi or HiGHS directly, without building scenario-enumeration code. The formulation covers preventive restocking and detour-to-depot recourse policies.
And the Term of the Day is Predict-then-Optimize: the two-phase pipeline where an ML model forecasts uncertain parameters and hands them to an optimisation solver as if they were known. The pipeline is modular and popular, but it hides a training-objective mismatch — the ML model is trained on forecast accuracy, not on decision quality. In vehicle routing and scheduling problems with capacity-hinge inputs, this mismatch generates expensive recourse actions far more often than a decision-aware training approach would.
That's the DO Radar for 24 April 2026. Links to all sources in the issue.
India DFPD Anna Chakra Reaches 2026 Franz Edelman Final: OR-Based Foodgrain Route Optimisation Saves ₹250 Crore Annually for 810 Million Beneficiaries 🔗
Foundation: India’s Public Distribution System (PDS) is among the world’s largest food security networks — it moves millions of tonnes of subsidised grain from central procurement points through state warehouses to more than half a million Fair Price Shops (FPS) that serve over 810 million beneficiaries. The routing problem is formidable: thousands of depots, tens of thousands of FPS locations, heterogeneous road infrastructure, varied rail and road modal choices, state-level regulatory constraints, and real-time fluctuations in procurement and demand. Before Anna Chakra, route assignments were planned manually by state officials using spreadsheets and institutional memory, resulting in unnecessary transport cost, overlapping routes, and excess emissions.
India’s Department of Food and Public Distribution (DFPD), working with IIT Delhi’s Public Systems Lab and the World Food Programme (WFP), built Anna Chakra as an operations-research-based decision support platform for state-specific PDS logistics. The system integrates warehouse and FPS locations, road distances, storage capacities, and procurement point data to identify minimum-cost Vehicle Routing Problem (VRP)Assigns a fleet of vehicles to visit customers, minimising total travel while respecting capacity and time-window constraints. assignments. Live feeds from PM Gati Shakti (the national logistics integration platform) and the Indian Railways FOIS portal keep the model current. Anna Chakra is deployed across all 36 states and union territories of India, saving an estimated ₹250 crore (~USD 30 million) per year, reducing logistics-related emissions by 35 percent, and serving over 810 million beneficiaries at zero capital expenditure. The project was named a 2026 Franz Edelman Award finalist at the INFORMS Analytics+ Conference in National Harbor, Maryland.
Pseudo-Compact Formulations and Branch-and-Cut Approaches for the Capacitated Vehicle Routing Problem with Stochastic Demands 🔗
Foundation: In the Capacitated Vehicle Routing Problem (VRP)Assigns a fleet of vehicles to visit customers, minimising total travel while respecting capacity and time-window constraints. with Stochastic Demands (CVRPSD), customer demand is not known when routes are planned — it is only revealed when the vehicle arrives. If cumulative demand on a route exceeds the vehicle’s capacity, the vehicle must either take a recourse trip back to the depot (detour policy) or make a preventive restocking stop before the capacity is hit (preventive policy). The standard approach — scenario-based stochastic programming — enumerates a large but finite set of demand realisations and solves a MIP over all of them. That blows up quickly: a 30-customer instance with binary demands already has over a billion scenarios.
Tomazella, Munari, and Morabito, posting to Optimization Online on 20 April 2026, introduce the first family of pseudo-compact Mixed Integer Programming (MIP)A linear programme with some variables restricted to integers; the workhorse of discrete optimisation. formulations for the CVRPSD. Rather than enumerating scenarios, the formulations model expected recourse cost of a route analytically and embed it directly into the MIP objective, keeping the model size in the hundreds of variables rather than the millions. Separate formulations cover the preventive restocking policy, the detour-to-depot policy, and a combined policy. Each formulation is solvable directly by off-the-shelf MIP solvers such as Gurobi or HiGHS. Branch-and-CutAn exact MIP algorithm that builds a search tree of LP relaxations, pruning branches proven suboptimal and adding cutting planes to tighten bounds. algorithms augmented with valid inequalities outperform the scenario-based approach on standard CVRPSD benchmarks, closing more instances to optimality in equal time.
Predict-then-Optimize
“To understand is to know what to do.” — Ludwig Wittgenstein, Philosophical Investigations (1953)
Predict-then-Optimize is a two-phase pipeline: an ML model is first trained to forecast uncertain input parameters — demand, travel time, cost, yield — and those forecasts are then handed to an optimisation solver as if they were known facts. The pipeline is intuitive and modular, but it contains a subtle flaw: the ML model is trained to minimise forecast error (typically mean squared error, or MSE), not to minimise the downstream decision error that actually matters. A forecast that is accurate on average can still produce routinely wrong decisions if the errors happen to fall in exactly the directions the solver is most sensitive to.
A concrete example
A grocery distribution planner needs to decide tonight how many pallets to route to each of 40 stores for tomorrow. The demand at each store is uncertain, so the planner first runs a gradient-boosted tree model that predicts tomorrow’s demand at each store from features: day of week, weather, local events, recent POS (Point-of-Sale) data. Those predictions are then handed to a vehicle routing solver as fixed demand parameters, and the solver produces a pallet-routing plan.
The ML model is trained to minimise mean squared forecast error across all 40 stores. It does this well. But the routing solver is very sensitive to under-predictions at stores near the capacity limit of a route — a 10-pallet shortfall at one store can cascade into two extra vehicle journeys. The same 10-pallet shortfall at a store with slack capacity costs almost nothing. Training on MSE treats all prediction errors as equally bad. The result is a routing plan that performs fine in expectation but generates expensive recourse trips far more often than a decision-aware model would.
The fix is to train the demand model not on MSE but on a loss that measures how much each forecast error degrades the routing plan — a decision loss. This is harder to implement but directly optimises the objective the business actually cares about.
Why practitioners misread this
It is not a critique of using ML in optimisation pipelines. Predict-then-Optimize is the dominant architecture precisely because it is modular, interpretable, and easy to maintain. The critique is narrower: that MSE-trained predictors are not calibrated to the sensitivity structure of the downstream solver. Swapping to a decision-aware loss, or at minimum understanding which forecast errors are costly versus cheap, recovers most of the gap without abandoning the pipeline.
The problem is worst when solver sensitivity is asymmetric and concentrated. If the solver responds roughly equally to under- and over-prediction across all inputs, Predict-then-Optimize works well. It breaks down when there are a small number of ‘hinge’ inputs where the solver is highly sensitive in one direction (e.g. capacity limits in vehicle routing, budget limits in portfolio allocation, lead-time commitments in scheduling). Identifying those hinge inputs is the practical diagnostic step before deciding whether decision-aware training is worth the implementation cost.
The gap is real but often small in practice. Multiple empirical studies find that decision-aware training closes 10–30 % of the optimality gap attributable to forecast error in routing and inventory settings. For most operations, that is material but not transformative. The business case for decision-aware training rises sharply when hinge inputs are concentrated (routing capacity limits, power-grid ramp constraints, pharmaceutical batch yields) and falls when errors are diffuse across many small inputs.
Where this shows up in practice
Predict-then-Optimize is the standard architecture for any ML-guided supply chain, logistics, energy dispatch, or workforce scheduling system. It appears wherever a demand or cost forecast feeds directly into a planning or routing solver. The decision-awareness gap is most consequential in vehicle routing (capacity hinge), unit commitment (ramp-rate hinge), portfolio rebalancing (risk-budget hinge), and pharmaceutical batch scheduling (yield hinge). Today’s CVRP paper by Tomazella et al. addresses the downstream consequence of demand uncertainty in routing; the Predict-then-Optimize framing explains why the upstream forecasting step needs to be designed with that sensitivity in mind.
- Anna Chakra Route optimisation at national-government scale is not bottlenecked by the algorithm — it is bottlenecked by data integration. Anna Chakra’s 35 % emissions reduction and ₹250-crore annual saving came from wiring a live GIS and rail-freight feed into a standard routing solver, not from a new algorithmic method.
- Stochastic CVRP For the first time, the Capacitated Vehicle Routing Problem with Stochastic Demands admits a pseudo-compact MIP formulation solvable in Gurobi or HiGHS without scenario enumeration, lowering the barrier for logistics teams who already own a commercial solver but have avoided stochastic routing as too computationally heavy.