...
Insight is eWater’s multiple-objective optimisation and decision support framework. This framework allows for more efficient evaluation of planning options than the traditional manual trial and error approach that modellers often use. The optimisation tool enables a more thorough examination of potential planning scenarios and the resulting trade-offs between desired outcomes.
...
Insight links a multi-objective optimiser (Deb et al., 2002) to Source’s external interface and optimises Source models by running them up to thousands of many times with different parameter values.
For example, if the requirement is to minimise both costs and adverse environmental impacts, then Insight will search for options which express the trade-offs between these two competing objectives. Each solution has different cost and performance outcomes. Insight does not make any judgements about how important each of the impact statistics are, instead it searches a range of options which have different types of impacts. Insight will only discard an option, ‘A’, if it is clearly inferior to an alternative option, ‘B’. That is, if ‘B’ performs better than ‘A’ on at least one of the statistics and there is no statistic where ‘A’ performs better than ‘B’. At the end of its run, Insight will produce a range of optimal solutions (the Pareto Front). Figure 1 shows an example (after Blackmore et al., 2009).
The optimisation results can be examined via a number of graphical tools to help the planners consider the trade-offs between objectives and the relationship between decisions and objectives.
Figure 1. Example Pareto Front diagram (after Blackmore et al., 2009)
Insight operates at the spatial and temporal scales of Source models. It runs Source models multiple times to search for optimal solutions.
...
The multi-objective optimiser used in Insight was developed by Deb et al. (2002). It was originally adapted for use with Source by eWater CRC with permission.
...
The multi-objective optimiser used in Insight is the Non-dominated Sorting Genetic Algorithm II (NSGA-II) developed by Deb et al. (2002). This is a Multi-Objective Evolutionary Algorithm (MOEA) that is based on the principles of the well known Genetic Algorithm (GA).
...
Details of the derivation of the Non-dominated Sorting Genetic Algorithm II (NSGA-II), including pseudo-code, are available in Deb et al. (2002). NSGA-II is a variant of the well known Genetic Algorithm (GA) and the principles of the GA are discussed in text books (e.g. Loucks and van Beek, 2005).
Key features of NSGA-II are (abridged from Deb et al., 2002):
- A fast non-dominated sorting approach. This is used to find population members in the best, second best, third best, etc., non-domination levels.
- Diversity preservation based on a crowded distance estimation procedure and a crowded comparison operator. This approach does not require any user-defined parameter for maintaining diversity among population members.
A computational algorithm summarised as follows:
Initially create a random parent population, P1 of size N and sort this population using the fast non-dominated sorting approach.
Use binary tournament selection, recombination (crossover) and mutation operators, to create the first offspring population, Q1, of size N.
Noting that elitism is introduced by comparing the current population with previously found non-dominated solutions then the procedure after the initial generation can be summarised by considering the i’th generation:
- Create a combined population Ri = Pi U Qi, where Ri has size 2N, and sort this combined population using the fast non-dominated sorting approach.
- Start assembling a new population Pi+1 of size N. The assembly process begins by including solutions at the best non-dominated level. If the number of these is less than N then they are all included. This process continues with solutions from the second best, etc. levels as long as all the solutions from these levels can be included (i.e. the combined total of these solutions is less than N). For the last level (i.e. the one where not all solutions can be included to make up the numbers to N), the solutions are sorted using the crowded comparison operator to identify the best ones to include in the new population.
- The new population Pi+1 is used for selection, crossover and mutation to create a new offspring population Qi+1 of size N. For selection a binary tournament selection operator is used but the selection criterion is now based on the crowded comparison operator.
...
A single scenario in a Source model could represent a particular system configuration, inflow sequence, demand model, etc. Insight can optimise the decision variable(s) (DVs) over multiple scenarios. The DVs and objective functions are chosen by the modeller.
...