Genetic algorithms for the sequential irrigation scheduling problem
Genetic algorithms for the sequential irrigation scheduling problem
A sequential irrigation scheduling problem is the problem of preparing a schedule to sequentially service a set of water users. This problem has an analogy with the classical single machine earliness/tardiness scheduling problem in operations research. In previously published work, integer program and heuristics were used to solve sequential irrigation scheduling problems; however, such scheduling problems belong to a class of combinatorial optimization problems known to be computationally demanding (NP-hard). This is widely reported in operations research. Hence, integer program can only be used to solve relatively small problems usually in a research environment where considerable computational resources and time can be allocated to solve a single schedule. For practical applications, metaheuristics such as genetic algorithms (GA), simulated annealing, or tabu search methods need to be used. These need to be formulated carefully and tested thoroughly. The current research is to explore the potential of GA to solve the sequential irrigation scheduling problems. Four GA models are presented that model four different sequential irrigation scenarios. The GA models are tested extensively for a range of problem sizes, and the solution quality is compared against solutions from integer programs and heuristics. The GA is applied to the practical engineering problem of scheduling
water scheduling to 94 water users.
Anwar, A.A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
Haq, Z.U.
07ede19e-be99-4704-8817-ce7fe46001ff
Anwar, A.A.
e9a57bb7-5225-45e6-9a69-2396a6e4fd31
Haq, Z.U.
07ede19e-be99-4704-8817-ce7fe46001ff
Anwar, A.A. and Haq, Z.U.
(2012)
Genetic algorithms for the sequential irrigation scheduling problem.
Irrigation Science.
Abstract
A sequential irrigation scheduling problem is the problem of preparing a schedule to sequentially service a set of water users. This problem has an analogy with the classical single machine earliness/tardiness scheduling problem in operations research. In previously published work, integer program and heuristics were used to solve sequential irrigation scheduling problems; however, such scheduling problems belong to a class of combinatorial optimization problems known to be computationally demanding (NP-hard). This is widely reported in operations research. Hence, integer program can only be used to solve relatively small problems usually in a research environment where considerable computational resources and time can be allocated to solve a single schedule. For practical applications, metaheuristics such as genetic algorithms (GA), simulated annealing, or tabu search methods need to be used. These need to be formulated carefully and tested thoroughly. The current research is to explore the potential of GA to solve the sequential irrigation scheduling problems. Four GA models are presented that model four different sequential irrigation scenarios. The GA models are tested extensively for a range of problem sizes, and the solution quality is compared against solutions from integer programs and heuristics. The GA is applied to the practical engineering problem of scheduling
water scheduling to 94 water users.
This record has no associated files available for download.
More information
e-pub ahead of print date: 24 July 2012
Organisations:
Energy & Climate Change Group
Identifiers
Local EPrints ID: 343630
URI: http://eprints.soton.ac.uk/id/eprint/343630
ISSN: 0342-7188
PURE UUID: 2cc7ebec-108f-4354-af59-93c39ddd4565
Catalogue record
Date deposited: 09 Oct 2012 11:29
Last modified: 11 Dec 2021 03:16
Export record
Contributors
Author:
Z.U. Haq
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
