Applying a real‐coded multi‐population genetic algorithm to multi‐reservoir operation

The primary objective of this study is to propose a real‐coded hypercubic distributed genetic algorithm (HDGA) for optimizing reservoir operation system. A conventional genetic algorithm (GA) is often trapped into local optimums during the optimization procedure. To prevent premature convergence and to obtain near‐global optimal solutions, the HDGA is designed to have various subpopulations that are processed using separate and parallel GAs. The hypercubic topology with a small diameter spreads good solutions rapidly throughout all of the subpopulations, and a migration mechanism, which exchanges chromosomes among the subpopulations, exchanges information during the joint optimization to maintain diversity and thus avoid a systematic premature convergence toward a single local optimum. Three genetic operators, i.e. linear ranking selection, blend‐α crossover and Gaussian mutation, are applied to search for the optimal reservoir releases. First, a benchmark problem, the four‐reservoir operation system, is considered to investigate the applicability and effectiveness of the proposed approach. The results show that the known global optimal solution can be effectively and stably achieved by the HDGA. The HDGA is then applied in the planning of a multi‐reservoir system in northern Taiwan, considering a water reservoir development scenario to the year 2021. The results searched by an HDGA minimize the water deficit of this reservoir system and provide much better performance than the conventional GA in terms of obtaining lower values of the objective function and avoiding local optimal solutions. Copyright © 2006 John Wiley & Sons, Ltd.     

A diversified multiobjective GA for optimizing reservoir rule curves

The paper develops an efficient macro-evolutionary multiobjective genetic algorithm (MMGA) for optimizing the rule curves of a multi-purpose reservoir system in Taiwan. Macro-evolution is a new kind of high-level species evolution that can avoid premature convergence that may arise during the selection process of conventional GAs. MMGA enriches the capabilities of GA to handle multiobjective problems by diversifying the solution set. Simulation results using a benchmark test problem indicate that the proposed MMGA yields better-spread solutions and converges closer to the true Pareto frontier than the nondominated sorting genetic algorithm-II (NSGA-II). When applied to a real case study, MMGA is able to generate uniformly spread solutions for a two-objective problem involving water supply and hydropower generation. Results of this work indicate that the proposed MMGA is highly competitive and provides a viable alternative to solve multiobjective optimization problems for water resources planning and management.     

Stochastic differential dynamic programming for multi-reservoir system control

: As with all dynamic programming formulations, differential dynamic programming (DDP) successfully exploits the sequential decision structure of multi-reservoir optimization problems, overcomes difficulties with the nonconvexity of energy production functions for hydropower systems, and provides optimal feedback release policies. DDP is particularly well suited to optimizing large-scale multi-reservoir systems due to its relative insensitivity to state-space dimensionality. This advantage of DDP encourages expansion of the state vector to include additional multi-lag hydrologic information and/or future inflow forecasts in developing optimal reservoir release policies. Unfortunately, attempts at extending DDP to the stochastic case have not been entirely successful. A modified stochastic DDP algorithm is presented which overcomes difficulties in previous formulations. Application of the algorithm to a four-reservoir hydropower system demonstrates its capabilities as an efficient approach to solving stochastic multi-reservoir optimization problems. The algorithm is also applied to a single reservoir problem with inclusion of multi-lag hydrologic information in the state vector. Results provide evidence of significant benefits in direct inclusion of expanded hydrologic state information in optimal feedback release policies.     

Stochastic differential dynamic programming for multi-reservoir system control

: As with all dynamic programming formulations, differential dynamic programming (DDP) successfully exploits the sequential decision structure of multi-reservoir optimization problems, overcomes difficulties with the nonconvexity of energy production functions for hydropower systems, and provides optimal feedback release policies. DDP is particularly well suited to optimizing large-scale multi-reservoir systems due to its relative insensitivity to state-space dimensionality. This advantage of DDP encourages expansion of the state vector to include additional multi-lag hydrologic information and/or future inflow forecasts in developing optimal reservoir release policies. Unfortunately, attempts at extending DDP to the stochastic case have not been entirely successful. A modified stochastic DDP algorithm is presented which overcomes difficulties in previous formulations. Application of the algorithm to a four-reservoir hydropower system demonstrates its capabilities as an efficient approach to solving stochastic multi-reservoir optimization problems. The algorithm is also applied to a single reservoir problem with inclusion of multi-lag hydrologic information in the state vector. Results provide evidence of significant benefits in direct inclusion of expanded hydrologic state information in optimal feedback release policies.     

Improving the efficiency of ant algorithms using adaptive refinement: Application to storm water network design

The ant algorithm is a new evolutionary optimization method proposed for the solution of discrete combinatorial optimization problems. Many engineering optimization problems involve decision variables of continuous nature. Application of the ant algorithm to the optimization of these continuous problems requires discretization of the continuous search space, thereby reducing the underlying continuous problem to a discrete optimization problem. The level of discretization of the continuous search space, however, could present some problems. Generally, coarse discretization of the continuous design variables could adversely affect the quality of the final solution while finer discretization would enlarge the scale of the problem leading to higher computation cost and, occasionally, to low quality solutions. An adaptive refinement procedure is introduced in this paper as a remedy for the problem just outlined. The method is based on the idea of limiting the originally wide search space to a smaller one once a locally converged solution is obtained. The smaller search space is designed to contain the locally optimum solution at its center. The resulting search space is discretized and a completely new search is conducted to find a better solution. The procedure is continued until no improvement can be made by further refinement. The method is applied to a benchmark problem in storm water network design discipline and the results are compared with those of existing methods. The method is shown to be very effective and efficient regarding the optimality of the solution, and the convergence characteristics of the resulting ant algorithm. Furthermore, the method proves itself capable of finding an optimal, or near-optimal solution, independent of the discretization level and the size of the colony used.     

Using a hybrid genetic algorithm–simulated annealing algorithm for fuzzy programming of reservoir operation

We present a novel approach for optimizing reservoir operation through fuzzy programming and a hybrid evolution algorithm, i.e. genetic algorithm (GA) with simulated annealing (SA). In the analysis, objectives and constraints of reservoir operation are transformed by fuzzy programming for searching the optimal degree of satisfaction. In the hybrid search procedure, the GA provides a global search and the SA algorithm provides local search. This approach was investigated to search the optimizing operation scheme of Shihmen Reservoir in Taiwan. Monthly inflow data for three years reflecting different hydrological conditions and a consecutive 10‐year period were used. Comparisons were made with the existing M‐5 reservoir operation rules. The results demonstrate that: (1) fuzzy programming could effectively formulate the reservoir operation scheme into degree of satisfaction α among the users and constraints; (2) the hybrid GA‐SA performed much better than the current M‐5 operating rules. Analysis also found the hybrid GA‐SA conducts parallel analyses that increase the probability of finding an optimal solution while reducing computation time for reservoir operation. Copyright © 2007 John Wiley & Sons, Ltd.     

Multi-tier interactive genetic algorithms for the optimization of long-term reservoir operation

Genetic algorithms (GAs) are well known optimization methods. However, complicated systems with high dimensional variables, such as long-term reservoir operation, usually prevent the methods from reaching optimal solutions. This study proposes a multi-tier interactive genetic algorithm (MIGA) which decomposes a complicated system (long series) into several small-scale sub-systems (sub-series) with GA applied to each sub-system and the multi-tier (key) information mutually interacts among individual sub-systems to find the optimal solution of long-term reservoir operation. To retain the integrity of the original system, over the multi-tier architecture, an operation strategy is designed to concatenate the primary tier and the allocation tiers by providing key information from the primary tier to the allocation tiers when initializing populations in each sub-system. The Shihmen Reservoir in Taiwan is used as a case study. For comparison, three long-term operation results of a sole GA search and a simulation based on the reservoir rule curves are compared with that of MIGA. The results demonstrate that MIGA is far more efficient than the sole GA and can successfully and efficiently increase the possibility of achieving an optimal solution. The improvement rate of fitness values increases more than 25%, and the computation time dramatically decreases 80% in a 20-year long-term operation case. The MIGA with the flexibility of decomposition strategies proposed in this study can be effectively and suitably used in long-term reservoir operation or systems with similar conditions.     

BFA-CM最优化测井解释方法

最优化测井解释方法能充分利用各种测井资料及地质信息,可以有效地评价复杂岩性油气藏.优化算法的选择是最优化测井解释方法的关键,影响着测井解释结果的准确性.细菌觅食算法(BFA)是新兴的一种智能优化算法,具有较强的全局搜索能力,但在寻优后期收敛速度较慢.复合形算法(CM)局部搜索能力极强,将其与BFA算法相结合构成BFA-CM混合算法,既提高了搜索精度又提高了搜索效率.利用BFA-CM最优化测井解释方法对苏里格致密砂岩储层实际资料进行了处理,计算结果与岩心及薄片分析资料吻合得很好.     

A parallel dynamic programming algorithm for multi-reservoir system optimization

This paper develops a parallel dynamic programming algorithm to optimize the joint operation of a multi-reservoir system. First, a multi-dimensional dynamic programming (DP) model is formulated for a multi-reservoir system. Second, the DP algorithm is parallelized using a peer-to-peer parallel paradigm. The parallelization is based on the distributed memory architecture and the message passing interface (MPI) protocol. We consider both the distributed computing and distributed computer memory in the parallelization. The parallel paradigm aims at reducing the computation time as well as alleviating the computer memory requirement associated with running a multi-dimensional DP model. Next, we test the parallel DP algorithm on the classic, benchmark four-reservoir problem on a high-performance computing (HPC) system with up to 350 cores. Results indicate that the parallel DP algorithm exhibits good performance in parallel efficiency; the parallel DP algorithm is scalable and will not be restricted by the number of cores. Finally, the parallel DP algorithm is applied to a real-world, five-reservoir system in China. The results demonstrate the parallel efficiency and practical utility of the proposed methodology.     

A Hybridized GA with LP‐LP Model for the Management of Confined Groundwater

A novel hybrid methodology is introduced in this paper for the optimal solution of the groundwater management problem. The problem to be addressed is the optimal determination and operation of a predefined number of wells out of a priori known set of potential wells with fixed locations to minimize the pumping cost of utilizing a two‐dimensional (2D) confined aquifer under steady‐state flow condition. The solution to this problem should satisfy a downstream demand, a lower/upper bound on the pumping rates, and a lower/upper bound on the water level drawdown in the wells. The problem is solved by hybridizing a genetic algorithm (GA) which suggests the candidate configurations for the operational wells and a hybrid linear programming (LP‐LP) approach with the duty of finding the optimal operation policy of the candidate wells defined by their pumping rates. Two different codings, namely binary and integer codings, are used for the GA and their performances are compared. The ability of the proposed hybrid method is tested against two benchmark problems: (1) finding the optimal configuration and pumping rates of a predefined number of wells out of potential wells and (2) finding the optimal number, configuration and pumping rates of the operating wells out of potential wells and the results are presented and compared with the available ones showing superior efficiency and effectiveness of the proposed method.     

Solving nonlinear water management models using a combined genetic algorithm and linear programming approach

Gradient-based nonlinear programming (NLP) methods can solve problems with smooth nonlinear objectives and constraints. However, in large and highly nonlinear models, these algorithms can fail to find feasible solutions, or converge to local solutions which are not global. Evolutionary search procedures in general, and genetic algorithms (GAs) specifically, are less susceptible to the presence of local solutions. However, they often exhibit slow convergence, especially when there are many variables, and have problems finding feasible solutions in constrained problems with “narrow” feasible regions. In this paper, we describe strategies for solving large nonlinear water resources models management, which combine GAs with linear programming. The key idea is to identify a set of complicating variables in the model which, when fixed, render the problem linear in the remaining variables. The complicating variables are then varied by a GA. This GA&LP approach is applied to two nonlinear models: a reservoir operation model with nonlinear hydropower generation equations and nonlinear reservoir topologic equations, and a long-term dynamic river basin planning model with a large number of nonlinear relationships. For smaller instances of the reservoir model, the CONOPT2 nonlinear solver is more accurate and faster, but for larger instances, the GA&LP approach finds solutions with significantly better objective values. The multiperiod river basin model is much too large to be solved in its entirety. The complicating variables are chosen here so that, when they are fixed, each period's model is linear, and these models can be solved sequentially. This approach allows sufficient model detail to be retained so that long-term sustainability issues can be explored.     

基于GA-BP理论的储层视裂缝密度地震非线性反演方法

基于GA-BP理论,将自适应遗传算法与人工神经网络技术(BP算法)有机地相结合,形成了一种储层裂缝自适应遗传-神经网络反演方法.这种新的方法是由编码、适应度函数、遗传操作及混合智能学习等组成,即在成像测井裂缝密度数据约束下,通过对目标问题进行编码(称染色体),然后对染色体进行选择、交叉和变异等遗传操作,使染色体不断进化,从而快速获得全局最优解.在反演执行过程中,利用地震数据和成像测井裂缝密度数据之间的非线性映射关系建立训练样本,将GA算法与BP算法有机地结合,优化三层前向网络参数;或将GA与ANFIS相结合,优化ANFIS网络参数.并采用GA算法与TS算法(Tabu Search)相结合的自适应混合学习算法,该学习算法自始至终将GA和BP两种算法按一定的概率比例进行,其概率自适应变化,以达到混合算法的均衡.这种混合算法提高了网络的收敛速度和精度.我们分别利用两个研究地区的6井和1井成像测井裂缝密度数据与地震数据之间的非线性映射关系建立训练样本,对过这两口井的测线的地震数据进行反演,获得了视裂缝密度剖面,视裂缝密度剖面上裂缝分布特征符合沉积相分布特征和岩石力学性质的变化特征.这种视裂缝密度剖面含有储层裂缝的定量信息,其误差可为油气勘探开发实际要求所允许.因此,这种新的方法优于只能作裂缝定性分析的常规裂缝地震预测方法,具有广阔的应用前景.     

Optimal operation of reservoirs for downstream water quality control using linked simulation optimization

A methodology is developed for optimal operation of reservoirs to control water quality requirements at downstream locations. The physicochemical processes involved are incorporated using a numerical simulation model. This simulation model is then linked externally with an optimization algorithm. This linked simulation–optimization‐based methodology is used to obtain optimal reservoir operation policy. An elitist genetic algorithm is used as the optimization algorithm. This elitist‐genetic‐algorithm‐based linked simulation–optimization model is capable of evolving short‐term optimal operation strategies for controlling water quality downstream of a reservoir. The performance of the methodology developed is evaluated for an illustrative example problem. Different plausible scenarios of management are considered. The operation policies obtained are tested by simulating the resulting pollutant concentrations downstream of the reservoir. These performance evaluations consider various scenarios of inflow, permissible concentration limits, and a number of management periods. These evaluations establish the potential applicability of the developed methodology for optimal control of water quality downstream of a reservoir. Copyright © 2007 John Wiley & Sons, Ltd.     

Optimizing the reservoir operating rule curves by genetic algorithms

Genetic algorithms, founded upon the principle of evolution, are applicable to many optimization problems, especially popular for solving parameter optimization problems. Reservoir operating rule curves are the most common way for guiding and managing the reservoir operation. These rule curves traditionally are derived through intensive simulation techniques. The main aim of this study is to investigate the efficiency and effectiveness of two genetic algorithms (GAs), i.e., binary coded and real coded, to derive multipurpose reservoir operating rule curves. The curves are assumed to be piecewise linear functions where the coordinates of their inflection points are the unknowns and we want to optimize system performance. The applicability and effectiveness of the proposed methods are tested on the operation of the Shih‐Men reservoir in Taiwan. The current M‐5 operating curves of the Shih‐Men reservoir are also evaluated. The results show that the GAs provide an adequate, effective and robust way for searching the rule curves. Both sets of operating rule curves obtained from GAs have better performance, in terms of water release deficit and hydropower, than the current M‐5 operating rule curves, while the real‐coded GA is more efficient than the binary‐coded GA. Copyright © 2005 John Wiley & Sons, Ltd.     

Evaluation of global optimization algorithms for parameter calibration of a computationally intensive hydrologic model

With the popularity of complex hydrologic models, the time taken to run these models is increasing substantially. Comparing and evaluating the efficacy of different optimization algorithms for calibrating computationally intensive hydrologic models is becoming a nontrivial issue. In this study, five global optimization algorithms (genetic algorithms, shuffled complex evolution, particle swarm optimization, differential evolution, and artificial immune system) were tested for automatic parameter calibration of a complex hydrologic model, Soil and Water Assessment Tool (SWAT), in four watersheds. The results show that genetic algorithms (GA) outperform the other four algorithms given model evaluation numbers larger than 2000, while particle swarm optimization (PSO) can obtain better parameter solutions than other algorithms given fewer number of model runs (less than 2000). Given limited computational time, the PSO algorithm is preferred, while GA should be chosen given plenty of computational resources. When applying GA and PSO for parameter optimization of SWAT, small population size should be chosen. Copyright © 2008 John Wiley & Sons, Ltd.     

Multi‐objective particle swarm optimization for generating optimal trade‐offs in reservoir operation

A multi‐objective particle swarm optimization (MOPSO) approach is presented for generating Pareto‐optimal solutions for reservoir operation problems. This method is developed by integrating Pareto dominance principles into particle swarm optimization (PSO) algorithm. In addition, a variable size external repository and an efficient elitist‐mutation (EM) operator are introduced. The proposed EM‐MOPSO approach is first tested for few test problems taken from the literature and evaluated with standard performance measures. It is found that the EM‐MOPSO yields efficient solutions in terms of giving a wide spread of solutions with good convergence to true Pareto optimal solutions. On achieving good results for test cases, the approach was applied to a case study of multi‐objective reservoir operation problem, namely the Bhadra reservoir system in India. The solutions of EM‐MOPSOs yield a trade‐off curve/surface, identifying a set of alternatives that define optimal solutions to the problem. Finally, to facilitate easy implementation for the reservoir operator, a simple but effective decision‐making approach was presented. The results obtained show that the proposed approach is a viable alternative to solve multi‐objective water resources and hydrology problems. Copyright © 2007 John Wiley & Sons, Ltd.     

MULTIOBJECTIVE PROGRAMMING MODEL FOR SEDIMENT SLUICING AND POWER GENERATION IN RESERVOIR OPERATION

I. INTRODUCTIONReservoir operation study in planning stage is an important task for the water resourcesdevelopment design. In the past. much attention has been paid to making the most ot' floodcontol. power generation, navigation. and water supply, but less to the unfavorable effectsdue to reservoir sedimentation. According to the survey of 425 reservoirs in Japan with a total storage capacity of 13.2 billion mJ a volume of 825 million m3 of sediment was depositedby the end of 1979. This…     

A combined simulation–genetic algorithm optimization model for optimal rule curves of a reservoir: a case study of the Nam Oon Irrigation Project,Thailand

A combined simulation–genetic algorithm (GA) optimization model is developed to determine optimal reservoir operational rule curves of the Nam Oon Reservoir and Irrigation Project in Thailand. The GA and simulation models operate in parallel over time with interactions through their solution procedure. A GA is selected as an optimization model, instead of traditional techniques, owing to its powerful and robust performance and simplicity in combining with a simulation technique. A GA is different from conventional optimization techniques in the way that it uses objective function information and does not require its derivatives, whereas in real‐world optimization problems the search space may include discontinuities and may often include a number of sub‐optimum peaks. This may cause difficulties for calculus‐based and enumerative schemes, but not in a GA. The simulation model is run to determine the net system benefit associated with state and control variables. The combined simulation–GA model is applied to determine the optimal upper and lower rule curves on a monthly basis for the Nam Oon Reservoir, Thailand. The objective function is maximum net system benefit subject to given constraints for three scenarios of cultivated areas. The monthly release is calculated by the simulation model in accordance with the given release policy, which depends on water demand. The optimal upper and lower rule curves are compared with the results of the HEC‐3 model (Reservoir System Analysis for Conservation model) calculated by the Royal Irrigation Department, Thailand, and those obtained using the standard operating policy. It was found that the optimal rule curves yield the maximum benefit and minimum damages caused by floods and water shortages. The combined simulation–GA model shows an excellent performance in terms of its optimization results and efficient computation. Copyright © 2007 John Wiley & Sons, Ltd.     

Probabilistic reservoir operation using Bayesian stochastic model and support vector machine

Available water resources are often not sufficient or too polluted to satisfy the needs of all water users. Therefore, allocating water to meet water demands with better quality is a major challenge in reservoir operation. In this paper, a methodology to develop operating strategies for water release from a reservoir with acceptable quality and quantity is presented. The proposed model includes a genetic algorithm (GA)-based optimization model linked with a reservoir water quality simulation model. The objective function of the optimization model is based on the Nash bargaining theory to maximize the reliability of supplying the downstream demands with acceptable quality, maintaining a high reservoir storage level, and preventing quality degradation of the reservoir. In order to reduce the run time of the GA-based optimization model, the main optimization model is divided into a stochastic and a deterministic optimization model for reservoir operation considering water quality issues.The operating policies resulted from the reservoir operation model with the water quantity objective are used to determine the released water ranges (permissible lower and upper bounds of release policies) during the planning horizon. Then, certain values of release and the optimal releases from each reservoir outlet are determined utilizing the optimization model with water quality objectives. The support vector machine (SVM) model is used to generate the operating rules for the selective withdrawal from the reservoir for real-time operation. The results show that the SVM model can be effectively used in determining water release from the reservoir. Finally, the copula function was used to estimate the joint probability of supplying the water demand with desirable quality as an evaluation index of the system reliability. The proposed method was applied to the Satarkhan reservoir in the north-western part of Iran. The results of the proposed models are compared with the alternative models. The results show that the proposed models could be used as effective tools in reservoir operation.     

An application of Karmarkar's interior-point linear programming algorithm for multi-reservoir operations optimization

Optimization of multi-reservoir systems operations is typically a very large scale optimization problem. The following are the three types of optimization problems solved using linear programming (LP): (i) deterministic optimization for multiple periods involving fine stage intervals, for example, from an hour to a week (ii) implicit stochastic optimization using multiple years of inflow data, and (iii) explicit stochastic optimization using probability distributions of inflow data. Until recently, the revised simplex method has been the most efficient solution method available for solving large scale LP problems. In this paper, we show that an implementation of the Karmarkar's interior-point LP algorithm with a newly developed stopping criterion solves optimization problems of large multi-reservoir operations more efficiently than the simplex method. For example, using a Micro VAX II minicomputer, a 40 year, monthly stage, two-reservoir system optimization problem is solved 7.8 times faster than the advanced simplex code in MINOS 5.0. The advantage of this method is expected to be greater as the size of the problem grows from two reservoirs to multiples of reservoirs. This paper presents the details of the implementation and testing and in addition, some other features of the Karmarkar's algorithm which makes it a valuable optimization tool are illuminated.