2.3.1. Two-Layer OWA Model Based on Adjustable Robust Optimisation Mechanism
The goal of the basin is to maximise revenue for the basin water administrative department, specifically maximising the total value of water resources and tax revenue from water rights transactions. Maximising the total value of water resources involves maximising economic, social, and ecological environmental values while minimising the negative value of water pollution.
Each province (or region) in the basin aims to maximise its regional revenue, which involves maximising the total value of water resources and transaction revenue in the region while minimising various cost expenditures. These expenditures include water saving, wastewater treatment, and tax expenditures.
A unified unit water resource trading price is set for the entire basin as a whole in the utilisation of water resources. During the water allocation process in the basin, each province formulates the trading price based on the supply and demand relationship, achieving economic value compensation for the traded water volume among the provinces. The total amount of water resources purchased by the buyer in the monetised water resources transaction is equal to that of the seller. Therefore, the total CVWR value of the basin will not be affected by the price of water resource transactions.
Based on this analysis, the OWA model for sustainable development in the YRB was structured as a two-layer model. Because the revenues of the same water allocation decision vary across different scenarios and differ from the optimal revenues of each scenario, the relative robust criterion was adopted as the robust optimisation criterion of the model. The adjustable relative robust optimisation of the scenario uncertainty set is applied to the OWA of the basin, establishing a multi-objective OWA model for sustainable development that considers uncertainty and the economy–society–ecology nexus, as detailed below.
The objective functions of the model are formulated as follows.
where
is the robust optimal target revenue value of the basin,
is the robust optimal target revenue value of province (region)
i,
is the probability of scenario
s occurring,
is the total revenue of the basin under scenario
s when the OWA decision is made, and
is the total income of province (region)
i under scenario
s of water rights trading decisions.
and
are calculated as follows.
where
denotes the value curve uncertainty coefficient of scenario
s, and
represents the five water usage sectors: industry, agriculture, construction and services, society, and ecological environment, respectively.
denotes the value curve parameter of the
h-th industry in the
i-th province (region),
is the unit water resource value of the
h-th industry in the
i-th province (region) under the condition of no water saving in scenario
s.
represents the water-saving amount of the
i-th province (region).
is the initial water rights of the
i-th province (region) in scenario
s.
is the water allocation ratio of the
h-th industry in the
i-th province (region).
is the water rights trading volume of the
i-th province (region), with a positive value indicating the purchase of water rights, and a negative value indicating the sale of water rights.
represents the negative value per unit of untreated sewage and
is the sewage treatment rate of the
i-th province (district).
is the sewage discharge coefficient of the
h-th industry in the
i-th province (region).
is the tax revenue of the basin in scenario
s.
is the benchmark price of water rights trading in scenario
s, set as the highest unit water resource value among the water rights sellers.
reflects the impact of trading activity on prices and
.
is the uncertainty coefficient of the water-saving cost curve and
is the water-saving investment cost required for water-saving amount
.
is the tax expenditure of the
i-th province (region) in scenario
s.
is the unit sewage treatment cost of the
i-th province (region) in scenario
s. In the water resource reallocation plan, the affected user groups are classified into
n categories (such as agriculture, industry, low-income residents, etc.), denoted as
l = 1, 2, …,
n. Then, the formula for calculating the total opportunity cost is
.
denotes the reduced water volume for the
i-th category of users due to reallocation.
represents the unit water output loss value of the
i-th type of user.
denotes the unit water substitution cost of the
i-th type of user.
represents the transaction price per unit of water of province
i. If the province is the seller, the value of
is positive. If the province is the buyer, the value of
is negative. The total allocated water volume in province
i is
.
,
, and
represent economic value, social value, and ecological environment value per unit of water in province
i, respectively. The proportions of water applied to economic, social, and ecological environment values in province
i can be denoted as
,
, and
, respectively. Then, economic value, social value, and ecological environment value of water resources can be calculated by
,
, and
[
27].
The constraint conditions of the normal optimal model are as follows.
Equations (14) and (15) are robust constraints that limit the regret value of a decision to less than the robust coefficient . is the optimal revenue value of the basin in scenario s and is the optimal revenue value of the i-th province (region) in scenario s. is the water demand threshold of the h-th water usage sector in the i-th province (region) under scenario s. represents the historical annual water-saving amount of the i-th province (region). denotes the actual water volume after trading of the h-th water usage sector in the i-th province (region) under scenario s. represents environmental flow after the implementation of the water allocation plan in the YRB, denotes the minimum water demand threshold for environmental flow of the YRB.
2.3.2. Model Solving Based on Improved Multi-Objective Particle Swarm
PSO is known for its fast convergence speed. However, it has the drawback of easily falling into local optima. By linearly combining particles from the particle population and elite set to implement the crossover operator of real-coded genetic algorithms, the exchange of information among particles is increased. This approach can overcome the disadvantage of PSO by easily falling into local optima. Based on this, this study employs a multi-objective PSO algorithm that incorporates a crossover operator for model solving [
27]. The attributes of the objects and population objects in the proposed algorithm are detailed in
Table 1 and
Table 2, respectively.
The key operators of multi-objective particle swarm optimisation include the particle encoding operator, the velocity–position update operator, and the external archive operator. The particle encoding operator divides the basin into 9 major water users according to administrative divisions, and the encoding must meet the basic water use constraints of the basin. The inertia weight of the velocity–position update operator is taken from the adaptive value (initially 0.9, linearly decreasing to 0.4 with the number of iterations). The individual learning and group learning weights are set to be equal to ensure that particles can not only refer to their own historical optimal solutions but also absorb the group’s optimal solutions. The external archive operator uses the “crowding distance sorting method” to maintain the archive: when a new solution is added, the dominated solutions are deleted first; if the archive is full (set capacity to 100), the crowding distance of each solution is calculated (the smaller the distance, the denser the distribution of the solution), and the solution with the smallest crowding distance is deleted. This operator ensures that the final output of the optimal solution set is evenly distributed. The weights of the first and second layer OWA objective functions are 0.6 and 0.4, respectively; that is, the maximisation of regional water allocation benefits must be subordinate to the maximisation of the overall water allocation benefits of the basin management institution.
The water resources system is subject to inherent uncertainties (such as fluctuations in runoff and deviations in water demand predictions). This study adopts a combined approach of “historical data statistics + expert validation” to determine these. The “mean ± standard deviation” of monthly runoff from 2010 to 2023 is calculated, and “mean ± 30%” is taken as the uncertainty range (as the maximum inter-annual variation in runoff in the YRB reaches 30%) [
5].
For the
k-th iteration, for the
i-th particle in the population, the velocity and position of the particle are
and
, respectively. The optimal position of the particle is
, and the optimal position of the population is
. The particle velocity and position were updated as follows.
where
denotes the position of a particle randomly selected from the elite population set.
,
, and
are random numbers ranging from 0 to 1, and
,
, and
are fixed values representing the inertia weights of the particle velocity, self-learning factor, and social learning factor, respectively.
For a population of size N, where is a particle in the population, uncontrolled rank value sorting was performed according to the following steps:
(1) Set .
(2) Select a particle from P and let .
(3) For each particle in population P, and .
Let .
For each particle in , determine the controlled relationship of the particle fitness function values:
① If , ,;
② If , no processing is performed;
③ If and , when , .
Let .
(4) Output a subpopulation of the same uncontrolled rank, whose rank value is .
(5), if , then end, otherwise, set and jump to step (2).
For each subpopulation, of the population sorted by uncontrolled rank values: Let it have m objective functions, iterate T times, and calculate the crowding degree of the particles in the subpopulation according to the following steps:
(1) Set , and initialise the crowding degree distance for all particles.
(2) For each objective function :
Sort each particle in the sub-population P by the value of the objective function, ;
Crowding distance between the first particle
and the
n-th particle
in subpopulation
P:
The crowding distance for second particle to the
n − 1th particle
in the sub-population
P:
(3) If , then end, otherwise, set and jump to step (2).
The solution steps of the multi-objective PSO algorithm based on the crossover operator are as follows:
(1) Set , initialise the population with N particles.
(2) Perform uncontrolled rank sorting on , calculate the crowding degree distance for each particle, update the elite set of the population, and update the Pareto optimal solution set of the problem.
(3) Randomly select a particle from the elite set as the particle corresponding to the global optimal position of the population, update the velocity and position of each particle in the population , and generate population .
(4) Generate a new population .
(5) Perform uncontrolled rank sorting on , calculate the crowding degree distance for each particle in the sub-population, and select N particles according to the principle of “priority to particles with higher uncontrolled rank, and for particles with the same uncontrolled rank, priority to particles with larger crowding degree distance.”
(6) Set , and form the new generation population with the particles selected in step (5).
(7) Update the elite set of population .
(8) Update the Pareto optimal solution set of the problem: let , perform uncontrolled rank sorting on A, and select particles with higher uncontrolled rank to form set A.
(9) End when , output the Pareto optimal solution set of the problem; otherwise, proceed to step (3).
In step (3), by determining the controlled relationship of the particle fitness function value, the particle’s optimal position is selected as follows:
(1) Set the initial condition of the individual best particle corresponding to the particle optimal position as each particle in the initial population , and set the new particle generated after updating the velocity and position as .
(2) If , then retain .
(3) If , then .
(4) If and , randomly select to retain or let .
Throughout the algorithm, constraints are handled as follows. Whenever a Pareto dominance comparison is performed between two particles, we first check whether the two particles satisfy the constraint conditions. Particles that satisfied the constraints and had fewer constraint violations were preferentially selected. When both particles satisfied the constraint conditions, a Pareto dominance comparison was performed, and the particle with the Pareto dominance was preferentially selected. The optimal value of the model solving algorithm is determined by Tamhane test [
28]. Meanwhile, the algorithm parameters are optimised by Response Surface Methodology (RSM) [
29].