The University of Southampton
University of Southampton Institutional Repository

Irrigation scheduling with travel times

Irrigation scheduling with travel times
Irrigation scheduling with travel times
In preparing water allocation schedules for fields in a lateral unit, the time required for water to travel from one point to a lateral to another is significant and dependent on the sequence in which users abstract water. In this paper illustrates the problem of ignoring travel time and/or considering travel time to be sequence independent. For two users each requesting water for a duration of 4 hours, by assuming travel time to be sequence independent, one user receives water for 5 hours 25% increase and the other receives water for only 3 hours 25% decrease. This paper presents a formulation of the irrigation scheduling problem for sequential users with sequent dependent travel time. The formulation is implemented as an integer programme and applied to a part of a lateral unit on the Juan Distributary, Haryana, India. Two models are presented, the first allows for non-contiguous jobs i.e. idle time is permitted between jobs. The second model does not permit non-contiguous jobs.
0733-9437
220-227
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
De Vries, Tonny T.
bade5b3c-2f5b-426a-9bc7-1c060b5a2509
Anwar, Arif A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31

De Vries, Tonny T. and Anwar, Arif A. (2006) Irrigation scheduling with travel times. Journal of Irrigation and Drainage Engineering, ASCE, 132 (3), 220-227. (doi:10.1061/(ASCE)0733-9437(2006)132:3(220)).

Record type: Article

Abstract

In preparing water allocation schedules for fields in a lateral unit, the time required for water to travel from one point to a lateral to another is significant and dependent on the sequence in which users abstract water. In this paper illustrates the problem of ignoring travel time and/or considering travel time to be sequence independent. For two users each requesting water for a duration of 4 hours, by assuming travel time to be sequence independent, one user receives water for 5 hours 25% increase and the other receives water for only 3 hours 25% decrease. This paper presents a formulation of the irrigation scheduling problem for sequential users with sequent dependent travel time. The formulation is implemented as an integer programme and applied to a part of a lateral unit on the Juan Distributary, Haryana, India. Two models are presented, the first allows for non-contiguous jobs i.e. idle time is permitted between jobs. The second model does not permit non-contiguous jobs.

This record has no associated files available for download.

More information

Published date: 2006

Identifiers

Local EPrints ID: 39410
URI: http://eprints.soton.ac.uk/id/eprint/39410
ISSN: 0733-9437
PURE UUID: c9d5dc70-4a26-42c3-bf9d-d3535653d415
ORCID for Arif A. Anwar: ORCID iD orcid.org/0000-0002-3071-3197

Catalogue record

Date deposited: 28 Jun 2006
Last modified: 16 Mar 2024 02:55

Export record

Altmetrics

Contributors

Author: Tonny T. De Vries
Author: Arif A. Anwar ORCID iD

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×