# Modeling and Dynamical Analysis of the Water Resources Supply-Demand System: A Case Study in Haihe River Basin

Authors: Chongli Di; Xiaohua Yang
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

The relationship between water resources supply and demand is very complex and exhibits nonlinear characteristics, which leads to fewer models that can adequately manage the dynamic evolution process of the water resources supply-demand system. In this paper, we propose a new four-dimensional dynamical model to simulate the internal dynamic evolution process and predict future trends of water supply and demand. At the beginning, a new four-dimensional dynamical model with uncertain parameters is established. Then, the gray code hybrid accelerating genetic algorithm (GHAGA) is adopted to identify the unknown parameters of the system based on the statistic data (1998–2009). Finally, the dynamical analysis of the system is further studied by Lyapunov-exponent, phase portraits, and Lyapunov exponent theory. Numerical simulation results demonstrate that the proposed water resources supply-demand system is in a steady state and is suitable for simulating the dynamical characteristics of a complex water supply and demand system. According to the trends of the water supply and demand of several nonlinear simulation cases, the corresponding measures can be proposed to improve the steady development of the water resources supply-demand system.


---

## Body

## 1. Introduction

Water is indispensable to human survival, agriculture, and industry. Recently, there is an increasing shortage of water in most river basins mainly due to human activity and climate change [1, 2]. With the population growth, degradation of water quality, and loss of potential sources of freshwater, water demand is becoming increasing greater and water supply has been increasing scarce in many developing countries [3]. The internal dynamic evolution process and the relationship between water resources supply and demand are very complex and exhibiting nonlinear characteristics [4]. Water management is rapidly becoming more and more difficult due to the complex water resources system. Senge [5] discussed two types of complexity: (1) detail and (2) dynamic. Detail complexity is associated with systems with many components. Dynamic complexity, however, is in contact with effects that are separated by time or space. It is the dynamic complexity found in the water resources system that presents great difficulties for water management. Thus, how to analyse the internal dynamic evolved mechanism of the water resources supply-demand system and solve the issue of imbalanced water resources supply-demand has an important practical significance to the achievement of sustainable development and management of water resources.The problem of water resources supply and demand has attracted much attention and a considerable amount of researches. Rayan [6] studied the water supply and demand of Sinai, Egypt, and introduced desalination options. Some previous works applied artificial neural networks (ANNs) to predict and forecast water resource system [7–9]. George et al. [10] proposed a city water balance model to analyse alternative strategies to manage the supply of water in order to come to terms with the water scarcity problems facing policy makers in Hyderabad. Qi and Chang [4] used system dynamics model to estimate domestic water demand under uncertain economic impacts from 2003 to 2009 for Manatee Country. Based on the data for meteorology, hydrology, soil, planting, vegetation, and socioeconomic development of the irrigation region in the middle reaches of the Heihe River basin, Ji et al. [11] established the model of balance of water supply and demand and assessed the security of water resources development. A probabilistic forecast model of future water demand for the city of Mecca in Saudi Arabia was proposed in [12]. Liu et al. [13] adopted WDF-ANN model to forecast water demand in Weinan city. Yurdusev et al. [14] predicted monthly water consumption by using feed-forward and radial-basis neural networks. However, the nonlinear dynamic behavior of the water resources supply-demand system is seldom considered by these methods.Any very complicated dynamical system can be solved by a simple mathematical model [15]. The dynamical system method is one approach to nonlinear modeling. It has been applied increasingly in water environments and water resources system, such as hydrological time series prediction [16–18] and the dynamical analysis of runoff flows [19, 20]. In this paper, according to the current situation of the water resources supply and demand, we establish a new dynamical model to express the complex relationship between water resources supply and demand by using dynamical system theory. This model can be used to analyse the internal dynamic evolved mechanism of the water resources supply-demand system of a river basin or a city.The outline of this paper is organized as follows: Section2 introduces the study area and data. In Section 3, the water resources supply demand model is established and the method of parameter identification of the proposed model is introduced. Section 4 provides the results and discussions on the real water resources supply-demand system in Haihe River Basin. The conclusions of the paper are summarized in Section 5.


## 2. Study Area and Data

The HRB is the political, economic, and cultural center of China. However, water resources shortage in the HRB has become a serious problem in recent years due to the rapid economic development and climate change [21]. The location of the HRB is shown in Figure 1. The basin covers an area of 318200 km2, with 60% being mountains in the western and northern part and 40% being plains in the eastern and southern parts. It belongs to continental monsoon climate zone and locates in a semihumid and semiarid region. The average annual precipitation is 524.69 mm, and the total amount of water resources is 374.39
×
1
0
8m3 (1956–2008), the water volume per capita is 272 m3, merely 1/7 of the national average and 1/24 of the world average [22].Figure 1
The location of the Haihe River Basin.The water resources demand and supply data from 1998 to 2009 are obtained from the water resources bulletin of HRB. Table1 is the water resources statistic data (1998–2009) of HRB, where X is water demand, Y is surface water supply, Z is groundwater supply, and W is other kinds of water supply.Table 1
Water resources statistic data in Haihe River Basin (Unit: billion m3).
Year
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
X
424.00
431.50
400.60
392.00
399.83
377.05
368.01
380.46
392.85
384.52
373.39
370.02
Y
160.70
162.68
136.60
122.70
127.94
113.64
118.23
123.35
134.15
128.64
123.10
125.50
Z
261.90
267.50
262.79
267.74
270.29
261.38
246.97
252.94
251.85
250.01
240.60
235.88
W
1.40
1.29
1.21
1.56
1.60
2.03
2.83
4.17
6.85
5.83
9.69
8.64


## 3. Modeling and Methods

### 3.1. Establishment of the Water Resources Supply-Demand Model

LetX
(
t
) be the demand for water resources, Y
(
t
) the surface water supply (including diversion water supply), Z
(
t
) the groundwater supply, and W
(
t
) other kinds of water supply (mainly including wastewater reuse, direct seawater utilization, and collection of rainwater). The model for the water resource system is established as follows:
(1)
d
X
d
t
=
a
1
X
(
1
-
X
M
)
-
a
2
Y
-
a
3
Z
-
a
4
W
,
d
Y
d
t
=
-
b
1
Y
-
b
2
Z
+
b
3
X
[
N
-
(
X
-
Z
-
W
)
]
,
d
Z
d
t
=
c
1
X
-
c
2
Y
-
c
3
Z
-
c
4
W
,
d
W
d
t
=
d
1
W
(
X
-
d
2
)
-
d
3
Y
,
where a
i
,
b
i
,
c
i
,
d
i
,
M
,
N
,
K are constants, and M
>
0, N
>
0.Additionally,a
1 is the elastic coefficient of the water resources demand; a
2, a
3, and a
4 are, respectively, the influence coefficients of the surface water supply, the groundwater supply, and other kinds of water supply on the water resources demand; b
1 is the influence coefficient of the surface water supply on the change rate of the surface water supply; b
2 is the influence coefficient of the groundwater supply on the surface water supply; b
3 is the influence coefficient of water resources demand on the surface water supply; c
1
,
c
2
,
c
3, and c
4 are, respectively, the influence coefficients of the water resources demand, the surface water supply, the groundwater supply, and other kinds of water supply on the groundwater supply; d
1 is the velocity constant of the recycled water supply; d
2 is the cost of recycled water supply; d
3 is the influence coefficient of the surface water supply on the other kinds of water supply; M is the maximum value of water resources demand; N is the valve value of diversion water supply.In system (1), a
1
X
(
1
-
(
X
/
M
)
) denotes that the rate of water resources demand d
X
/
d
t is in direct ratio to water resources demand when the current water resources demand of the study area is less than M, and d
X
/
d
t is inversely proportional to water resources demand when the water resources demand of the study area is larger than M; -
a
2
Y, -
a
3
Z, and -
a
4
W denote that the increase in surface water supply, groundwater supply, and other kinds of water supply will reduce the demand of the water resources, respectively; -
b
1
Y
-
b
2
Z denotes that the rate of surface water supply will decrease with the surface water supply and groundwater supply; b
3
X
[
N
-
(
X
-
Z
-
W
)
] denotes that when the diversion water supply is less than the threshold value (i.e., X
(
t
)
-
Z
(
t
)
-
W
(
t
)
<
N), the rate of diversion water supply will increase with the increase of X
(
t
), and when diversion water supply is large enough (or X
(
t
)
-
Z
(
t
)
-
W
(
t
)
>
N), with economic development, the people and enterprises around the Yellow River and Yangtze River Basin will need a lot of water, which results in the rate of diversion water supply decreasing with the increase rate of X
(
t
); c
1
X denotes that the increase in water resources demand will increase the groundwater supply; -
c
2
Y
-
c
3
Z
-
c
4
W denotes that the decrease in surface water supply, the groundwater supply, and other kinds of water supply will decrease the rate of groundwater supply; d
1
W
(
X
-
d
2
) denotes that the rate of reused water is in direct ratio to the amount of recycled water, which increases with the increase of water resources demand and decrease with the increase of the cost for reused water.System (1) is an uncertainty system with unknown parameters, and it has different characteristics with different parameters. When a set of parameters are set as follows: a
1
=
0.06, a
2
=
0.2, a
3
=
0.09, a
4
=
0.15, b
1
=
0.22, b
2
=
0.2, b
3
=
0.2, c
1
=
0.13, c
2
=
0.14, c
3
=
0.12, c
4
=
0.2, d
1
=
0.16, d
2
=
0.2, d
3
=
0.001, M
=
1.1, and N
=
0.6, and the initial condition is set as [
0.6,0.3,0.2,0.1
], the Lyapunov exponents of the system (1) are L
1
=
-
0.0156, L
2
=
-
0.0371, L
3
=
-
0.0853, and L
4
=
-
0.1801. Because these Lyapunov exponents are all less than 0, the orbit of the system (1) is a limit cycle as shown in Figure 2. When a
1
=
0.06, a
2
=
0.08, a
3
=
0.3, a
4
=
0.2, b
1
=
0.05, b
2
=
0.04, b
3
=
0.04, c
1
=
0.1, c
2
=
0.2, c
3
=
0.05, c
4
=
0.04, d
1
=
0.2, d
2
=
0.3, d
3
=
0.001, M
=
1.1, and N
=
0.5, and the initial conditions are set as [
0.7,0.2,0.1,0.1
], the Lyapunov exponents of the system (1) are L
1
=
-
0.0020, L
2
=
-
0.0134, L
3
=
-
0.0169, and L
4
=
-
0.0592. The system has a stable focus point and its orbit is shown in Figure 3. When a
1
=
0.08, a
2
=
0.13, a
3
=
0.06, a
4
=
0.08, b
1
=
0.15, b
2
=
0.15, b
3
=
0.14, c
1
=
0.13, c
2
=
0.15, c
3
=
0.19, c
4
=
0.18, d
1
=
0.16, d
2
=
0.12, d
3
=
0.002, M
=
2.5, and
N
=
0.8, and initial condition is set as [
0.8,0.1,0.3,0.2
], the Lyapunov exponents of the system (1) are L
1
=
0.0421, L
2
=
-
0.0104, L
3
=
-
0.1144, and L
4
=
-
0.2631. Since there are two Lyapunov exponents that are larger than zero, therefore, the system is hyperchaotic in this situation. System (1) has a chaotic attractor as shown in Figure 4.A limit cycle of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Y-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)A stable focus point of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Z-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)A chaotic attractor of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Y-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)


### 3.2.  Parameter Identification

To illustrate the behavior of water resources supply-demand system in a specified area, the unknown parameters should be identified first. Parameter identification can be seen as a global optimization problem. Many methods for the global optimization problem have been proposed, which can be roughly divided into two categories: deterministic optimization methods and stochastic optimization methods. The deterministic approaches take advantage of the analytical properties of the problem to generate a sequence of points that converge to a global optimal solution and sometimes can give a guaranteed solution [23, 24]. However, the deterministic optimization may be trapped in the local extreme point when the dimension is high and there are numerous local optima. Sometimes, traditional deterministic methods cannot obtain the global optimization efficiently due to its complex computation and strict application conditions [25]. Additionally, other research results suggest that the deterministic global algorithms have lower efficiency for the optimization problems with a large number of parameters [26]. Therefore, the traditional deterministic global algorithms are not considered to solve our problem which not only contains many parameters, but also shows high nonlinearity and complex dynamic characteristics.Genetic algorithm (GA) is a type of stochastic optimization method based on the mechanics of natural selection and natural genetics. It can provide a robust procedure not only to explore broad and promising regions of solutions, but also to avoid being trapped in the local optimization [27]. Many researchers have applied the GA techniques to identify linear and nonlinear systems. Based on many improved genetic algorithms, Yang et al. [28] proposed a gray-encoded hybrid accelerating genetic algorithm (GHAGA) with Nelder-Mead simplex searching operator and simplex algorithm for the global optimization of dynamical systems. The GHAGA method is an improved genetic algorithm. Compared with traditional genetic algorithm and pure random search algorithm, the GHAGA method has the advantage of higher calculation precision and efficiency, rapider convergent speed, and wider scope of application. It has been proved as an effective method to be used in various complex water environment optimization problems [28, 29]. Therefore, the GHAGA method is chosen to identify the parameters of the water resources supply-demand system (1).


#### 3.2.1. Discretization

Before determining the parameters, system (1) needs to be discretized. Using the discrete transform, the water resources system (1) is discretized into system (2):
(2)
X
(
k
+
1
)
=
X
(
k
)
+
t
[
a
1
X
(
k
)
(
1
-
X
(
k
)
M
)
-
a
2
Y
(
k
)
vvvvvvvvvvvvvv
-
a
3
Z
(
k
)
-
a
4
W
(
k
)
(
1
-
X
(
k
)
M
)
]
,
Y
(
k
+
1
)
=
Y
(
k
)
+
t
[
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
-
b
1
Y
(
k
)
-
b
2
Z
(
k
)
vvvvvvvvvvvvvv
+
b
3
X
(
k
)
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
]
,
Z
(
k
+
1
)
=
Z
(
k
)
+
t
[
c
1
X
(
k
)
-
c
2
Y
(
k
)
-
c
3
Z
(
k
)
-
c
4
W
(
k
)
]
,
W
(
k
+
1
)
=
W
(
k
)
+
t
[
d
1
W
(
k
)
(
X
(
k
)
-
d
2
)
-
d
3
Y
(
k
)
]
.


#### 3.2.2. The Algorithm of GHAGA

The GHAGA with Nelder-Mead simplex searching operator and simplex algorithm is used for the parameter identification. A flowchart for the identification of the system parameters by GHAGA is given in Figure5, and the detailed steps of the algorithm are given in the following.Figure 5
The flowchart for the identification of the system parameters by GHAGA.Consider the parameter optimization of the water resources model as(3)
min
⁡
f
(
x
1
,
x
2
,
…
,
x
n
)
s
.
t
.
a
i
≤
x
i
≤
b
i
,
for
i
=
1,2
,
…
,
n
,
where x
=
{
x
i
,
i
=
1,2
,
…
,
n
}, x
i is a parameter to be optimized, f is an objective function, and f
≥
0, for system (1), n
=
16.Step 1 (gray encoding).
Suppose gray encoding length ise in every parameter, the ith parameter range is the interval [
a
i
,
b
i
], and then each interval is divided into 2
e
-
1 subintervals:
(4)
x
i
=
a
i
+
I
i
·
c
i
,
where the length of subinterval of the ith parameter c
i
=
(
b
i
-
a
i
)
/
(
2
e
-
1
) is constant. The searching location I
i is a nonnegative integer, and 0
≤
I
i
<
2
e for i
=
1,2
,
…
,
n. The gray code array of the ith parameter is denoted by the grid points of {
d
(
i
,
k
)
∣
k
=
1,2
,
…
,
e
} for every individual:
(5)
I
i
=
∑
j
=
1
e
‍
(
⨁
k
=
j
e
d
(
i
,
k
)
)
·
2
j
-
1
,
where ⨁ denotes the operator of addition modulo 2 on {
0,1
} [29]. The GHAGA uses a code of parameters instead of the parameters and works on a population of points and not on one single point.Step 2 (randomly generating the initial population).
Initially, the chromosomes are generated at random in gray-encoded genetic algorithm, and p-chromosomes in father population are(6)
I
i
(
j
)
=
int
⁡
(
u
(
i
,
j
)
·
2
e
)
,
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
p
,
where u
(
i
,
j
) is uniform random numbers, u
(
i
,
j
)
∈
[
0,1
], I
i
(
j
) is a searching location, and int
⁡
(
·
) is an integer function. From (3), the p-corresponding chromosomes are d
(
i
,
k
,
j
), for i
=
1,2
,
…
,
n; k
=
1,2
,
…
,
e; j
=
1,2
,
…
,
p. To cover homogeneously the whole solution space and to avoid the risk of having too much individuals in the same region, a large uniformity random population is selected in this algorithm.Step 3 (decoding and fitness evaluation).
Decoding ofd
(
i
,
k
,
j
) for (i
=
1,2
,
…
,
n
;
k
=
1,2
,
…
,
e
;
j
=
1,2
,
…
,
p) works through (4) and (5) and then corresponding parameter x
i
(
j
) is obtained. Substitution of x
i
(
j
) into (1) produces the objective function f
(
j
). The smaller the value f
(
j
) is, the higher the fitness of its corresponding ith chromosome will be. Then, the fitness function of ith chromosome is defined:
(7)
F
(
j
)
=
1
[
f
(
j
)
]
2
+
0.1
.Step 4 (selection).
The chromosomes in the initial father population are selected by a known probabilityP
s
(
j
)
:
P
s
(
j
)
=
F
(
j
)
/
∑
i
=
1
n
‍
F
(
i
). Such two groups of p-chromosomes are selected by the above probabilities.Step 5 (two-point crossover).
Perform crossover on each chromosome pair according to probabilityP
c to generate two offsprings. For two-point crossover, two crossing points I
1
=
int
⁡
(
U
1
·
(
e
+
1
)
) and I
2
=
int
⁡
(
U
2
·
(
e
+
1
)
) are randomly chosen, where U
1
,
U
2 are uniformity random numbers, where {
U
1
,
U
2
}
∈
[
0,1
]. The two-point crossover between two individuals is performed through the crossing probability P
c:
(8)
d
1
′
(
i
,
k
,
j
)
=
{
d
2
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
1
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
;
(9)
d
2
′
(
i
,
k
,
j
)
=
{
d
1
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
2
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
.
In order to enhance the diversity of population, the crossing probability is set as P
c
≥
0.5.Step 6 (two-point mutation).
The operator of two-point mutation is for four random numbers{
V
1
,
V
2
,
V
3
,
V
4
}
∈
[
0,1
]. If V
1
≤
0.5, the offspring is computed by (8). Otherwise, the offspring d
′
(
i
,
k
,
j
) is computed by (9). Let the mutating probability be p
m
∈
[
0,1
], the two points be J
1
=
int
⁡
(
V
2
·
(
e
+
1
)
), J
2
=
int
⁡
(
V
3
·
(
e
+
1
)
), and then the above offspring is mutated from
(10)
{
d
3
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
=
{
0
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
0
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
{
d
′

(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
otherwise
,
where a new offspring d
3
(
i
,
k
,
j
) can be computed by a mutating probability p
m.Step 7 (simplex evolution and alternating).
The Nelder-Mead algorithm is a useful, local descent algorithm, which does not make use of the objective function derivatives [30]. The best point in the previous phase becomes a new initial solution in the Nelder-Mead simplex algorithm, and then a new best point is obtained by this Nelder-Mead simplex algorithm. The new best point inside the offspring will be inserted to replace the worst one in the previous phase. Repeat Step 3 to Step 7 until the evolution times Q is met.Step 8 (accelerating cycle).
The parameter ranges ofn
s-excellent individuals obtained by Q-times of the Nelder-Mead simplex evolution alternating become the new ranges of the parameters and then the whole process back to the Gray-encoding. The GHAGA computation is over until the algorithm running times get to the design T times or there exists a chromosome c
fit whose fitness satisfies a given criterion. In the former case the c
fit is the fittest chromosome or the most excellent chromosome in the population. The chromosome c
fit represents the solution.


## 3.1. Establishment of the Water Resources Supply-Demand Model

LetX
(
t
) be the demand for water resources, Y
(
t
) the surface water supply (including diversion water supply), Z
(
t
) the groundwater supply, and W
(
t
) other kinds of water supply (mainly including wastewater reuse, direct seawater utilization, and collection of rainwater). The model for the water resource system is established as follows:
(1)
d
X
d
t
=
a
1
X
(
1
-
X
M
)
-
a
2
Y
-
a
3
Z
-
a
4
W
,
d
Y
d
t
=
-
b
1
Y
-
b
2
Z
+
b
3
X
[
N
-
(
X
-
Z
-
W
)
]
,
d
Z
d
t
=
c
1
X
-
c
2
Y
-
c
3
Z
-
c
4
W
,
d
W
d
t
=
d
1
W
(
X
-
d
2
)
-
d
3
Y
,
where a
i
,
b
i
,
c
i
,
d
i
,
M
,
N
,
K are constants, and M
>
0, N
>
0.Additionally,a
1 is the elastic coefficient of the water resources demand; a
2, a
3, and a
4 are, respectively, the influence coefficients of the surface water supply, the groundwater supply, and other kinds of water supply on the water resources demand; b
1 is the influence coefficient of the surface water supply on the change rate of the surface water supply; b
2 is the influence coefficient of the groundwater supply on the surface water supply; b
3 is the influence coefficient of water resources demand on the surface water supply; c
1
,
c
2
,
c
3, and c
4 are, respectively, the influence coefficients of the water resources demand, the surface water supply, the groundwater supply, and other kinds of water supply on the groundwater supply; d
1 is the velocity constant of the recycled water supply; d
2 is the cost of recycled water supply; d
3 is the influence coefficient of the surface water supply on the other kinds of water supply; M is the maximum value of water resources demand; N is the valve value of diversion water supply.In system (1), a
1
X
(
1
-
(
X
/
M
)
) denotes that the rate of water resources demand d
X
/
d
t is in direct ratio to water resources demand when the current water resources demand of the study area is less than M, and d
X
/
d
t is inversely proportional to water resources demand when the water resources demand of the study area is larger than M; -
a
2
Y, -
a
3
Z, and -
a
4
W denote that the increase in surface water supply, groundwater supply, and other kinds of water supply will reduce the demand of the water resources, respectively; -
b
1
Y
-
b
2
Z denotes that the rate of surface water supply will decrease with the surface water supply and groundwater supply; b
3
X
[
N
-
(
X
-
Z
-
W
)
] denotes that when the diversion water supply is less than the threshold value (i.e., X
(
t
)
-
Z
(
t
)
-
W
(
t
)
<
N), the rate of diversion water supply will increase with the increase of X
(
t
), and when diversion water supply is large enough (or X
(
t
)
-
Z
(
t
)
-
W
(
t
)
>
N), with economic development, the people and enterprises around the Yellow River and Yangtze River Basin will need a lot of water, which results in the rate of diversion water supply decreasing with the increase rate of X
(
t
); c
1
X denotes that the increase in water resources demand will increase the groundwater supply; -
c
2
Y
-
c
3
Z
-
c
4
W denotes that the decrease in surface water supply, the groundwater supply, and other kinds of water supply will decrease the rate of groundwater supply; d
1
W
(
X
-
d
2
) denotes that the rate of reused water is in direct ratio to the amount of recycled water, which increases with the increase of water resources demand and decrease with the increase of the cost for reused water.System (1) is an uncertainty system with unknown parameters, and it has different characteristics with different parameters. When a set of parameters are set as follows: a
1
=
0.06, a
2
=
0.2, a
3
=
0.09, a
4
=
0.15, b
1
=
0.22, b
2
=
0.2, b
3
=
0.2, c
1
=
0.13, c
2
=
0.14, c
3
=
0.12, c
4
=
0.2, d
1
=
0.16, d
2
=
0.2, d
3
=
0.001, M
=
1.1, and N
=
0.6, and the initial condition is set as [
0.6,0.3,0.2,0.1
], the Lyapunov exponents of the system (1) are L
1
=
-
0.0156, L
2
=
-
0.0371, L
3
=
-
0.0853, and L
4
=
-
0.1801. Because these Lyapunov exponents are all less than 0, the orbit of the system (1) is a limit cycle as shown in Figure 2. When a
1
=
0.06, a
2
=
0.08, a
3
=
0.3, a
4
=
0.2, b
1
=
0.05, b
2
=
0.04, b
3
=
0.04, c
1
=
0.1, c
2
=
0.2, c
3
=
0.05, c
4
=
0.04, d
1
=
0.2, d
2
=
0.3, d
3
=
0.001, M
=
1.1, and N
=
0.5, and the initial conditions are set as [
0.7,0.2,0.1,0.1
], the Lyapunov exponents of the system (1) are L
1
=
-
0.0020, L
2
=
-
0.0134, L
3
=
-
0.0169, and L
4
=
-
0.0592. The system has a stable focus point and its orbit is shown in Figure 3. When a
1
=
0.08, a
2
=
0.13, a
3
=
0.06, a
4
=
0.08, b
1
=
0.15, b
2
=
0.15, b
3
=
0.14, c
1
=
0.13, c
2
=
0.15, c
3
=
0.19, c
4
=
0.18, d
1
=
0.16, d
2
=
0.12, d
3
=
0.002, M
=
2.5, and
N
=
0.8, and initial condition is set as [
0.8,0.1,0.3,0.2
], the Lyapunov exponents of the system (1) are L
1
=
0.0421, L
2
=
-
0.0104, L
3
=
-
0.1144, and L
4
=
-
0.2631. Since there are two Lyapunov exponents that are larger than zero, therefore, the system is hyperchaotic in this situation. System (1) has a chaotic attractor as shown in Figure 4.A limit cycle of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Y-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)A stable focus point of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Z-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)A chaotic attractor of system (1): (a) a 3D view (X-Y-Z), (b) a 3D view (X-Y-W), and (c) the time series of X
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)


## 3.2.  Parameter Identification

To illustrate the behavior of water resources supply-demand system in a specified area, the unknown parameters should be identified first. Parameter identification can be seen as a global optimization problem. Many methods for the global optimization problem have been proposed, which can be roughly divided into two categories: deterministic optimization methods and stochastic optimization methods. The deterministic approaches take advantage of the analytical properties of the problem to generate a sequence of points that converge to a global optimal solution and sometimes can give a guaranteed solution [23, 24]. However, the deterministic optimization may be trapped in the local extreme point when the dimension is high and there are numerous local optima. Sometimes, traditional deterministic methods cannot obtain the global optimization efficiently due to its complex computation and strict application conditions [25]. Additionally, other research results suggest that the deterministic global algorithms have lower efficiency for the optimization problems with a large number of parameters [26]. Therefore, the traditional deterministic global algorithms are not considered to solve our problem which not only contains many parameters, but also shows high nonlinearity and complex dynamic characteristics.Genetic algorithm (GA) is a type of stochastic optimization method based on the mechanics of natural selection and natural genetics. It can provide a robust procedure not only to explore broad and promising regions of solutions, but also to avoid being trapped in the local optimization [27]. Many researchers have applied the GA techniques to identify linear and nonlinear systems. Based on many improved genetic algorithms, Yang et al. [28] proposed a gray-encoded hybrid accelerating genetic algorithm (GHAGA) with Nelder-Mead simplex searching operator and simplex algorithm for the global optimization of dynamical systems. The GHAGA method is an improved genetic algorithm. Compared with traditional genetic algorithm and pure random search algorithm, the GHAGA method has the advantage of higher calculation precision and efficiency, rapider convergent speed, and wider scope of application. It has been proved as an effective method to be used in various complex water environment optimization problems [28, 29]. Therefore, the GHAGA method is chosen to identify the parameters of the water resources supply-demand system (1).


### 3.2.1. Discretization

Before determining the parameters, system (1) needs to be discretized. Using the discrete transform, the water resources system (1) is discretized into system (2):
(2)
X
(
k
+
1
)
=
X
(
k
)
+
t
[
a
1
X
(
k
)
(
1
-
X
(
k
)
M
)
-
a
2
Y
(
k
)
vvvvvvvvvvvvvv
-
a
3
Z
(
k
)
-
a
4
W
(
k
)
(
1
-
X
(
k
)
M
)
]
,
Y
(
k
+
1
)
=
Y
(
k
)
+
t
[
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
-
b
1
Y
(
k
)
-
b
2
Z
(
k
)
vvvvvvvvvvvvvv
+
b
3
X
(
k
)
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
]
,
Z
(
k
+
1
)
=
Z
(
k
)
+
t
[
c
1
X
(
k
)
-
c
2
Y
(
k
)
-
c
3
Z
(
k
)
-
c
4
W
(
k
)
]
,
W
(
k
+
1
)
=
W
(
k
)
+
t
[
d
1
W
(
k
)
(
X
(
k
)
-
d
2
)
-
d
3
Y
(
k
)
]
.


### 3.2.2. The Algorithm of GHAGA

The GHAGA with Nelder-Mead simplex searching operator and simplex algorithm is used for the parameter identification. A flowchart for the identification of the system parameters by GHAGA is given in Figure5, and the detailed steps of the algorithm are given in the following.Figure 5
The flowchart for the identification of the system parameters by GHAGA.Consider the parameter optimization of the water resources model as(3)
min
⁡
f
(
x
1
,
x
2
,
…
,
x
n
)
s
.
t
.
a
i
≤
x
i
≤
b
i
,
for
i
=
1,2
,
…
,
n
,
where x
=
{
x
i
,
i
=
1,2
,
…
,
n
}, x
i is a parameter to be optimized, f is an objective function, and f
≥
0, for system (1), n
=
16.Step 1 (gray encoding).
Suppose gray encoding length ise in every parameter, the ith parameter range is the interval [
a
i
,
b
i
], and then each interval is divided into 2
e
-
1 subintervals:
(4)
x
i
=
a
i
+
I
i
·
c
i
,
where the length of subinterval of the ith parameter c
i
=
(
b
i
-
a
i
)
/
(
2
e
-
1
) is constant. The searching location I
i is a nonnegative integer, and 0
≤
I
i
<
2
e for i
=
1,2
,
…
,
n. The gray code array of the ith parameter is denoted by the grid points of {
d
(
i
,
k
)
∣
k
=
1,2
,
…
,
e
} for every individual:
(5)
I
i
=
∑
j
=
1
e
‍
(
⨁
k
=
j
e
d
(
i
,
k
)
)
·
2
j
-
1
,
where ⨁ denotes the operator of addition modulo 2 on {
0,1
} [29]. The GHAGA uses a code of parameters instead of the parameters and works on a population of points and not on one single point.Step 2 (randomly generating the initial population).
Initially, the chromosomes are generated at random in gray-encoded genetic algorithm, and p-chromosomes in father population are(6)
I
i
(
j
)
=
int
⁡
(
u
(
i
,
j
)
·
2
e
)
,
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
p
,
where u
(
i
,
j
) is uniform random numbers, u
(
i
,
j
)
∈
[
0,1
], I
i
(
j
) is a searching location, and int
⁡
(
·
) is an integer function. From (3), the p-corresponding chromosomes are d
(
i
,
k
,
j
), for i
=
1,2
,
…
,
n; k
=
1,2
,
…
,
e; j
=
1,2
,
…
,
p. To cover homogeneously the whole solution space and to avoid the risk of having too much individuals in the same region, a large uniformity random population is selected in this algorithm.Step 3 (decoding and fitness evaluation).
Decoding ofd
(
i
,
k
,
j
) for (i
=
1,2
,
…
,
n
;
k
=
1,2
,
…
,
e
;
j
=
1,2
,
…
,
p) works through (4) and (5) and then corresponding parameter x
i
(
j
) is obtained. Substitution of x
i
(
j
) into (1) produces the objective function f
(
j
). The smaller the value f
(
j
) is, the higher the fitness of its corresponding ith chromosome will be. Then, the fitness function of ith chromosome is defined:
(7)
F
(
j
)
=
1
[
f
(
j
)
]
2
+
0.1
.Step 4 (selection).
The chromosomes in the initial father population are selected by a known probabilityP
s
(
j
)
:
P
s
(
j
)
=
F
(
j
)
/
∑
i
=
1
n
‍
F
(
i
). Such two groups of p-chromosomes are selected by the above probabilities.Step 5 (two-point crossover).
Perform crossover on each chromosome pair according to probabilityP
c to generate two offsprings. For two-point crossover, two crossing points I
1
=
int
⁡
(
U
1
·
(
e
+
1
)
) and I
2
=
int
⁡
(
U
2
·
(
e
+
1
)
) are randomly chosen, where U
1
,
U
2 are uniformity random numbers, where {
U
1
,
U
2
}
∈
[
0,1
]. The two-point crossover between two individuals is performed through the crossing probability P
c:
(8)
d
1
′
(
i
,
k
,
j
)
=
{
d
2
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
1
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
;
(9)
d
2
′
(
i
,
k
,
j
)
=
{
d
1
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
2
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
.
In order to enhance the diversity of population, the crossing probability is set as P
c
≥
0.5.Step 6 (two-point mutation).
The operator of two-point mutation is for four random numbers{
V
1
,
V
2
,
V
3
,
V
4
}
∈
[
0,1
]. If V
1
≤
0.5, the offspring is computed by (8). Otherwise, the offspring d
′
(
i
,
k
,
j
) is computed by (9). Let the mutating probability be p
m
∈
[
0,1
], the two points be J
1
=
int
⁡
(
V
2
·
(
e
+
1
)
), J
2
=
int
⁡
(
V
3
·
(
e
+
1
)
), and then the above offspring is mutated from
(10)
{
d
3
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
=
{
0
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
0
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
{
d
′

(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
otherwise
,
where a new offspring d
3
(
i
,
k
,
j
) can be computed by a mutating probability p
m.Step 7 (simplex evolution and alternating).
The Nelder-Mead algorithm is a useful, local descent algorithm, which does not make use of the objective function derivatives [30]. The best point in the previous phase becomes a new initial solution in the Nelder-Mead simplex algorithm, and then a new best point is obtained by this Nelder-Mead simplex algorithm. The new best point inside the offspring will be inserted to replace the worst one in the previous phase. Repeat Step 3 to Step 7 until the evolution times Q is met.Step 8 (accelerating cycle).
The parameter ranges ofn
s-excellent individuals obtained by Q-times of the Nelder-Mead simplex evolution alternating become the new ranges of the parameters and then the whole process back to the Gray-encoding. The GHAGA computation is over until the algorithm running times get to the design T times or there exists a chromosome c
fit whose fitness satisfies a given criterion. In the former case the c
fit is the fittest chromosome or the most excellent chromosome in the population. The chromosome c
fit represents the solution.


## 3.2.1. Discretization

Before determining the parameters, system (1) needs to be discretized. Using the discrete transform, the water resources system (1) is discretized into system (2):
(2)
X
(
k
+
1
)
=
X
(
k
)
+
t
[
a
1
X
(
k
)
(
1
-
X
(
k
)
M
)
-
a
2
Y
(
k
)
vvvvvvvvvvvvvv
-
a
3
Z
(
k
)
-
a
4
W
(
k
)
(
1
-
X
(
k
)
M
)
]
,
Y
(
k
+
1
)
=
Y
(
k
)
+
t
[
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
-
b
1
Y
(
k
)
-
b
2
Z
(
k
)
vvvvvvvvvvvvvv
+
b
3
X
(
k
)
[
N
-
(
X
(
k
)
-
Z
(
k
)
-
W
(
k
)
)
]
]
,
Z
(
k
+
1
)
=
Z
(
k
)
+
t
[
c
1
X
(
k
)
-
c
2
Y
(
k
)
-
c
3
Z
(
k
)
-
c
4
W
(
k
)
]
,
W
(
k
+
1
)
=
W
(
k
)
+
t
[
d
1
W
(
k
)
(
X
(
k
)
-
d
2
)
-
d
3
Y
(
k
)
]
.


## 3.2.2. The Algorithm of GHAGA

The GHAGA with Nelder-Mead simplex searching operator and simplex algorithm is used for the parameter identification. A flowchart for the identification of the system parameters by GHAGA is given in Figure5, and the detailed steps of the algorithm are given in the following.Figure 5
The flowchart for the identification of the system parameters by GHAGA.Consider the parameter optimization of the water resources model as(3)
min
⁡
f
(
x
1
,
x
2
,
…
,
x
n
)
s
.
t
.
a
i
≤
x
i
≤
b
i
,
for
i
=
1,2
,
…
,
n
,
where x
=
{
x
i
,
i
=
1,2
,
…
,
n
}, x
i is a parameter to be optimized, f is an objective function, and f
≥
0, for system (1), n
=
16.Step 1 (gray encoding).
Suppose gray encoding length ise in every parameter, the ith parameter range is the interval [
a
i
,
b
i
], and then each interval is divided into 2
e
-
1 subintervals:
(4)
x
i
=
a
i
+
I
i
·
c
i
,
where the length of subinterval of the ith parameter c
i
=
(
b
i
-
a
i
)
/
(
2
e
-
1
) is constant. The searching location I
i is a nonnegative integer, and 0
≤
I
i
<
2
e for i
=
1,2
,
…
,
n. The gray code array of the ith parameter is denoted by the grid points of {
d
(
i
,
k
)
∣
k
=
1,2
,
…
,
e
} for every individual:
(5)
I
i
=
∑
j
=
1
e
‍
(
⨁
k
=
j
e
d
(
i
,
k
)
)
·
2
j
-
1
,
where ⨁ denotes the operator of addition modulo 2 on {
0,1
} [29]. The GHAGA uses a code of parameters instead of the parameters and works on a population of points and not on one single point.Step 2 (randomly generating the initial population).
Initially, the chromosomes are generated at random in gray-encoded genetic algorithm, and p-chromosomes in father population are(6)
I
i
(
j
)
=
int
⁡
(
u
(
i
,
j
)
·
2
e
)
,
i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
p
,
where u
(
i
,
j
) is uniform random numbers, u
(
i
,
j
)
∈
[
0,1
], I
i
(
j
) is a searching location, and int
⁡
(
·
) is an integer function. From (3), the p-corresponding chromosomes are d
(
i
,
k
,
j
), for i
=
1,2
,
…
,
n; k
=
1,2
,
…
,
e; j
=
1,2
,
…
,
p. To cover homogeneously the whole solution space and to avoid the risk of having too much individuals in the same region, a large uniformity random population is selected in this algorithm.Step 3 (decoding and fitness evaluation).
Decoding ofd
(
i
,
k
,
j
) for (i
=
1,2
,
…
,
n
;
k
=
1,2
,
…
,
e
;
j
=
1,2
,
…
,
p) works through (4) and (5) and then corresponding parameter x
i
(
j
) is obtained. Substitution of x
i
(
j
) into (1) produces the objective function f
(
j
). The smaller the value f
(
j
) is, the higher the fitness of its corresponding ith chromosome will be. Then, the fitness function of ith chromosome is defined:
(7)
F
(
j
)
=
1
[
f
(
j
)
]
2
+
0.1
.Step 4 (selection).
The chromosomes in the initial father population are selected by a known probabilityP
s
(
j
)
:
P
s
(
j
)
=
F
(
j
)
/
∑
i
=
1
n
‍
F
(
i
). Such two groups of p-chromosomes are selected by the above probabilities.Step 5 (two-point crossover).
Perform crossover on each chromosome pair according to probabilityP
c to generate two offsprings. For two-point crossover, two crossing points I
1
=
int
⁡
(
U
1
·
(
e
+
1
)
) and I
2
=
int
⁡
(
U
2
·
(
e
+
1
)
) are randomly chosen, where U
1
,
U
2 are uniformity random numbers, where {
U
1
,
U
2
}
∈
[
0,1
]. The two-point crossover between two individuals is performed through the crossing probability P
c:
(8)
d
1
′
(
i
,
k
,
j
)
=
{
d
2
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
1
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
;
(9)
d
2
′
(
i
,
k
,
j
)
=
{
d
1
(
i
,
k
,
j
)
,
k
∈
[
I
1
,
I
2
]
,
d
2
(
i
,
k
,
j
)
,
k
∉
[
I
1
,
I
2
]
.
In order to enhance the diversity of population, the crossing probability is set as P
c
≥
0.5.Step 6 (two-point mutation).
The operator of two-point mutation is for four random numbers{
V
1
,
V
2
,
V
3
,
V
4
}
∈
[
0,1
]. If V
1
≤
0.5, the offspring is computed by (8). Otherwise, the offspring d
′
(
i
,
k
,
j
) is computed by (9). Let the mutating probability be p
m
∈
[
0,1
], the two points be J
1
=
int
⁡
(
V
2
·
(
e
+
1
)
), J
2
=
int
⁡
(
V
3
·
(
e
+
1
)
), and then the above offspring is mutated from
(10)
{
d
3
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
=
{
0
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
1
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
0
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

1
1
k

=

J
2
,
V
4

≤

p
m
,
{
d
′
(
i
,
k
,
j
)
}
(
i
,
k
,
j
)

=

0
{
d
′

(
i
,
k
,
j
)
}
(
i
,
k
,
j
)
otherwise
,
where a new offspring d
3
(
i
,
k
,
j
) can be computed by a mutating probability p
m.Step 7 (simplex evolution and alternating).
The Nelder-Mead algorithm is a useful, local descent algorithm, which does not make use of the objective function derivatives [30]. The best point in the previous phase becomes a new initial solution in the Nelder-Mead simplex algorithm, and then a new best point is obtained by this Nelder-Mead simplex algorithm. The new best point inside the offspring will be inserted to replace the worst one in the previous phase. Repeat Step 3 to Step 7 until the evolution times Q is met.Step 8 (accelerating cycle).
The parameter ranges ofn
s-excellent individuals obtained by Q-times of the Nelder-Mead simplex evolution alternating become the new ranges of the parameters and then the whole process back to the Gray-encoding. The GHAGA computation is over until the algorithm running times get to the design T times or there exists a chromosome c
fit whose fitness satisfies a given criterion. In the former case the c
fit is the fittest chromosome or the most excellent chromosome in the population. The chromosome c
fit represents the solution.


## 4. Results and Discussions

### 4.1. The Results of Parameters Identification

The GHAGA is calculated by using Matlab. Table2 presents the variable initial intervals of the 16 unknown parameters in system (1) which are given according to the meaning of the parameters and the empirical research. The parameters of the GHAGA are selected as follows: the length e
=
10, the population size n
=
300, the number of excellent individuals n
s
=
10, the times of simplex evolution alternating Q
=
5, the crossover probability p
c
=
1.0, the mutation probability p
m
=
0.5, and the times of simplex searching m
=
600. The computational results of parameter identification for system (1) are also listed in Table 2.Table 2
The parameters’ initial intervals and identified values. P stands for parameters, II stands for initial intervals, and IP stands for identified parameters.
P
a
1
a
2
a
3
a
4
b
1
b
2
b
3
c
1
c
2
c
3
c
4
d
1
d
2
d
3
M
N
II
[0.01, 1.00]
[0.01, 0.20]
[0.02, 0.20]
[0.05, 0.20]
[0.01, 0.15]
[0.04, 0.15]
[0.05, 0.20]
[0.10, 0.40]
[0.05, 0.30]
[0.01, 0.10]
[0.01, 0.20]
[0.01, 0.10]
[0.01, 0.10]
[0.01, 0.10]
[0.10, 2.00]
[0.10, 2.00]
IP
0.70
0.01
0.03
0.05
0.03
0.05
0.10
0.19
0.11
0.06
0.10
0.10
0.89
0.01
0.99
0.40


### 4.2.  The Dynamical Analysis of the Real System

When the parameters values are taken as shown Table2, system (1) has four equilibrium points: O
(
0,0
,
0,0
), S
1
(
0.9093,0.7669,0.8118,0.3969
), S
2
(
0.8856,0.4171,3.6269
,
-
0.9523
), and S
3
(
0.3586
,
-
2.8007,6.1825,0.0527
). By calculation, the eigenvalues of the Jacobi matrix of the system (1) at O
(
0,0
,
0,0
) are λ
1
=
0.6921
>
0, λ
2
=
0.0320
>
0, λ
2,3
=
-
0.1155
>
0, and λ
4
=
-
0.0876
>
0. Because four eigenvalues are not all negative, therefore O
(
0,0
,
0,0
) is an unstable point and the system is unstable at the point O
(
0,0
,
0,0
).The eigenvalues of the Jacobi matrix of the system (1) at S
1
(
0.9093,0.7669,0.8118,0.3969
) are λ
1
=
-
0.0022
<
0, λ
2
=
-
0.5721
<
0, and λ
3,4
=
-
0.0519
±
0
.
0677
i. Obviously, the real parts of all the four eigenvalues are negative, so the water resources supply-demand system is stable when the demand of water resources in Haihe River Basin, the surface water supply, the groundwater supply, and the other kinds of water supply are in the local area of the equilibrium point S
1
(
0.9093,0.7669,0.8118,0.3969
). It indicates that water resources supply-demand system has the capacity of self-adjustment and demonstrates the status of steady development in the local area of S
1
(
0.9093,0.7669,0.8118,0.3969
).Similarly, we can prove that the water resources supply-demand system is unstable when the demand of water resources in Haihe River Basin, the surface water supply, the groundwater supply, and the other kinds of water supply are in the local area of the equilibrium pointsS
2 and S
3.


### 4.3.  Numerical Simulations

In this section, based on the results of parameter identification by GHAGA, the numerical simulation results for the real water resources supply-demand system are obtained, and corresponding measures are given to ensure the steady development of the water resources supply-demand system.Case 1.
The result of parameter identification is used as the system parameters (Table2) and the initial condition is set as [
0.7,0.3,0.1,0.5
], and the water resources supply-demand system is stable as shown in Figure 6. Under the current initial situation and reasonable water resources demand, the relationship between water resources’ supply and demand of the HRB will be in a stable state. From Figure 6, we can see that the trend of the water resources demand will increase firstly and then decrease; the surface water supply will be in a growth trend until steady state; the groundwater supply will increase firstly and then decrease until a steady state; other kinds of water supply will be in a growth state. According to the above analysis of the trend of the three kinds of water supply sources, we can obtain that, in order to maintain the balance between water resources supply and demand, we need to save water and improve water use efficiency, give priority to use of south-to-north water, and improve the use of recycled water.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)
(d)Case 2.
Maintain other parameters constant and initial conditions are set as[
0.7,0.3,0.1,0.5
], when the maximum value M
>
1.5, the time series X
(
t
), Y
(
t
), Z
(
t
), and W
(
t
) are shown in Figure 7. From Figure 7, we can obtain that the values of Y
(
t
), Z
(
t
), and W
(
t
) are too large and beyond the scope of practical significance. It indicates that if the maximum demand of water resources is set to be very large; that is to say, if the water resources demand is not controlled, the system will be in an unstable state. Therefore, we must save water and control water demand.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
) when M
>
1.5.
(a)
(b)
(c)
(d)Case 3.
Setd
2
=
1.4 and maintain other parameters constant and the initial conditions are set as [
0.9,0.5,0.7,0.3
], the simulation result is shown in Figure 8. The figure shows that the trend of the other kinds of water resources supply will decrease until zero; the groundwater supply will increase until larger than 1, and this will lead to overexploitation of the groundwater supply. Therefore, with the cost of recycled water supply growing, the other kinds of water supply will decrease. That is to say, other types of water supply are dependent on the cost of the recycled water supply.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
) when d
2
=
1.4.
(a)
(b)
(c)
(d)Case 4.
Maintain other parameters constant and vary valve valueN, the water resources supply-demand system still maintains a stable state. It indicates that the valve value N has no influence on the system. However, if the valve value N is set to be very large, it will cause water resources shortage in other regions and further affect the economic development of the other regions. Therefore, an appropriate valve value needs to be selected.


## 4.1. The Results of Parameters Identification

The GHAGA is calculated by using Matlab. Table2 presents the variable initial intervals of the 16 unknown parameters in system (1) which are given according to the meaning of the parameters and the empirical research. The parameters of the GHAGA are selected as follows: the length e
=
10, the population size n
=
300, the number of excellent individuals n
s
=
10, the times of simplex evolution alternating Q
=
5, the crossover probability p
c
=
1.0, the mutation probability p
m
=
0.5, and the times of simplex searching m
=
600. The computational results of parameter identification for system (1) are also listed in Table 2.Table 2
The parameters’ initial intervals and identified values. P stands for parameters, II stands for initial intervals, and IP stands for identified parameters.
P
a
1
a
2
a
3
a
4
b
1
b
2
b
3
c
1
c
2
c
3
c
4
d
1
d
2
d
3
M
N
II
[0.01, 1.00]
[0.01, 0.20]
[0.02, 0.20]
[0.05, 0.20]
[0.01, 0.15]
[0.04, 0.15]
[0.05, 0.20]
[0.10, 0.40]
[0.05, 0.30]
[0.01, 0.10]
[0.01, 0.20]
[0.01, 0.10]
[0.01, 0.10]
[0.01, 0.10]
[0.10, 2.00]
[0.10, 2.00]
IP
0.70
0.01
0.03
0.05
0.03
0.05
0.10
0.19
0.11
0.06
0.10
0.10
0.89
0.01
0.99
0.40


## 4.2.  The Dynamical Analysis of the Real System

When the parameters values are taken as shown Table2, system (1) has four equilibrium points: O
(
0,0
,
0,0
), S
1
(
0.9093,0.7669,0.8118,0.3969
), S
2
(
0.8856,0.4171,3.6269
,
-
0.9523
), and S
3
(
0.3586
,
-
2.8007,6.1825,0.0527
). By calculation, the eigenvalues of the Jacobi matrix of the system (1) at O
(
0,0
,
0,0
) are λ
1
=
0.6921
>
0, λ
2
=
0.0320
>
0, λ
2,3
=
-
0.1155
>
0, and λ
4
=
-
0.0876
>
0. Because four eigenvalues are not all negative, therefore O
(
0,0
,
0,0
) is an unstable point and the system is unstable at the point O
(
0,0
,
0,0
).The eigenvalues of the Jacobi matrix of the system (1) at S
1
(
0.9093,0.7669,0.8118,0.3969
) are λ
1
=
-
0.0022
<
0, λ
2
=
-
0.5721
<
0, and λ
3,4
=
-
0.0519
±
0
.
0677
i. Obviously, the real parts of all the four eigenvalues are negative, so the water resources supply-demand system is stable when the demand of water resources in Haihe River Basin, the surface water supply, the groundwater supply, and the other kinds of water supply are in the local area of the equilibrium point S
1
(
0.9093,0.7669,0.8118,0.3969
). It indicates that water resources supply-demand system has the capacity of self-adjustment and demonstrates the status of steady development in the local area of S
1
(
0.9093,0.7669,0.8118,0.3969
).Similarly, we can prove that the water resources supply-demand system is unstable when the demand of water resources in Haihe River Basin, the surface water supply, the groundwater supply, and the other kinds of water supply are in the local area of the equilibrium pointsS
2 and S
3.


## 4.3.  Numerical Simulations

In this section, based on the results of parameter identification by GHAGA, the numerical simulation results for the real water resources supply-demand system are obtained, and corresponding measures are given to ensure the steady development of the water resources supply-demand system.Case 1.
The result of parameter identification is used as the system parameters (Table2) and the initial condition is set as [
0.7,0.3,0.1,0.5
], and the water resources supply-demand system is stable as shown in Figure 6. Under the current initial situation and reasonable water resources demand, the relationship between water resources’ supply and demand of the HRB will be in a stable state. From Figure 6, we can see that the trend of the water resources demand will increase firstly and then decrease; the surface water supply will be in a growth trend until steady state; the groundwater supply will increase firstly and then decrease until a steady state; other kinds of water supply will be in a growth state. According to the above analysis of the trend of the three kinds of water supply sources, we can obtain that, in order to maintain the balance between water resources supply and demand, we need to save water and improve water use efficiency, give priority to use of south-to-north water, and improve the use of recycled water.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
).
(a)
(b)
(c)
(d)Case 2.
Maintain other parameters constant and initial conditions are set as[
0.7,0.3,0.1,0.5
], when the maximum value M
>
1.5, the time series X
(
t
), Y
(
t
), Z
(
t
), and W
(
t
) are shown in Figure 7. From Figure 7, we can obtain that the values of Y
(
t
), Z
(
t
), and W
(
t
) are too large and beyond the scope of practical significance. It indicates that if the maximum demand of water resources is set to be very large; that is to say, if the water resources demand is not controlled, the system will be in an unstable state. Therefore, we must save water and control water demand.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
) when M
>
1.5.
(a)
(b)
(c)
(d)Case 3.
Setd
2
=
1.4 and maintain other parameters constant and the initial conditions are set as [
0.9,0.5,0.7,0.3
], the simulation result is shown in Figure 8. The figure shows that the trend of the other kinds of water resources supply will decrease until zero; the groundwater supply will increase until larger than 1, and this will lead to overexploitation of the groundwater supply. Therefore, with the cost of recycled water supply growing, the other kinds of water supply will decrease. That is to say, other types of water supply are dependent on the cost of the recycled water supply.The time series ofX
(
t
)
,
Y
(
t
)
,
Z
(
t
)
,
W
(
t
) when d
2
=
1.4.
(a)
(b)
(c)
(d)Case 4.
Maintain other parameters constant and vary valve valueN, the water resources supply-demand system still maintains a stable state. It indicates that the valve value N has no influence on the system. However, if the valve value N is set to be very large, it will cause water resources shortage in other regions and further affect the economic development of the other regions. Therefore, an appropriate valve value needs to be selected.


## 5. Conclusions

In this paper, a novel model is proposed to analyse the relationship between water resources supply and demand. The main conclusions are as follows.(1) Using dynamical system theory, we establish a new four-dimensional water resources supply-demand system with unknown parameters. This model can be used to analyse the complex nonlinear characteristics among the water resources demand, surface water supply, groundwater supply, and other kinds of water supply of a river basin or a city.(2) Selecting the Haihe River Basin as a study area, based on its statistic data (1998–2009), we identify the unknown parameters of the system with the gray code hybrid accelerating genetic algorithm (GHAGA). Therefore, a real water resources supply-demand system of the Haihe River Basin is determined.(3) Numerical simulation results provide the trend of the water resources demand and supply. The results show that the obtained water resources supply-demand system has the capacity of self-regulatory and demonstrates a steady state. Several cases are analysed and contribute to the formulation of policy and the management of water resources. Finally, the corresponding measures are proposed to ensure the steady development of the water resources supply-demand system.Our research provides a new method for water resources system analysis based on dynamical system theory. This method can also be used to discuss the balance between water resources supply and demand in other regions or cities.



---

*Source: 171793-2014-05-26.xml*