Computational Model Library

Irrigation Equity and Efficiency (version 1.0.0)

This framework addresses the question of how productivity of irrigated agricultural landscapes and the distribution of agricultural opportunity would shift if fees assessed to irrigators were raised to better cover costs of system maintenance. While it is a mantra that farmers are not able to pay the costs of water, recent experimental evidence from Pakistan (Bell, Shah, & Ward, 2014) suggests that they would often be willing to pay much more if it meant receiving a reliable supply.

The framework embeds several modules that may be of broader utility:

  1. A genetic algorithm to select an optimal land-use portfolio (set of crop rotations) based on a list of available crops and expected water receipt. Traits for crossover are individual crop rotations; points for mutation include crops within rotations as well as land and water allocations to rotations within a portfolio.

  2. A simple node-link-based model for water transport in an irrigation system. This model assumes all water entering the inlet will clear the system within the time-step (i.e., no built-in concept of flow rate or residence time). Flow entering a node is drawn proportionally by linked farms based on allocation, and flows out proportionally to connected outlet channels based on design capacity.

  3. A module for solving the lumpy market for agricultural water rights. Irrigators may potentially be buyers or sellers – i.e., they might have too much water to grow one crop, but too little to grow another, higher value crop – so that bid and offer prices can be very different depending on the volume of water rights for sale. Matching buyers to sellers is a solution of the knapsack problem (Strandmark, 2009).

cropAnalysis.png

Release Notes

This is the first version of this model framework and has not yet been published.

Version Submitter First published Last modified Status
1.0.0 Andrew Bell Tue Aug 30 18:36:45 2016 Tue Aug 30 18:36:45 2016 Published

Discussion

Download
This website uses cookies and Google Analytics to help us track user engagement and improve our site. If you'd like to know more information about what data we collect and why, please see our data privacy policy. If you continue to use this site, you consent to our use of cookies.