Fair-Canal-Delivery: lexicographic max-min water delivery under deadline and capacity limits
Annotatsiya
A reproducibility package for a study of fair water delivery on an irrigation canal. Fairness is measured on the volume a user actually receives inside an agreed delivery window rather than on the volume that was scheduled: orders are reshaped before the low-pass filter that damps wave dynamics, and the worst-off delivered fraction is maximised lexicographically under the canal dynamics, gate saturation and reach capacities. An order that cannot be met returns an infeasibility certificate rather than an optimistic schedule. The package contains the library, the computation scripts, the complete result archive with its provenance record, the figures and tables the article reports, and a desktop viewer that shows every number beside the file it came from. This archive is the v0.1.0 tag of the repository at https://github.com/Adilbaygh/fair-canal-delivery. The code is released under the MIT licence; the model inputs and the computed results are released under CC BY 4.0, because the canal geometry they are derived from was published under CC BY (Bonet et al., 2025, https://doi.org/10.3390/w17091368).
Hali tarjima qilinmagan