Conference PaperPDF Available

The multiobjective evolutionary annealing-simplex method and its application in calibrating hydrological models

Authors:

Abstract

Optimisation problems related to water resources are, by nature, multiobjective, even if traditionally handled as single-objective. Current advances in hydrological modelling employ multiobjective approaches to treat the well-known problem of "equifinality", thus assessing the uncertainties related to the parameter estimation procedure. However, computer tools generating Pareto-optimal solutions are still particularly time-consuming, especially in real-world applications, with many parameters and many fitting criteria. Moreover, the mathematical concept of Pareto optimality often leads to solutions that are far away from an acceptable compromise between the conflicting objectives. Most multiobjective optimisation tools are adaptations of evolutionary algorithms. In multiobjective evolutionary optimisation two are the major goals: (a) guiding the search towards the Pareto-optimal front, and (b) generating a well-distributed set of nondominated solutions. Both are achieved through the fitness evaluation and selection procedures; using the fundamental principle of dominance, scalar fitness values are assigned to individuals, then evolved by employing the typical genetic operators (crossover, mutation). The multiobjective evolutionary annealing-simplex (MEAS) method is an innovative scheme, also comprising an evaluation phase and an evolution phase. The evaluation aims to assign a performance measure to each member of the population, which requires the comparison of all individuals against each other and against all criteria. A fitness strategy inspired from the strength-Pareto approach of Zitlzer and Thiele (IEEE Trans. Evol. Comp., 3(4), 1999), in addition to an extension of the definition of dominance, provides a large variety of discrete performance values. The population is guided towards a promising sub-region of the Pareto front (not the entire front), that contains representative trade-offs, among which the best-compromise may easily detected. The generation of solutions with extreme performance, i.e. too good against some criteria, too bad for the rest ones, is prohibited, by means of penalty functions. In this manner, the discrete fitness space is transformed to a continuous space, which may be explored through global search techniques. The latter (i.e., the evolution phase) is implemented through a set of combined deterministic and stochastic transition rules, most of them based on a simplex-evolving pattern. During evolution, the degree of randomness is controlled through an adaptive annealing cooling schedule, which automatically regulates the "temperature" of the system. The MEAS method was tested on a variety of benchmark functions taken from the literature, as well as on some challenging hydrological applications, formerly handled through weighted objective functions. The analysis indicate that the proposed algorithm locates good trade-offs among the conflicting objectives simultaneously being much more efficient if compared to other, well-established multiobjective evolutionary schemes.
European Geosciences Union (EGU) - General Assembly
Vienna, Austria, 25 - 29 April 2005
Session HS1: Hydroinformatics
The multiobjective evolutionary
annealing-simplex method
and its application in calibrating
hydrological models
Andreas Efstratiadis and Demetris Koutsoyiannis
Department of Water Resources, School of Civil Engineering,
National Technical University, Athens, Greece
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 2
Hydrological modelling and multiobjective
parameter estimation: The motivation
¾Complex (semi- or fully-distributed) models generate multiple output variables
at various sites need for faithful reproduction of all model responses,
that are representative of the watershed behaviour
¾Due to the large number of parameters and their highly nonlinear interactions,
alternative sets with similarly good performance may be detected (the
“equifinality” problem) need for establishment of “behavioural” (i.e.,
realistic, reliable and stable) parameter sets
¾Models are too weak against data and structural errors need to assess
the sensitivity of parameters and the model predictive uncertainty
¾Multiple error measures, when aggregated to a single objective function,
formulate response surfaces that are strongly related to the aggregation
scheme need to distinguish the optimisation criteria, to avoid scaling
problems and to investigate possible contradictory interactions
¾Automatic calibration methods, involving too extended, high-dimensional and
non-convex search spaces, are easily trapped by local optima or other
peculiarities need for reducing the parameter boundaries, to assist the
searching procedure
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 3
Multiobjective optimisation: The story so far
¾“Philosophical” foundation (1880-1900): the concept of Pareto-Edgeworth
optimum, applied in sociology and welfare economics
¾Mathematical foundation (1950-1960): formulation of the vector maximum
problem by Kuhn and Tucker and first engineering applications
¾Plain aggregating approaches (1970): a priori definition of the best
compromise decision set, through the formulation of utility functions based on
weighting coefficients, articulation of preferences, goal-vectors, etc.
¾Population-based non-Pareto approaches (1980): formulation of sub-sets,
each one evaluated according to different criterion (by switching objectives),
and next shuffled and evolved through crossover and mutation (VEGA)
¾Dominance-based evolutionary approaches (1990): use of ranking
procedures, based on the principle of Pareto optimality, and techniques to
maintain diversity through fitness sharing, to generate representative trade-
offs among conflicting objectives (MOGA, NSGA, NPGA)
¾Modern approaches: revision of multiobjective evolutionary schemes, with
emphasis on efficiency, using faster ranking techniques, clustering methods
and elitism mechanisms (SPEA, SPEA-II, NSGA-II, PAES, MOMGA, etc.)
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 4
Multiobjective evolutionary algorithms:
General principles
1. According to the principle of dominance, a rank measure riis assigned to
each individual or group of individuals, where the best (lower) value
corresponds to non-dominated points, thus guiding the search towards the
Pareto front; a variety of rank values protects from high selection pressure.
2. A density measure σiis assigned to individuals, using sharing functions or
nearest neighbour techniques, to maintain diversity within population, thus
favouring the generation of well-distributed sets.
3. The selection process is implemented applying typical mechanisms (e.g.,
roulette, tournament), on the basis of dummy fitness of the form φi= φ(ri, σi).
4. The evolution process is implemented using the typical genetic operators.
In multiobjective evolutionary
search, due to the use of the
concept of dominance in fitness
evaluation, a discrete response
surface is created, which is
reformed at each generation.
A well-distributed
set, representative
of the Pareto front
f2
f1
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 5
Applying multiobjective evolutionary algorithms
for model calibration: Some drawbacks
¾Search is computationally demanding, especially in the case of complex
models with many parameters.
¾There is too little experience regarding problems with more than two criteria.
¾Fitting criteria are conflicting only in case of ill-posed structures or data.
¾The concept of dominance is not necessarily consistent with the concept of
“equifinality”; hence multiobjective search may result to non-behavioural,
albeit Pareto optimal, parameter sets, providing extreme performance, i.e. too
good against some criteria, too bad against the rest ones.
¾A best-compromise parameter set is required for operational purposes.
f1
f2
“Smooth” non-
dominated front; all
points correspond
to “behavioural”
parameter sets
f1
f2
Only a small part
of the Pareto front
corresponds to
“behavioural”
parameter sets
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 6
The multiobjective evolutionary annealing-
simplex (MEAS) method
Phase 1: Evaluation
A performance measure (fitness) is assigned, consisting of:
a rank measure, based on a strength-Pareto scheme, which both ensures
convergence to the real Pareto front and diversity preservation;
an indifference measure for further discrimination of indifferent solutions in
case of multiple (more than two) objectives;
a feasibility measure, for guiding search toward a desirable region of the
Pareto front, thus providing acceptable trade-offs among conflicting objectives.
Phase 2: Evolution
Evolution is implemented according to transition rules that are based on a
simplex-annealing approach, where:
a downhill simplex pattern, combining both deterministic and stochastic
transition rules, is employed for offspring generation;
an adaptive annealing cooling schedule is used to control the degree of
randomness during evolution.
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 7
The MEAS method: Fitness assignment through
a strength-Pareto approach
0 (2)
0 (3)
0 (3)
0 (2)
2 (1) 13 (0)
3 (1)
6 (1)
5 (0)
Strength =
number of
dominated
individuals
Rank = sum
strength of all
dominators
Non-dominated
individuals have
zero rank
¾The concept is based on the SPEA
and SPEA-II methods (Zitzler and
Thiele, 1999; Zitzler et al., 2002).
¾For each individual, both
dominating and dominated points
are taken into account.
¾Formulates a integral response
surface that changes whenever a
new individual is generated.
¾Provides a large variety of rank
values (larger than any other known
ranking algorithm), as well as a sort
of “niching” mechanism, to preserve
population diversity.
¾A non-integral term is added to
fitness, to penalise individuals
excelling in fewer criteria than other
indifferent ones, with identical rank
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 8
The MEAS method: Restricting the feasible
objective space
¾Based on a concept inspired from the goal-programming method.
¾Requires the specification of a constraint vector ε= (ε1, …, εm) denoting the
boundaries of a desirable (“feasible”) region of the objective space.
¾Ensures a better insight on the most promising parts of the Pareto front,
where the best-compromise parameter set is suspected to be sited.
f2
f1
ε1
Constraint
vector ε
Non-feasible,
albeit optimal
sub-front
Computational steps
1. The maximum fitness value is
computed, i.e. Φ= max φ(i).
2. Each individual iis checked whether it
lies within the feasible space; if xij > εj
for the jth criterion, a square distance
penalty εij = (xiεi)2is added to φ(i).
3. All infeasible individuals are further
penalised by adding Φ; hence, they
become worse than any other feasible
individual, either dominated or not.
ε2
Optimal
sub-front
Feasible
objective
space
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 9
The MEAS method: A selection procedure
based on a simulated annealing strategy
f(i) = φ(i) + p(i) + rT
Deterministic component, y(i)Stochastic component, s(i)
Penalty measure
Dominance
term, φ(i)
Feasibility
term, p(i)
Unit random
number, r
Current system’s
temperature, T
Favours the survival
of feasible and non-
dominated solutions
Provides flexibility,
to escape from local
optima and handle
peculiarities of non-
convex spaces
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 10
The MEAS method: Evolving population
1. According to an elitism concept, the population is divided to non-dominated
(φ< 1) and dominated (φ> 1) individuals.
2. The system temperature is regulated in order to not exceed Tmax = ξy,
where ξ1 parameter of the annealing cooling schedule and ythe
difference between the best and worst fitness of current population.
3. From the entire population n+ 1 points are picked up, thus forming a
simplex in the n-dimensional search space; at least one simplex vertex is
selected from the dominated set, given that the latter is not empty.
4. The “weakest” individual wis detected by means of maximisation of f.
5. A crossover scheme is employed on the basis of a downhill simplex pattern;
if a better point x΄(“offspring”) is located, it replaces wand the temperature is
reduced by λ, where λ< 1 parameter of the annealing cooling schedule.
6. If recombination fails (i.e., any better solution cannot be found), the offspring
is generated via a random perturbation (mutation) of w, i.e. x΄= w+ x.
For an earlier, single-objective implementation of the evolutionary annealing-simplex
method see: Efstratiadis and Koutsoyiannis (2002), Rozos et al. (2004)
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 11
The MEAS method: Simplex configurations
Outside contraction
Inside
contraction
Multiple expansion
(one-dimensional
minimisation)
Centroid Reflection
Weakest
vertex, wOffspring, x΄Offspring
Trial 3
(offspring)
Offspring
Trial 1
(reflection)
Trial 2
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 12
Performance assessment of MEAS method:
Test function SCH-2
0
2000
4000
6000
8000
10000
12000
-50 0 50 100
Initial set
0.0
2.0
4.0
6.0
8.0
10.0
12.0
14.0
16.0
-1.0 -0.5 0.0 0.5 1.0
Final set Pareto front
¾Taken from Schaffer
(1984)
¾Single control
variable, in the range
[-100, 100]
¾Extended feasible
objective space
¾Disconnected Pareto
set (1 x2 and 4
x5)
¾Disconnected and
convex Pareto front
¾Population size = 100
¾Convergence to a non-dominated
set after 9366 function evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 13
Performance assessment of MEAS method:
Test function KUR
-15
-10
-5
0
5
10
15
20
25
-20 -15 -10 -5
Initial set After 25000 evaluations Final set
¾Taken from Kursawe
(1991)
¾3 control variables, in
the range [-5, 5]
¾Non-convex Pareto front
¾Population size = 100
¾Convergence to a non-
dominated set after
37563 function
evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 14
Performance assessment of MEAS method:
Test function POL
0
5
10
15
20
25
30
35
40
0 102030405060
Initial set Final set
¾Taken from Poloni
(1997)
¾Two control variables, in
the range [-π, π]
¾Non-convex and
disconnected Pareto
front
¾Population size = 100
¾Convergence to a non-
dominated set after 2218
function evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 15
Performance assessment of MEAS method:
Test function ZDT-2
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
0.0 0.2 0.4 0.6 0.8 1.0
Initial set Final set
Pareto front Non-dominated set
¾Taken from Zitzler et al.
(2000)
¾30 control variables, in
the range [0, 1]
¾Pareto set: 0 x11
and xi= 0, for i= 2,.., 30
¾Non-convex Pareto front
¾Population size = 100
¾Convergence to a
locally non-dominated
set after 16080 function
evaluations
¾Final set obtained after
25000 function
evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 16
Performance assessment of MEAS method:
Test function ZDT-3
-2.0
-1.0
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
0.0 0.2 0.4 0.6 0.8 1.0
Initial set Final set F-boundary
¾Taken from Zitzler et al.
(2000)
¾10 control variables, in
the range [0, 1]
¾Disconnected Pareto
set: 0 x11 and xi=
0, for i= 2,.., 10
¾Convex and
disconnected Pareto
front
¾Population size = 100
¾Convergence to a non-
dominated set after
12944 function
evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 17
Performance assessment of MEAS method:
Test function ZDT-6
0.0
1.0
2.0
3.0
4.0
5.0
6.0
7.0
8.0
9.0
10.0
0.30.50.70.9
Initial set Non-dominated set
Pareto front Final set
¾Taken from Zitzler et al.
(2000)
¾10 control variables, in
the range [0, 1]
¾Pareto set: 0 x11
and xi= 0, for i= 2,.., 10
¾Non-convex and non-
uniformly distributed
Pareto front
¾Population size = 100
¾Final set, with
satisfactory spread of
non-dominated points,
found after 150000
function evaluations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 18
Multiobjective calibration of a complex
hydrological model: Study area
¾Watershed area ~2000 km2, with highly non-linear
interactions between surface and groundwater
processes and man-made interventions.
¾Main modelling issues:
a semi-distributed schematisation of the
hydrographic network;
a conceptualisation of surface processes,
based on spatial elements with homogenous
characteristics (hydrological response units,
HRU) and fitting to each one a soil moisture
accounting model of six parameters;
a multi-cell groundwater scheme, with two
parameters assigned to each cell;
a water management model, estimating the
optimal system fluxes (flows, abstractions).
¾Model components: 5 sub-basins, 6 HRU, 35
groundwater cells
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 19
Multiobjective calibration of a complex
hydrological model: Main assumptions
¾Observed series: daily discharge measurements at the basin outlet (Karditsa
tunnel), sparse (1-2 per month) discharge measurements at six main karstic
springs, contributing more than 50% of total runoff
¾Control period: October 1984-September 1990 (calibration period), October
1990-September 1994 (validation period)
¾Calibration criteria: determination coefficients of monthly discharge series at
the basin outlet and the main spring sites (number of objectives = 7)
¾Control variables: soil moisture capacity (K) and recession rate for
percolation (µ), assigned to each HRU, conductivity (C) of each virtual cell
that represents spring dynamics (search space dimension = 18)
¾Feasible search space: 0 < Ki< 1000 (in mm), 0 < µi< 1 (dimensionless),
0.000001 < Ci< 0.5 (in m/s)
¾Algorithmic inputs: sample size = 50, maximum function evaluations = 5000
¾Other model parameters: obtained through an earlier single-objective
optimisation scenario, based on a weighted objective function and handled by
combining automatic and manual calibration methods (Rozos et al., 2004)
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 20
Multiobjective calibration of a complex hydrological
model: Characteristic trade-offs
0.00
0.50
1.00
1.50
2.00
2.50
3.00
3.50
4.00
4.50
0.20 0.25 0.30 0.35 0.40 0.45 0.50
Error for Mavroneri springs runoff
Error for Melas spring runoff
0.20
0.25
0.30
0.35
0.40
0.45
0.50
0.20 0.25 0.30 0.35
Error for Lilea springs runoff
Error for Mavroneri
springs runoff
0.00
0.50
1.00
1.50
2.00
2.50
3.00
3.50
4.00
4.50
0.12 0.13 0.14 0.15 0.16 0.17
Error for Karditsa runoff
Error for Melas spring runoff
0.00
0.50
1.00
1.50
2.00
2.50
3.00
3.50
4.00
4.50
0.20 0.25 0.30 0.35
Error for Lilea springs runoff
Error for Melas springs
runoff
Trade-offs represent: (a) modelling errors due to the complexity of processes
(negative correlation of some spring hydrographs with precipitation); and (b)
data errors, due to the construction of control series based on few observations
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 21
Multiobjective calibration of a complex hydrological
model: Restricting the objective space
-3.50
-3.00
-2.50
-2.00
-1.50
-1.00
-0.50
0.00
0.50
1.00
Determ ination coefficient
Minimum
Maximum
Optimal
-3.00
-2.50
-2.00
-1.50
-1.00
-0.50
0.00
0.50
1.00
Determ ination coefficient
Minimum
Maximum
Optimal
0.00
0.10
0.20
0.30
0.40
0.50
0.60
0.70
0.80
0.90
1.00
Karditsa
Lilea
Mavroneri
Ag.
Paraskevi
Erkyna
Melanas
Polygyra
Determ ination coefficient
Minimum
Maximum
Optimal
-0.50
-0.25
0.00
0.25
0.50
0.75
1.00
Karditsa
Lilea
Mavroneri
Erkyna
Melanas
Determination coefficient
Minimum
Maximum
Optimal
Unbounded objective space, calibration Unbounded objective space, validation
Bounded objective space, calibration Bounded objective space, validation
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 22
Concluding remarks
¾Despite the impressive progress of last years regarding the development of
evolutionary multiobjective optimisation techniques, limited experience
exist on operational applications of hydrological interest, and most of them
restricted to two-dimensional objective spaces.
¾When fitting hydrological models on numerous observed responses,
irregular Pareto fronts are formed due to structural and data errors.
¾In case of complex, ill-posed hydrological models with many parameters, a
multiobjective calibration approach is necessary to:
reduce uncertainties regarding the parameter estimation procedure;
investigate acceptable trade-offs between optimisation criteria;
guide the search towards promising areas of both the objective and the
parameter space.
¾The MEAS algorithm is an innovative scheme, suitable for challenging
hydrological calibration problems, which combines: (a) a fitness evaluation
procedure based on a strength-Pareto approach and a feasibility concept,
(b) an evolving pattern based on the downhill simplex method, and (c) a
simulated annealing strategy, to control randomness during evolution.
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 23
References
¾Efstratiadis, A., and D. Koutsoyiannis, An evolutionary annealing-simplex algorithm for global
optimisation of water resource systems, in Proceedings of the Fifth International Conference on
Hydroinformatics, Cardiff, UK, 1423-1428, IWA, 2002.
¾Kursawe, F., A variant of evolution strategies for vector optimization, in Parallel Problem Solving from
Nature, H. P. Schwefel and R. Manner (editors), 193-197, Springer-Verlag, Berlin, 1991.
¾Poloni, C., Hybrid GA for multiobjective aerodynamic shape optimization, in Genetic Algorithms in
Engineering and Computer Science, G. Winter, J. Periaux, M. Galan, and P. Cuesta (editors), New
York, Wiley, 397-414, 1997.
¾Rozos, E., A. Efstratiadis, I. Nalbantis, and D. Koutsoyiannis, Calibration of a semi-distributed model
for conjunctive simulation of surface and groundwater flows, Hydrological Sciences Journal, 49(5),
819-842, 2004.
¾Shaffer, J. D., Multiple objective optimization with vector evaluated genetic algorithms, in Proceedings
of an International Conference on Genetic Algorithms and their Applications, J. J. Grefenstette
(editor), 93-100, Pittsburgh, 1985.
¾Zitzler, E., K. and L. Thiele, Multiobjective evolutionary algorithms: A comparative case study and the
strength pareto approach, IEEE Transactions on Evolutionary Computation, 3(4), 257-271, 1999.
¾Zitzler, E., K. K. Deb, and L. Thiele, Comparison of multiobjective evolutionary algorithms: Empirical
results, Evolutionary Computation, 8(2), 173-195, 2000.
¾Zitzler, E., M. Laumanns, and L. Thiele, SPEA 2: Improving the strength Pareto evolutionary algorithm
for multiobjective optimization, in Evolutionary Methods for Design, Optimization and Control, K.
Giannakoglou, D. Tsahalis, J. Periaux, K. Papailiou, and T. Fogarty (editors), 19-26, Barcelona, 2002.
Efstratiadis and Koutsoyiannis, The MEAS method and its application in calibrating hydrological models 24
This presentation is available on-line at:
http://itia.ntua.gr/e/docinfo/644
Poster presentation of the hydrological model:
Friday, 29 April 2005, 17:30 - 19:00, area Z028
Contact info:
andreas@itia.ntua.gr
dk@itia.ntua.gr
... At each generation, new sets are evaluated regarding the objectives, and only the more "suitable" sets are kept to build the new population. The caRamel algorithm is largely inspired by 1. the multi-objective evolutionary annealing simplex method (MEAS; Efstratiadis and Koutsoyiannis, 2005;Efstratiadis and Koutsoyiannis, 2008), with respect to the directional search method, based on the simplexes of the objective space, and 2. the non-dominated sorting genetic algorithm II (ε-NSGA-II; Reed and Devireddy, 2004), for the classifi- This section describes the functioning of the caRamel algorithm; this algorithm has been implemented in an R package, caRamel, that is described in Appendix A. ...
... The explanation of the first rule is based on Fig. 3a. First, a triangulation of the points in the objective space E f is established: simplexes built with these points f (θ i ) are a partition of the explored zone in this space (Efstratiadis and Koutsoyiannis, 2005). ...
... The MEAS algorithm (Efstratiadis and Koutsoyiannis, 2005) combines a performance evaluation procedure based on a Pareto approach and the concept of feasibility, an evolving pattern based on the downhill simplex method, and a simulated annealing strategy, to control randomness during evolution. The algorithm evolution is sensitive to the value of the mutation probability which has been adapted to each case study according to its complexity (5 % for Kursawe and 50 % for the other case studies). ...
Article
Full-text available
Environmental modelling is complex, and models often require the calibration of several parameters that are not able to be directly evaluated from a physical quantity or field measurement. Multi-objective calibration has many advantages such as adding constraints in a poorly constrained problem or finding a compromise between different objectives by defining a set of optimal parameters. The caRamel optimizer has been developed to meet the requirement for an automatic calibration procedure that delivers not just one but a family of parameter sets that are optimal with regard to a multi-objective target. The idea behind caRamel is to rely on stochastic rules while also allowing more “local” mechanisms, such as the extrapolation along vectors in the parameter space. The caRamel algorithm is a hybrid of the multi-objective evolutionary annealing simplex (MEAS) method and the non-dominated sorting genetic algorithm II (ε-NSGA-II). It was initially developed for calibrating hydrological models but can be used for any environmental model. The caRamel algorithm is well adapted to complex modelling. The comparison with other optimizers in hydrological case studies (i.e. NSGA-II and MEAS) confirms the quality of the algorithm. An R package, caRamel, has been designed to easily implement this multi-objective algorithm optimizer in the R environment.
... At each generation, new sets are 25 evaluated regarding the objectives and only the more "suitable" sets are kept to build the new population. CaRamel algorithm is largely inspired by: 1) the Multiobjective Evolutionary Annealing Simplex method (MEAS, Efstratiadis and Koutsoyiannis, 2005), for the directional search method, based on the simplexes of the objectives space, 2) the Nondominated Sorting Genetic Algorithm II (ε-NSGA-II, Reed and Divireddy, 2004), for the classification of 30 parameters vectors and the management of precision by ε-dominance. https://doi.org/10.5194/hess-2019-259 ...
... The R package caRamel has been designed to easily implement a multi-objective optimizer in the R environment. The algorithm is a hybrid of the Multiobjective Evolutionary Annealing Simplex (MEAS) algorithm (Efstratiadis and Koutsoyiannis, 2005) by using the directional search method based on the simplexes of the objective space and the ε-NGSA-II algorithm with the method of classification of the parameters vectors archiving management by ε-dominance (Reed and Devireddy, 2004). The main function of the package, caRamel(), requires a multiobjective function to be defined in a R 10 script and bounds on the parameters involved in the calibration. ...
Article
Full-text available
Environmental modelling is complex, and models often require the calibration of several parameters that are not directly evaluable from a physical quantity or a field measurement. The R package caRamel has been designed to easily implement a multi-objective optimizer in the R environment to calibrate these parameters. A multiobjective calibration allows to find a compromise between different goals by defining a set of optimal parameters. The algorithm is a hybrid of the Multiobjective Evolutionary Annealing Simplex method (MEAS) and the Nondominated Sorting Genetic Algorithm II (ε-NSGA-II algorithm). The optimizer was initially developed for the calibration of hydrological models but can be used for any environmental model. The main function of the package, caRamel(), requires to define a multi-objective calibration function as well as bounds on the variation of the underlying parameters to optimize. CaRamel is well adapted to complex modelling. As an example, caRamel converges quickly and has a stable solution after 5,000 model evaluations with robust results for a real study case of a hydrological problem with 8 parameters and 3 objectives of calibration. The comparison with another well-known optimizer (i.e. MCO, for Multiple Criteria Optimization) confirms the quality of the algorithm.
... The multiobjective evolutionary annealing-simplex (MEAS; Efstratiadis, 2008; Efstratiadis and Koutsoyiannis, 2005 ) method briefly presented here is a generalpurpose tool that places emphasis on the specific features of hydrological models. The algorithm embodies two phases: in the evaluation phase a fitness measure is assigned to all population members, whereas in the evolution phase new individuals are generated on the basis of their fitness values. ...
... Dynamic data include precipitation and potential evapotranspiration series, given at a sub-basin scale, and target demand series, referring to water needs as well as to various water management constraints (e.g., flow preservation). Various modules are combined to represent the key processes in the watershed , i.e., (a) a conceptual soil moisture accounting model with six parameters per HRU; (b) a groundwater model, based on a modified finite-volume numerical method, where two parameters are assigned to each groundwater tank (Rozos and Koutsoyiannis, 2006); and (c) a water management model, inspired from graph theory, which estimates the optimal hydrosystem fluxes, satisfying both physical constraints and target priorities and simultaneously minimizing costs (Efstratiadis et al., 2004). Model outputs include discharges through the river network, spring flows, groundwater levels and water abstractions. ...
Chapter
Full-text available
Most complex hydrological modelling schemes, when calibrated on a single observed response (e.g. river flow at a point), provide poor predictive capability, due to the fact that the rest of variables of basin response remain practically uncontrolled. Current advances in modelling point out that it is essential to take into account multiple fitting criteria, which correspond to different observed responses or to different aspects of the same response. This can be achieved through multiobjective calibration tools, thus providing a set of solutions rather than a single global optimum. Besides, actual multiobjective optimization methods are rather inefficient, when real-world problems with many criteria and many control variables are involved. In hydrological applications there are some additional issues, due to uncertainties related to the representation of complex processes and the observation errors. The multiobjective evolutionary annealing-simplex (MEAS) method implements an innovative scheme, particularly developed for the optimization of such problems. Its features and capabilities are illustrated by solving a challenging parameter estimation problem, dealing with hydrological modelling and water resources management in a karstic basin in Greece.
... This approach proved efficient for such parsimonious models compared to more complex search algorithms (Edijatno et al., 1999;Mathevet, 2005). The parameters from Cequeau were optimised using a more complex procedure developed by Le Moine (2009), which combines the multi-objective evolutionary annealingsimplex (MEAS) algorithm proposed by Efstratiadis and Koutsoyiannis (2005) and the multi-objective genetic algorithm, ε-NSGA-II, detailed by Reed and Devireddy (2004). This procedure has proved to be efficient in past applications of the Cequeau model for water resources assessment and dam management in France (Bourqui et al., 2011;François et al., 2013). ...
Article
Full-text available
This paper investigates the robustness of rainfall–runoff models when their parameters are transferred in time. More specifically, we propose an approach to diagnose their ability to simulate water balance on periods with different hydroclimatic characteristics. The testing procedure consists in a series of parameter calibrations over 10 yr periods and the systematic analysis of mean flow volume errors on long records. This procedure was applied to three conceptual models of increasing structural complexity over 20 mountainous catchments in southern France. The results showed that robustness problems are common. Errors on 10 yr mean flow volume were significant for all calibration periods and model structures. Various graphical and numerical tools were used to investigate these errors and unexpectedly strong similarities were found in the temporal evolutions of these volume errors. We indeed showed that relative changes in simulated mean flow between 10 yr periods can remain similar, regardless of the calibration period or the conceptual model used. Surprisingly, using longer records for parameters optimisation or using a semi-distributed 19-parameter daily model instead of a simple 1-parameter annual formula did not provide significant improvements regarding these simulation errors on flow volumes. While the actual causes for these robustness problems can be manifold and are difficult to identify in each case, this work highlights that the transferability of water balance adjustments made during calibration can be poor, with potentially huge impacts in the case of studies in non-stationary conditions.
... This approach proved efficient for such parsimonious models compared to more complex search algorithms (Edijatno et al., 1999;Mathevet, 2005). The parameters from Cequeau were optimised using a more complex procedure developed by Le Moine (2009), which combines the multi-objective evolutionary annealingsimplex (MEAS) algorithm proposed by Efstratiadis and Koutsoyiannis (2005) and the multi-objective genetic algorithm, ε-NSGA-II, detailed by Reed and Devireddy (2004). This procedure has proved to be efficient in past applications of the Cequeau model for water resources assessment and dam management in France (Bourqui et al., 2011;François et al., 2013). ...
Article
Full-text available
This paper investigates the robustness of rainfall-runoff models when their parameters are transferred in time. More specifically, we studied their ability to simulate water balance on periods with different hydroclimatic characteristics. The testing procedure consisted in a series of parameter transfers between 10-yr periods and the systematic analysis of mean-volume errors. This procedure was applied to three conceptual models of different structural complexity over 20 mountainous catchments in southern France. The results showed that robustness problems are common. Errors on 10-yr-mean flows were significant for all three models and calibration periods, even when the entire record was used for calibration. Various graphical and numerical tools were used to show strong similarities between the shapes of mean flow biases calculated on a 10-yr-long sliding window when various parameter sets are used. Unexpected behavioural similarities were observed between the three models tested, considering their large differences in structural complexity. While the actual causes for robustness problems in these models remain unclear, this work stresses the limited transferability in time of the water balance adjustments made through parameter optimization. Although absolute differences between simulations obtained with different calibrated parameter sets were sometimes substantial, relative differences in simulated mean flows between time periods remained similar regardless of the calibrated parameter sets.
... This calibration was performed using a hybrid multi-objective algorithm based on the e-NSGA-II (e.g. Reed and Devireddy, 2004) and enriched with some transition schemes (simplex-based operators) taken from the MEAS algorithm (Efstratiadis and Koutsoyiannis, 2005). An initial population was built by sampling parameters independently from their prior distributions (uniform distribution between min and max values, see Section 3.2). ...
Article
Stable isotopes of water (O-18 and H-2) are tracers of ecosystem processes and in particular of water vapour sources. They have been substantially used for evapotranspiration (ET) studies. Data gathered during a series of soil monoliths experiments under fully controlled conditions allowed the partitioning of ET fluxes into soil evaporation (Ev) and plant transpiration (Tr) from isotopic measurements along growth of a tall fescue cover. These data were used to calibrate SiSPAT-Isotope, a 1D Soil-Vegetation-Atmosphere Transfer (SVAT) model coupled with a module for isotopic transport in the soil and the atmosphere. For this, the soil isotopic module was extended to take into account plant water uptake by roots and the model was modified so that it could be constrained with collected input data (e.g. ET flux). The multi-objective calibration method allowed determining narrowed probability distributions for soil, plant and isotopic parameters of which some are currently debated and/or typically not measured in the field (e.g. kinetic fractionation factor during soil evaporation). Comparisons between simulation results corresponding to the "best compromise" parameter set with data (i.e. soil water pressure and contents, soil temperatures and heat fluxes, soil isotopic compositions, and root extraction depths) were provided to show the consistency of the calibration method. Guidelines were provided for the determination of the isotopic composition of evaporation in the field: we could emphasize the importance of values used for the kinetic fractionation factor and the impact of the heights at which atmospheric variables (air relative humidity and temperature, isotopic composition of atmospheric water vapour) are measured in the field.
Hybrid GA for multiobjective aerodynamic shape optimization, in Genetic Algorithms in Engineering and Computer Science
  • C Poloni
Poloni, C., Hybrid GA for multiobjective aerodynamic shape optimization, in Genetic Algorithms in Engineering and Computer Science, G. Winter, J. Periaux, M. Galan, and P. Cuesta (editors), New York, Wiley, 397-414, 1997.
Article
Full-text available
A hydrological simulation model was developed for conjunctive representation of surface and groundwater processes. It comprises a conceptual soil moisture accounting module, based on an enhanced version of the Thornthwaite model for the soil moisture reservoir, a Darcian multi-cell groundwater flow module and a module for partitioning water abstractions among water resources. The resulting integrated scheme is highly flexible in the choice of time (i.e. monthly to daily) and space scales (catchment scale, aquifer scale). Model calibration involved successive phases of manual and automatic sessions. For the latter, an innovative optimization method called evolutionary annealing-simplex algorithm is devised. The objective function involves weighted goodness-of-fit criteria for multiple variables with different observation periods, as well as penalty terms for restricting unrealistic water storage trends and deviations from observed intermittency of spring flows. Checks of the unmeasured catchment responses through manually changing parameter bounds guided choosing final parameter sets. The model is applied to the particularly complex Boeoticos Kephisos basin, Greece, where it accurately reproduced the main basin response, i.e. the runoff at its outlet, and also other important components. Emphasis is put on the principle of parsimony which resulted in a computationally effective modelling. This is crucial since the model is to be integrated within a stochastic simulation framework.
Chapter
Full-text available
The evolutionary annealing-simplex algorithm is a probabilistic heuristic global optimisation technique that joins ideas from different methodological approaches, enhancing them with some original elements. The main concept is based on a controlled random search scheme, where a generalised downhill simplex methodology is coupled with a simulated annealing procedure. The algorithm combines the robustness of simulated annealing in rugged problems, with the efficiency of hill-climbing methods in simple search spaces. The following-up procedure is based on a simplex-searching scheme. The simplex is reformulated at each generation going either downhill or uphill, according to a probabilistic criterion. In the first case, it moves towards the direction of a candidate local minimum via a generalised Nelder-Mead strategy. In the second case, it expands itself along the uphill direction, in order to escape from the current local minimum. In all possible movements, a combination of deterministic as well as stochastic transition rules is applied. The evolutionary annealing- simplex algorithm was first examined in a variety of typical benchmark functions and then it was applied in two global optimisation problems taken from water resources engineering, the calibration of a hydrological model and the optimisation of a multiple reservoir systems' operation. The algorithm has been proved very reliable in locating the global optimum, requiring reasonable computational effort.
Conference Paper
The Strength Pareto Evolutionary Algorithm (SPEA) is a relatively recent technique for finding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies ,2 SPEA has shown very good performance in comparison to other multiobjective evolutionary algorithms, and therefore it has been a point of reference in various recent investigations? Furthermore, it has been used in different applications. 4 In this paper, an improved version, namely SPEA2, is...
Article
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand, the experimental results indicate a hierarchy of the algorithms under consideration. Furthermore, the emerging effects are evidence that the suggested test functions provide sufficient complexity to compare multiobjective optimizers. Finally, elitism is shown to be an important factor for improving evolutionary multiobjective search.
Article
Evolutionary algorithms (EAs) are often wellsuited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to multiobjective optimization have been developed that are capable of searching for multiple solutions concurrently in a single run. However, the few comparative studies of different methods presented up to now remain mostly qualitative and are often restricted to a few approaches. In this paper, four multiobjective EAs are compared quantitatively where an extended 0/1 knapsack problem is taken as a basis. Furthermore, we introduce a new evolutionary approach to multicriteria optimization, the Strength Pareto EA (SPEA), that combines several features of previous multiobjective EAs in a unique manner. It is characterized by (a) storing nondominated solutions externally in a second, continuously updated population, (b) evaluating an individual's fitness dependent on the number of external nondominated points that domina...