Genetic algorithms for the sequential irrigation scheduling problem

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.