Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/1001
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | A genetic algorithm for optimizing off-farm irrigation scheduling |
Author: | Nixon, J. Dandy, G. Simpson, A. |
Citation: | Journal of Hydroinformatics, 2001; 3(1):11-22 |
Publisher: | I W A Publishing |
Issue Date: | 2001 |
ISSN: | 1464-7141 1465-1734 |
Statement of Responsibility: | J. B. Nixon, G. C. Dandy and A. R. Simpson |
Abstract: | This paper examines the use of genetic algorithm (GA) optimization to identify water delivery schedules for an open-channel irrigation system. Significant objectives and important constraints are identified for this system, and suitable representations of these within the GA framework are developed. Objectives include maximizing the number of orders that are scheduled to be delivered at the requested time and minimizing variations in the channel flow rate. If, however, an order is to be shifted, the irrigator preference for this to be by ±24 h rather than ±12 h is accounted for. Constraints include avoiding exceedance of channel capacity. The GA approach is demonstrated for an idealized system of five irrigators on a channel spur. In this case study, the GA technique efficiently identified the optimal schedule that was independently verified using full enumeration of the entire search space of possible order schedules. Results have shown great promise in the ability of GA techniques to identify good irrigation order schedules. |
Rights: | © IWA Publishing 2001 |
DOI: | 10.2166/hydro.2001.0003 |
Published version: | http://www.iwaponline.com/jh/003/jh0030011.htm |
Appears in Collections: | Aurora harvest 4 Civil and Environmental Engineering publications Environment Institute publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
hdl_1001.pdf | Accepted version | 156.8 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.