Applied Soft Computing 28 (2015) 541–549
Contents lists available at ScienceDirect
Applied Soft Computing
j ournal homepage: www.elsevier.com/locate/asoc
Evaluation of methods for estimating aquifer hydraulic parameters
b c d a,e,∗ f
S.M. Bateni , M. Mortazavi-Naeini , B. Ataie-Ashtiani , D.S. Jeng , R. Khanbilvardi
a
Faculty of Civil Engineering and Mechanics, Jiangsu University, Zhenjiang, Jiangsu, 212013, China
b
Department of Civil and Environmental Engineering, and Water Resources Research Center, University of Hawaii at Manoa, Honolulu, HI, 96822, USA
c
Department of Civil, Surveying and Environmental Engineering, University of Newcastle, Callaghan, NSW, Australia
d
Department of Civil Engineering, Sharif University of Technology, Tehran, Iran
e
Griffith School of Engineering, Griffith University, Gold Coast Campus, Queensland, QLD 4222, Australia
f
NOAA-Cooperative Remote Sensing Science & Technology Center (NOAA-CREST), City University of New York, NY, USA
a r t i c l e i n f o a b s t r a c t
Article history: An accurate estimation of aquifer hydraulic parameters is required for groundwater modeling and proper
Received 16 August 2013
management of vital groundwater resources. In situ measurements of aquifer hydraulic parameters are
Received in revised form 30 July 2014
expensive and difficult. Traditionally, these parameters have been estimated by graphical methods that
Accepted 17 December 2014
are approximate and time-consuming. As a result, nonlinear programming (NLP) techniques have been
Available online 24 December 2014
used extensively to estimate them. Despite the outperformance of NLP approaches over graphical meth-
ods, they tend to converge to local minima and typically suffer from a convergence problem. In this study,
Keywords:
Genetic Algorithm (GA) and Ant Colony Optimization (ACO) methods are used to identify hydraulic
Aquifer hydraulic parameters
parameters (i.e., storage coefficient, hydraulic conductivity, transmissivity, specific yield, and leakage
Ant Colony Optimization (ACO)
factor) of three types of aquifers namely, confined, unconfined, and leaky from real time–drawdown
Genetic Algorithm (GA)
Nonlinear programming (NLP) pumping test data. The performance of GA and ACO is also compared with that of graphical and NLP
Pumping test techniques. The results show that both GA and ACO are efficient, robust, and reliable for estimating var-
ious aquifer hydraulic parameters from the time–drawdown data and perform better than the graphical
and NLP techniques. The outcomes also indicate that the accuracy of GA and ACO is comparable. Compar-
ing the running time of various utilized methods illustrates that ACO converges to the optimal solution
faster than other techniques, while the graphical method has the highest running time.
© 2014 Elsevier B.V. All rights reserved.
1. Introduction variables. Pumping test is the most commonly used and standard
technique for inverse modeling of groundwater parameters. In this
In many parts of the world, groundwater has been used as a test, time–drawdown measurements are analyzed via the analyt-
reliable source of water for numerous purposes such as irrigation, ical solutions such as Theis, corrected Theis, and Hantush models
and domestic and industrial uses. Therefore, it is necessary to depending on the aquifer type in which the test is performed [8].
appropriately model the complex groundwater system in order to Several approaches have been proposed to solve the above-
properly manage this vital resource. To do so, an accurate specifi- mentioned inverse problem and obtain aquifer hydraulic param-
cation of aquifer hydraulic parameters such as transmissivity (T), eters. The first group of approaches is graphical. The aquifer
hydraulic conductivity (K), storage coefficient (S), leakage factor (B), hydraulic parameters estimated by the graphical technique are of
and specific yield (Sy) is needed since these parameters are com- questionable reliability since a perfect curve matching is not antic-
monly required in groundwater/aquifer flow modeling [1–7]. These ipated and the match is typically approximate [1]. The traditional
parameters can be measured by laboratory experiments or in situ graphical technique is time-consuming, burdensome, and subjec-
tests; however, the former is inaccurate, and the latter is expensive. tive [8]. The second group of approaches attempts to estimate
An alternative option for the estimation of the aquifer parame- aquifer parameters using nonlinear programming (NLP) techniques
ters is through inverse modeling. In this procedure, some variables such as the steepest descent method, conjugate gradient method,
that can be obtained more accurately (e.g., hydraulic head); then, Gauss–Newton method, Marquardt algorithm, etc. Although NLP
the aquifer parameters are inversely estimated from the measured methods often outperform the graphical approaches, they suf-
fer from a number of shortcomings. Aquifer models are typically
non-convex and nonlinear, and for such models, classical gradient-
∗ based optimization techniques may result in local optimum values
Corresponding author. Tel.: +61 755528590.
E-mail address: d.jeng@griffith.edu.au (D.S. Jeng). rather than global ones. The gradient based techniques may cause
http://dx.doi.org/10.1016/j.asoc.2014.12.022
1568-4946/© 2014 Elsevier B.V. All rights reserved.
542 S.M. Bateni et al. / Applied Soft Computing 28 (2015) 541–549
instability and convergence problems due to the numerical dif- observing the response of aquifer (drawdown) in observation wells.
ficulties. Moreover, their convergence to a global optima highly The hydraulic-head drawdowns from the pumping test can be used
depends on the selection of initial search points. Furthermore, these for aquifer characterization and the estimate of parameters such
techniques cannot find the local gradient for the problems with as transmissivity (T), storage coefficient (S), hydraulic conductivity
discontinuous objective function [4,9]. (K), leakage factor (B) and specific yield (Sy). Herein, the theoretical
To overcome the aforementioned shortcomings, the non- models for response of idealized aquifers to pumping are presented.
traditional methods such as evolutionary algorithms can be applied
as they can handle highly nonlinear, even non-smooth problems 2.1. Theis model
and converge to the global rather than local optimum. In this
study, two well-known evolutionary algorithms namely, Genetic The well-known Theis [34] solution describes radial flow to a
Algorithm (GA) and Ant Colony Optimization (ACO) are proposed fully penetrated pumping well in a homogeneous, isotropic con-
to estimate the hydraulic parameters of three major types of fined aquifer of infinite horizontal extent which is pumped at
aquifers (i.e., confined, unconfined, and leaky). An objective func- a constant rate Q. Theis solution that is considered as one of
tion is formulated for the inverse estimation using the observed the fundamental breakthroughs in the development of hydrologic
hydraulic heads from pumping tests. Thereafter, GA and ACO are modeling can be shown as follows,
utilized to minimize the objective function by tuning the aquifer Q
=
hydraulic parameters. These techniques have several advantages s(r, t) W(U) (1)
4 T
over gradient-based methods [10,11]: (1) They do not require
where s(r, t) is the drawdown at a radial distance r from the
a continuous objective function; (2) They often can find a near
pumping well at time t since the beginning of pumping, T is the
global optima and do not get trapped in a local-optimal solution;
2
transmissivity, S is the storage coefficient, U = r S/4Tt, and W(U)
(3) They provide a number of near global optima solutions and
is the Theis well function, which is given by
hence give users the ability to assess the solutions and make a ∞
decision. e−x
W(U) = dx (2)
GA has been applied in a number of groundwater optimiza- x
U
tion problems. El Harrouni et al. [12] used GA to manage pumping
from wells and to estimate hydraulic parameters in heterogeneous In this study, the Theis well function W(U) is calculated via the
≤
aquifers. In a similar effort, Lingireddy [13] integrated GA and neu- Taylor series expansion for small values of U(0 < U 1) and the
ral network to obtain aquifer hydraulic parameters. Samuel and Gauss–Laguerre quadrature for large values of U(U > 1) [35].
Jha [8] and Jha et al. [4] examined effectiveness of GA in esti- Unconfined aquifers have a different response to the pumping
mating aquifer parameters. They showed that GA is a viable and test compared to confined aquifers. Therefore, the Theis model
efficient technique that often overcomes the subjectivity, high com- should be corrected in order to be used for unconfined aquifers.
putational burden and ill-posedness of traditional optimization The corrected Theis model replaces s(r, t) on the left hand side of
2
−
methods. In a more recent attempt, Rajesh et al. [14] utilized GA, Eq. (2) with s (r, t), where s is equal to s (s /2D0), and D0 is the
graphical, and sequential unconstrained minimization approaches initial saturated thickness of the unconfined aquifer [36,37]. Theis
to retrieve unconfined aquifer hydraulic parameters. Their results and corrected Theis models are used in this study for confined and
revealed that GA outperforms the other two methods. unconfined case studies, respectively.
ACO has been successfully used in water resources optimiza-
tion problems such as minimizing the capital costs associated with 2.2. Hantush model
water distribution systems [15–18], design of irrigation networks
[19], optimal groundwater monitoring design [20], multi-purpose The leaky-aquifer theory has been evolved from the Theis equa-
reservoir operation [21,22], optimal design of open channels [23], tion. In two sets of papers, Hantush and Jacob [38] and later Hantush
underground seepage flow [24], and saltwater intrusion in the [39,40], the original differentiation between the Theis response for
coastal aquifers [25]. To the best knowledge of the authors, the confined aquifers and the one for leaky aquifers was discussed. The
only study on the estimation of aquifer parameters with ACO was analytical solution of Hantush and Jacob [38] can be couched in the
conducted by Li et al. [26], wherein the hydraulic conductivity and same form as the Theis solution (Eq. (1)) but with a more com-
storage coefficient of a confined aquifer were estimated in a syn- plicated well function. In analogy with Eq. (1), the drawdown is
thetic experimental framework. In comparison to their study, the computed via,
present study uses ACO to estimate the hydraulic parameters of Q r
s(r, t) = W U, (3)
three aquifer systems (confined, unconfined and leaky) from real- 4 T B
world time–drawdown pumping test data. Moreover, the results
where B is the leakage factor and W(U, r/B) is known as the leaky
of ACO are compared with those of graphical and NLP techniques.
well function, which is given by
Each method is applied to 15 sets of real time–drawdown pumping
∞
test data (5 sets of data for each aquifer type). These data sets are r 1 ˇ2
W U, = exp −y − dy (4) taken from [27–33]. B y y
U
This paper is organized as follows. In Section 2, the analytical
=
models of groundwater used in this study are reviewed. The graph- in which ˇ r/(2B).
ical, NLP, GA, and ACO methods are outlined in Section 3. Section 4
presents the formulation of the objective function. Section 5 pro- 3. Methods
vides the results and discussions. Finally, conclusions are reported
in Section 6. 3.1. Graphical method
As stated in the introduction, the first group of approaches for
2. Analytical models for analyzing pumping test data retrieving aquifer parameters is graphical. In order to determine
aquifer parameters such as transmissivity (T) and storage coeffi-
Pumping test is a well-known tool to characterize a system of cient (S), the pumping test is conducted and the drawdowns in
aquifers. The test is conducted by pumping water from one well and a pumped well and in several observation wells are recorded at
S.M. Bateni et al. / Applied Soft Computing 28 (2015) 541–549 543
suitable time intervals. The recorded time–drawdown data are ana-
lyzed by the standard graphical methods designed for confined,
unconfined and confined aquifers [27,29,31]. These graphical meth-
ods basically involve matching of Type curves (which vary from
the type of aquifers) with the corresponding field curves, find-
ing out a match point and then calculating aquifer parameters
using the Theis model (for confined and unconfined aquifers) or
Hantush and Jacob model (for leaky aquifers). In this study, the
time–drawdown pumping test data of confined, unconfined and
leaky aquifers were graphically analyzed using the commonly used
AquiferTest software developed by Waterloo Hydrogeologic Incor-
poration (WHI), Canada. It is a graphical oriented package, and
has a wide range of methods for analyzing pumping test data of a
variety of aquifers. For detailed information on the AquiferTest soft-
ware, the reader is referred to (http://www.swstechnology.com/
groundwater-software/pumping-test-analysis/aquifertest-pro).
3.2. Nonlinear programming (NLP)
As mentioned in the introduction, the second group of methods
for estimating aquifer parameters is based on nonlinear program-
ming techniques. In this study, the well-known GAMS (General
Algebraic Modeling System; [41]) software is employed to estimate
aquifer hydraulic parameters from pumping test data using its NLP
solvers. GAMS is a mathematical programming and optimization
modeling system that has been used widely in the water resources
and agricultural economics research communities [42–47].
GAMS has several built-in solvers for solving NLP problems,
and the program itself tries to use the best solver for each prob-
lem. One of the well-known NLP solvers in GAMS is CONOPT.
Our NLP problems in GAMS are solved using CONOPT. This solver
is mainly developed for models with smooth functions, but it
can also be used for models with a non-differentiable function.
CONOPT3, the most recent version of the solver, is a gradient
based algorithm that executes a sequential quadratic programming
(SQP) component. The SQP module utilizes the second derivative
to obtain better search directions [48]. The hydraulic parameters
in our case study problems are found via a GAMS optimization
code. Finally, the results are compared with those of the other two
methods.
3.3. Genetic Algorithm (GA)
Fig. 1. Flowchart of GA method.
The GA optimization method is based on Darwin’s theory of
evaluations. In nature, individuals which have highly adaptive
behaviors will have relatively a larger number of offspring and usually called parents, are selected based on their objective func-
consequently survive longer. GA is a robust optimization method tion values. Crossover involves a pair of chromosomes exchanging a
seeking to mathematically reproduce the mechanisms of natural portion of their bit sequence at randomly set cutting positions. The
selection [49,50]. idea behind crossover is that, by exchanging blocks of bits between
GA is a population based algorithm. A group of chromosomes two chromosomes that performed well, the GA attempts to pro-
form a population. Population size determines the number of chro- duce two new chromosomes that preserve best materials from two
mosomes in each population. In GA, parameters are presented in parents. There are a few crossover methods including one-point
form of chromosomes which, in turn, consist of genes. Traditionally, crossover, two-point crossover and uniform cross over [49]. The
GA has been developed by applying binary coding in which a chro- main difference between these methods is number of cutting pos-
mosome is represented by a string of binary bits, e.g., [00101001], itions. For instance, one-point crossover has one cutting position
that can be encoded into integer or real numbers. while two-point crossover has two cutting positions. Fig. 2 shows
A simple flowchart for GA is shown in Fig. 1. The first step in GA schematically the one-point cross over. Chromosome 1 and 2 are
is to initialize population randomly. Indeed, all chromosomes in selected as parents and then a cutting position is selected randomly
the first population are determined randomly. Then, for each chro- (Fig. 2). Finally, the genes on the right hand side of the position are
mosome, parameters are determined by decoding genes into real exchanged.
values. In the next step, chromosomes are evaluated by calculating Mutation permits introduction of new chromosomes into a
the value of objective function for each of them. population by randomly filliping a gene. A mutation probability
GA operators mimic natural processes. The main GA opera- determines frequency of random mutations to be made to indi-
tors are selection, crossover and mutation. Selection is the process vidual genes. Crossover and mutation operations do not allow
by which chromosomes are chosen for participation in the repro- GA to get trapped in local optima and search the decision space
ducing process. By applying selection operator, two chromosomes more vigorously and efficiently. As it is shown in Fig. 1, selection,
544 S.M. Bateni et al. / Applied Soft Computing 28 (2015) 541–549
Fig. 2. Schematic illustration of one point crossover.
evaluation, crossover and mutation repeat until a termination cri-
terion is met. Termination criterion is usually defined as reaching Fig. 3. Schematic of ant routes traveling between five discrete parameters.
the maximum number of generations or if there is no change in the
value of objective function after a specific number of generations.
Following Samuel and Jha [8] and Jha et al. [4], crossover and
objective function values receive less pheromone. The following
mutation probabilities of 0.8 and 0.015 are chosen. Population size
equation is used to update pheromone on segments
and number of generations are set to 80 and 100, respectively
[4,8]. The Genetic Algorithm is terminated when the maximum
number of generations (i.e., 100) is reached. The readers are − − ≤
exp(4.6((gu T)/(gmin T))) gu T
=
referred to Goldberg [49] and Michalewicz [50] for a full description u(I) (5)
0 gu > T
of GA.
3.4. Ant Colony Optimization (ACO) where u(I) represents the intensity of pheromone on the route u in
iteration I, gu is the corresponding objective function value of route
Ant Colony Optimization (ACO) is a recently developed heuristic u, gmin is the minimum value of the objective function obtained in
optimization method. It was inspired by the fact that some kinds of the current iteration and T is a critical value of the objective func-
ants are blind but they can find the minimum path between their tion, above which a route receives no pheromone. T is calculated as
nest and food. This occurs because of chemical substances called follows [53]:
pheromones that ants deposit when they travel on a route.
Based on the behavior of real ants, Dorigo et al. [51] devel- g
= +
T gmin CT (6)
oped the first Ant Colony Optimization method called Ant System g
(AS) to solve the traveling salesman problem (TSP) and job-shop
scheduling problem (JSP). The results showed that ACO dominated
where CT is a constant which is determined to be 0.5, while g and
all other classical or heuristic methods solutions [52]. Since then