| Literature DB >> 35250256 |
Vivien Lai1, Yuk Feng Huang1, Chai Hoon Koo1, Ali Najah Ahmed2, Ahmed El-Shafie3,4.
Abstract
Reservoir operation optimisation secures benefits, such as optimising energy production while minimising the possibility of flooding, operating costs, and water scarcity, at the lowest possible cost. This paper carries reviews of research on reservoir optimisation models and the consequential challenges of optimally operating reservoir operations. An introductory section is given to the background of reservoir operations and the current concerns on the optimal reservoir operations, for the decision-makers and stakeholders. Next, the review covered the recent ten years (between 2011 and 2021), on the recent research developments in innovation and techniques of reservoir operation optimisation. Further reviews on the conventional techniques that are the traditional methods, linear programming, nonlinear programming, and dynamic programming are discussed. Enhancements to the techniques in improving the drawbacks of the traditional techniques in optimisation of reservoir policies are next explained and evaluated. Recent advances in applying metaheuristics optimisation algorithms beneficial to the reservoir operations are explained, including the advantages and hinderances. A comprehensive tabulated and categorised review according to the classification of reservoir models, evaluation methods, and reservoir systems is given.Entities:
Year: 2022 PMID: 35250256 PMCID: PMC8877748 DOI: 10.1007/s11831-021-09701-8
Source DB: PubMed Journal: Arch Comput Methods Eng ISSN: 1134-3060 Impact factor: 8.171
Research works on reservoir operation models used in past decade from year 2011 to 2021
| Ref./Year | Classification of reservoir model | Problem formulation | Evaluation | Benefits | Reservoir system | ||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| TS | EA-SI | EA | MHA | OF | T | PF | MP | RSP | Irrigation | Hydropower | Ecology | Single | Parallel | Cascade | |
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | |||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||||||
| [ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ✓ | ||||
*EEPANET *E EPANET; *SP Strength Pareto; *SR Stepwise regression (SPSS); * SCE Shuffle Complex Evolution; *CCP Chance-constrained programming
*NN Neural network; *SVM Support vector machine
Fig. 1Classification of the optimisation techniques reviewed
Abbreviations used in this review
| Abbrev | Description | Abbrev | Description | Abbrev | Description |
|---|---|---|---|---|---|
| MO | Multi-Objectives | CCLP | Chance-Constrained Linear Programming | GWO | Grey Wolf Optimisation |
| TS | Traditional Models | MILP | Mixed Integer Linear Programming | LSA | Lion Swarm Algorithm |
| LP | Linear Programming | DDDP | Discrete Differential Dynamic Programming | MFO | Moth-Flame Optimisation |
| NLP | Non-Linear Programming | SDDP | Stochastic Dual Dynamic Programming | IMFO | Improved MFO |
| DP | Dynamic Programming | DC | Decomposition-Coordination | R-IMFO | R-Domination MFO |
| EA | Evolutionary Algorithms | POA | Progressive Optimally Algorithm | CS | Cuckoo Search |
| MHA | Meta-Heuristic Algorithms | MIGA | Interactive Multi-Tiered GA | ICGC | Individual Constraints And Group Constraints |
| GA | Genetic Algorithms | NSGA-II | Non-Dominant Sorting GA II Algorithm | DAP | Dynamic Adaptive Probability |
| GP | Genetic Programming | PMOGA | Parallel Multi-Objective GA | IMOCS | Multi-Objective Cuckoo Search |
| DE | Differential Evolution | A-DEPSO | Adaptive PSO Algorithm | HB-SA | Bat-Swarm Algorithm |
| PSO | Particle Swarm Optimisation | PC-PSO | Passive Congregation PSO | SCA | Sine Cosine Algorithm |
| EA-SI | Evolutionary Algorithms-Swarm Intelligence | CIPSO | Constrained Version PSO | GSA | Gravitational Search Algorithm |
| OF | Objective Functions | PCA | Principal Component Analysis | SCE | Shuffled Complex Evolution |
| T | Constraints | ABC | Artificial Bee Colony | JA | Jaya Algorithm |
| PF | Penalty Functions | SA | Shark Algorithm | CRO | Coral Reefs Algorithm |
| RSP | Reservoir System Policies | NN | Neural Networks | CSS | Charged System Search |
| MP | Model Performance | ANFIS | Adaptive Neuro Fuzzy Inference Systems | SLP | Stochastic Linear Programming |
| RMSE | Root Mean Square Error | GWO | Grey Wolf Optimisation | IMFO | Improved Month Flame |
| ISO | Implicit Stochastic Optimisation | LSA | Lion Swarm Algorithm | FS | Feature Selection |
| ESO | Explicit Stochastic Optimisation | MFO | Moth-Flame Optimisation |
Fig. 2Chart summarising the number of papers in the year from Table 1
Fig. 3a Classification of reservoir model b Categories of Problem Formulation c Categories of Evaluation d Benefits e Categories of Reservoir system
Fig. 4Simple flow charts of the GA and DE
Fig. 5Conceptual flow of the SVM-CIPSO1 and SVM-CIPSO2 hybrid reservoir models
Fig. 6Flow of the PSO model reservoir optimisation
Fig. 7General concept of reservoir optimisation operation and the flow of reservoir models with MHA
Overview of Algorithms discussed in above-mentioned research works
| Group | Name | Year | Type | Large Scale | Level of Difficulty |
|---|---|---|---|---|---|
| Evolutionary | Differential Evolution | 1997 | Weak | No | Easy |
| Genetic Programming | 1964 | Weak | No | Easy | |
| Bee-inspired | 2007 | Strong | No | Easy | |
| Firefly-Based | 2010 | Strong | No | Medium | |
| Bat-algorithm | 2010 | Weak | No | Easy | |
| Swarm Intelligence | Shark algorithm | 2016 | Best | Yes | Easy |
| Lion optimiser algorithm | 2015 | Strong | Yes | Medium | |
| Grey Wolf Optimiser | 2014 | Best | Yes | Easy | |
| PSO | 1995 | Weak | Yes | Hard | |
| Swarm Intelligence | Moth-flame algorithm | 2015 | Strong | No | Easy |
| Cuckoo Search Algorithm | 2009 | Weak | Yes | Medium |
Merits and demerits of the overview algorithms in above-mentioned research works
| Algorithm | Advantages | Disadvantages |
|---|---|---|
| GA | It is simple to implement. It can handle wide range of objectives and constraints in nonlinear or discontinuous. It can be used on its own to solve a given problem. It is not reliant on any other algorithm or heuristic | It has no guarantee in global maxima be identified. It easily trapped in local maxima. Losing population density, thus premature convergence seldom occurs. It lacks standard termination criteria. It can be time consuming due to the large number of variables involved |
| DE | It can converge to the global minimum It is good at exploration and diversification. It has ability deal with unimodal, and multimodal | It has unstable convergence rate It quickly falls into the local optimum |
| PSO | It is simple calculation. Because of its quick response, it is ideal for dynamic applications | Losing population density, thus premature convergence seldom occurs |
| ABC | It is flexible and few parameters tuning | Less parameters tuning required, causes the accuracy is diminished |
| Ant-colony | It is inherently parallel, as the solutions can be independent and simultaneously It avoids early premature convergence | It guarantees the convergence aspect, however, the time is undefined |