Water Resources Optimal Allocation based on Multi-Objective

Genetic Algorithm
LIU Meixia, WU Xinmiao
Agricultural University of Hebei, 071001, Baoding, China
liumeixia401@126.com
Abstract: In this paper, multi-objective Genetic Algorithm based on parataxis choice is introduced to
optimize water allocation. Fitness value is used to select the individual of every objective function, and
then the selected individuals are recombined to perform crossing and mutation. The Pareto optimal
solutions of water resources optimal allocation are obtained by carry on partition-parataxis
choice-merger operation continually. The result of example proves that the method is reasonable in the
application of water resources optimal allocation.
Key words: Multi-Objective Genetic Algorithm; water resources optimal allocation; Pareto
optimization solution

1 Introduction
Currently, the Sustainable Utilization of water resources relates to the harmonious development
among mankind, society, environment , and optimal allocation of water resources is a effective means
which can promise Sustainable Utilization of water resources , so the research on water resources
optimal allocation has great significance.
The purpose of water resources optimal allocation is to allocate the water resources scientifically and
rationally, making the limited water resources get reasonable, full exploitation, in order to acquire best
possible comprehensive benefit, which includes economic benefit, ecosystem environment benefit and
social benefit etc[1]. These benefits are usually mutual conflict and restriction, so the optimal allocation
of water resources is a multi-objective optimization problem, MOPs. The research on optimal allocation
of water resources has already obtained certain achievement, but most research adopt single objective or
traditional multi-objective optimal methods, such as, weighting method and restriction method etc.,
changing the complicated multi-objective optimal problem into single-object problem [1], but the
disadvantage of these methods is that each time we can acquire only one result, after computing many
times, we can acquire a group of Pareto optimization results. The essential difference between the
single-objective optimization problem and MOPs is that the result of MOPs is not the one and only, but
is a group of Pareto optimization results. In this paper, Multi-Objective Genetic Algorithm is introduced
to solve the problems of water resources optimal allocation.

2 Multi-Objective Optimization Problems

The definition of the MOPs is that in the feasible fields, a vector composed of decision variables is
defined to make the objective functions, which have mutual conflict relationship, reach to the best at the
same time. The essence of the multi-objective optimization is that in many instances, it is impossible to
optimize all objective at the same time; we can only harmonize between all the objectives to get possible
optimal solution [2].

3 The Multi-Objective Genetic Algorithm based on parataxis selection

Genetic Algorithms (GAs or GA) is inspired by Darwin's theory about evolution and it works very
well on mixed (continuous and discrete), combinatorial problems. The parataxis selection algorithm is
one method of the MOGA. The theory of it is that according to the number of the object function, the
initial population is averaged, and each object function is distributed to each subgroup. In each subgroup
the high fitness individuals are selected and a new population is composed of the subgroups which were
87

selected. Carrying out crossover operation and mutation operation in new population and bringing the
next generation, thus carrying on "partition- parataxis selection- merger" operation continually. Finally,
the Pareto optimization solutions are acquired[3]. The sketch map as figure1.
Choice criterion
Subgroup1

Object function1
Population

Object function2

Subgroup 2

Object function n Fi

Subgroup n

Crossover
Mutation

Number of generation i=i+1

gure1 the sketch map of the parataxis selection algorithm

4 The water resources optimal allocation based on Multi-Objective Genetic

Algorithm
4.1 Genetic coding of decision variable
In this research, binary encoding is adopted. For decision variable (the water consumption of different
sources distributing to different water users) xij (i denote water users; j denote source), the length of the
chromosome amounts to the number of decision variable. Every gene presents the corresponding
distribution water following its gene-locus. Every chromosome corresponds to a certain allocation
scheme of water resources.
4.2 Design of object function
According to the different needs, different object functions can be designed. In this study, water
sources are allocated to five water users. The five water users are respectively primary industry,
secondary industry, tertiary industry, town and country. The model as follows:
(1) Economy function: The water consumption of three industries divided by water consumption of
output value which produced by ten thousand, the maximal result as the economy function.
n
3

(1)
E = f1 ( x ij ) = max 10 4 1 / K i X ij
j =1

i =1
In the formula (1), the decision variable xij denotes the water consumption of different sources (j)
distributing to different water users (i) ;( 104 m3); i=1~5, denotes the five water users; j=i~n, denotes the
number of water sources; the symbol k , k 2 , k3 denote the water consumption of three industries
respectively,(m3 / 104 yuan); E denote total output value, (104 yuan).
(2) Population function: The water consumption of town and country divided by water use quota, and
the maximal number of population as the population function.
n
5

(2)
P = f 2 ( x ij ) = max 10 3 1 /(365 K i ) X ij
j =1

i = 4
1

In the formula (2) , the symbol of k 4 , k5 denote the water use quota of town and country

respectively, (L/(p d)); The symbol P denotes population function

88

(10 p).
4

(3) Water circumstance function: The minimal contamination of COD discharge amount is used to
represent water circumstance condition.
n
5

(3)
C = f 3 ( x ij ) = m a x 0 .0 1 d i p i X ij
i
=
1
j
=
1

In the formula (3), pi denotes sewage discharge rate; di denotes the amount of COD in per-unit
wastewater) C denotes the total amount of COD, (t).
4.3 Restriction condition
(1) Restriction of water supply amount:
5

ij

W j max

j=1~n

(4)

i =1

W j max

denotes the maximal water supply amount.

(2) Restriction of national economy:

E i m in

10

X ij / K i E i m a x

i=1~3

(5)

j =1

Ei min denotes the minimal production value of every industry; Ei max denotes the maximal production

value of every industry.

(3)Restriction of population:
Pi m in

10

X ij /( K i 3 6 5 ) Pi m a x

i=4~5

(6)

j =1

Pi min denotes the minimal number of population of town and country; Pi max denotes the maximal

number of population of town and country.

(4) Restriction of circumstance:
n

0.0 1 d

p i X ij C m ax

(7)

j =1 i = 1

[4]
Cmax denotes the maximal amount of COD which can be accepted ,t.

5 Example analyses
Based on the above model and optimal method, water resource allocation of city is optimized. Firstly,
the total water supply should satisfy the demand of water users, and the economy object, population
object and circumstance object are considered at the same time during allocating two water sources:
surface water and groundwater .In this example, the quantity of two water sources are allocated to five
water users, so the number of decision variables are ten, then the length of every chromosome is ten
gene-locus. Other parameters are as follows:
The size of the population Popsize=300; the maximal evolution generation maxgen=50; the
generation gap GGAP=0.9; the crossover probability Pcross=0.7.Finally, fifteen optimal schemes are
acquired. Here, we list six schemes among them for decision-making.

89

Results of Optimal Deployment of Water Resources (104m3/year

Water resource allocation of surface water
Primary
Secondary
Tertiary
Existing
Town
Country
industry
industry
industry
Surface water
10120
248760
10030
33600
10190
51000

Table1

Allocation
schemes
The first project
The second
project
The third project
The forth project
The fifth project
The sixth project

Difference
values
550

10120

249130

10150

33650

10050

51000

1190

10080
10060
10190
10180

245300
245820
246940
247630

10110
10160
10130
10070

26720
28240
25070
25060

10010
10070
10020
10000

51000
51000
51000
51000

1210
530
540
540

Water resource allocation of groundwater

Primary industry

Secondary industry

Tertiary industry

Town

Country

Existing groundwater

248400
248450

33680
33330

210
260

6200
6150

1250
1360

291400
291400

Difference
values
1660
1850

248450
248670

33610
33680

260
210

6150
6200

248680

33600

210

6200

1360
1250
1250

291400
291400
291400

1570
1390
1460

248670

33680

210

6200

1250

291400

1390

Table 2 Results of Three Object Functions

Allocation schemes
The first project
The second project
The third project
The forth project
The fifth project
The sixth project

Economy Function

Population Function

Production Value of Economy

108yuan
1853.00
1847.60
1687.90
1730.50
1658.10
1654.30

Total population
104p
822.64
836.20
937.13
934.80
787.43
772.25

Water circumstance
Function
COD Discharge amount
t
12217
12264
10311
10753
9856
9837

The optimal solutions and the contrast results with existing water are listed in table1; values of three
object functions are in table2. From the difference values in table1, we can conclude that the water
consumption of surface water and groundwater in every scheme is less than the existing water supply.
According to table2 the decision-makers can select final scheme according to their requirement.

6 Conclusion
Water resources optimal allocation is an important content of water resources layout, because the
system of water resource is multi-object, so its difficult by using traditional method to solve this
problem. In this paper, multi-objective genetic algorithm is used to solve the problem. According to
the characteristic of the genetic algorithm, the optimal program is developed and an example is analyzed.
The results are proved reasonable, and the final optimal schemes can be supplied to decision-making.

References
[1] Gao Ying, Shi Lei, Yao Pingjing. Study on Multi-Objective Genetic Algorithm. Proceedings of the
3th World Congress on Intelligent Control and Automation, 2000. (in Chinese).
[2] Zhang Liangzhen, Huang Qiao, Wang Haichao. Optimal Sensor Placement Based on Multi-object
90

Genetic Algorithm. Engineering Mechanics, 2007.4. (in Chinese).

[3] Huo Yingjie, Zhang Shanwen, Li Jiwu, Zhou Changming. MATLAB Toolbox and Applications of
Genetic Algorithm. Xi-an: Publishing House of Electron and Technology University of Xi-an,
2005.4:p32. (in Chinese).
[4]Li Hanxiao, Chen Senlin, Hu Shihui, Tang Haihua, Wang Bin. Multi-Object Analysis Method and
Applications of Area Water Carrying Capacity. Yangtze River, 2007.2:p58~59. (in Chinese).

91