PLAN WITH WHAT YOU HAVE
Compare a transport-only baseline with a priority-aware allocation. See every delivery, unused supply and unmet need before making a decision.
One unit means one consistent water quantity you choose. Costs are relative per-unit transport costs. Priorities are your assumptions, not an automatic judgment about people.
Fictional demonstration. No real community data or field validation.Start with the fictional network. Calculate to reveal the shortfall and compare it with a cheapest-route-first baseline.
Any input change invalidates the result and review. Export includes the full input, allocation, baseline, assumptions and unresolved shortfall.
The solver first minimizes priority-weighted unmet demand, then transport cost among equally good allocations. A min-cost flow network includes an explicit unmet-demand route, so impossible requests remain visible. It does not promise fairness or a deployable emergency plan.
Built with OpenAI Codex. Runtime is deterministic optimization; no AI model or hidden API is used. Source, independent exhaustive tests and limitations are in the repository.