Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization

Over the last decade, evolutionary and meta-heuristic algorithms have been extensively used as search and optimization tools in various problem domains, including science, commerce, and engineering. Their broad applicability, ease of use, and global perspective may be considered as the primary reason for their success. The honey-bees mating process may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of real honey-bees mating. In this paper, the honey-bees mating optimization algorithm (HBMO) is presented and tested with few benchmark examples consisting of highly non-linear constrained and/or unconstrained real-valued mathematical models. The performance of the algorithm is quite comparable with the results of the well-developed genetic algorithm. The HBMO algorithm is also applied to the operation of a single reservoir with 60 periods with the objective of minimizing the total square deviation from target demands. Results obtained are promising and compare well with the results of other well-known heuristic approaches.     

Design-Operation of Multi-Hydropower Reservoirs: HBMO Approach

To illustrate and test the applicability and performance of the innovative honey-bee mating optimization (HBMO) algorithm in highly non-convex hydropower system design and operation, two problems are considered: single reservoir and multi-reservoir. Both hydropower problems are formulated to minimize the total present net cost of the system, while achieving the maximum possible ratio for generated power to installed capacity. The single hydropower reservoir problem is approached by the developed algorithm in 10 different runs. The first feasible solution was generated initially and later improved significantly and solutions converged to a near optimal solution very rapidly. In the application of the proposed algorithm to a five-reservoir hydropower system with 48 periods and a total of 230 decision variables, in early mating flights, the first feasible solution was identified and the results converged to a near optimal solution in later mating flights. In the case of the multi-reservoir problem, an efficient gradient-based nonlinear-programming solver (LINGO 8.0) failed to find a feasible solution and for the single hydropower reservoir design problem it performed much worse than the proposed algorithm.     

Effect of Breakage Level One in Design of Water Distribution Networks

Design of water distribution networks (WDNs) that do not consider performance criteria would possibly lead to less cost but it could also decrease water pressure reliability in abnormal conditions such as a breakage of pipes of the network. Thus, awareness of the situation of consumption nodes, by considering water pressures and the amount of water that is being supplied, could be an effective source of information for designing high performance WDNs. In this paper, Two-loop and Hanoi networks are selected for least-cost design, considering water pressures and the amount of water supplied on each consumption node under breakage level one, using the honey-bee mating optimization (HBMO) algorithm. In each state of design, a specific pressure is defined as the minimum expected pressure under breakage level one which holds the pressure reliability in the considered range. Also, variations of some criteria such as reliabilities of pressure and demand, vulnerability of the network, and flexibility of the design are analyzed as a tool for choosing the appropriate state of design. Results show that a minor increase in the cost of design could lead to a considerable improvement in reliabilities of pressure and demand under breakage level one.     

Optimal Operation of Hydropower Reservoir Systems Using Weed Optimization Algorithm

The optimal hydropower operation of reservoir systems is known as a complex nonlinear nonconvex optimization problem. This paper presents the application of invasive weed optimization (IWO) algorithm, which is a novel evolutionary algorithm inspired from colonizing weeds, for optimal operation of hydropower reservoir systems. The IWO algorithm is used to optimally solve the hydropower operation problems for both cases of single reservoir and multi reservoir systems, over short, medium and long term operation periods, and the results are compared with the existing results obtained by the two most commonly used evolutionary algorithms, namely, particle swam optimization (PSO) and genetic algorithm (GA). The results show that the IWO is more efficient and effective than PSO and GA for both single reservoir and multi reservoir hydropower operation problems.     

基于改进粒子群算法的水库优化调度研究

对粒子群优化算法易陷入局部最优的缺点作了改进,提出了一种带有扰动项的改进的粒子群优化算法,并将其应用于水电站水库优化调度中。实例计算证明,改进后的粒子群优化算法具有较好的全局搜索能力,能够有效克服陷入局部最优的缺点,是水库优化调度比较有效的方法。     

粒子群算法在水电站日优化调度中的应用

针对传统的动态规划方法求解水库优化调度问题存在的“维数灾”问题,给出一种全局随机优化算法[1]——粒子群优化算法并应用于水库日优化调度问题中。相对于动态规划,该算法原理简单,易编程,占用计算机内存少,能以较快的速度收敛到全局最优解,从而为分时电价环境下的水电站日优化调度问题提供了一种有效的解决办法。     

SAPSO算法在梯级水电站日优化调度中的应用

针对传统的动态规划方法求解水库优化调度阋题存在的"维数灾"问题,提出一种全局随机优化算法[1]--SAPSO算法及其在水库日优化调度问题中的应用.相对于动态规划,该算法原理简单,易编程实现,占用计算机内存少,能以较快的速度收敛到全局最优解,从而为分时电价环境下的水电站日优化调度问题提供了一种有效的解决办法.     

改进粒子群算法求解水火电系统短期负荷分配问题

粒子群优化（PSO）算法是一种基于群体智能的启发式搜索方法，应用领域很广。文中将PSO算法用于求解水火电系统短期负荷的经济分配，属于高维、强约束工程问题。分析了算法参数设置对解的影响，发现算法的局部开发能力和粒子的多样性是影响解的优劣的关键因素;提出多子群辅助的PSO算法，兼顾了对解空间的全局搜索和局部开发。实际算例证明，改进的算法是有效的。     

差分进化算法在马斯京根模型参数优选中的应用

针对马斯京根模型参数最优估计中求解复杂、精度差等问题,结合绝对残差绝对值之和最小准则,提出应用差分进化算法（Differential Evolution Algorithm）直接优选模型参数。同其它算法相比,实例分析表明该算法具有较强的全局搜索能力和较高的计算精度。为更好地优选马斯京根模型参数提供了一种更为有效的新方法。     

Reservoir Optimization in Water Resources: a Review

This paper reviews current optimization technique developed to solve reservoir operation problems in water resources. The application of conventional, especially evolutionary computation, combination of simulation-optimization and multi objectives optimization in reservoir operation will be discussed and investigated. Furthermore, new optimization algorithm from other applications will be presented by focusing on Artificial Bee Colony (ABC) and Gravitational Search Algorithm (GSA) as alternative methods that can be explored by researchers in water resources field. Finally this paper looks into the challenges and issues of climate change in reservoir optimization.     

Layout and Component Size Optimization of Sewer Network Using Spanning Tree and Modified PSO Algorithm

In the paper, a new method is introduced for optimally solve the problem of the layout and component size determination of sewer network. Simultaneously Layout and component size optimization of sewer network problem consists of many hydraulic constraints which are generally nonlinear and discrete; which creates a challenge even to the modern heuristic search methods. An algorithm generation of a predefined number of spanning trees is introduced to generate a predefined number of sewer layouts of a base sewer network in order of increasing length. These generated layouts are sorted in ascending order of total cumulative flow and sorted layouts are individually optimized for sewer components sizing. It has been found that the optimal sewer layout for total system optimization is one where the total cumulative flow has the minimal value. The modified particle swarm optimization (MPSO) algorithm has been used to optimally determine the component sizes of the selected layouts. The proposed method is applied to the Sudarshanpura sewer network (situated in Jaipur, India) design problem. The results are presented for optimal cost vs cumulative flow of the layouts. Further results of MPSO has been compared with the original PSO algorithm.     

混沌粒子群优化算法在马斯京根模型参数优化中的应用

针对目前马斯京根模型参数率定中存在的求解复杂、精度不高等问题,本文将混沌搜索机制引入粒子群优化算法中,构建混沌粒子群优化算法对马斯京根模型参数进行率定。这种方法利用混沌运动的遍历性,改善了粒子群优化算法的全局寻优能力,避免算法陷入局部极值,使得粒子群体的进化速度加快,提高了算法的收敛速度和精度。通过实例应用表明,混沌粒子群优化算法可以有效地估算出马斯京根模型参数,优化效果明显优于粒子群优化算法及试错法,因此该算法具有很好的实用性。     

Optimization of Hydropower Reservoir Using Evolutionary Algorithms Coupled with Chaos

Over the past decade, several conventional optimization techniques had been developed for the optimization of complex water resources system. To overcome some of the drawbacks of conventional techniques, soft computing techniques were developed based on the principles of natural evolution. The major difference between the conventional optimization techniques and soft computing is that in the former case, the optimal solution is derived where as in the soft computing techniques, it is searched from a randomly generated population of possible solutions. The results of the evolutionary algorithm mainly depend on the randomly generated initial population that is arrived based on the probabilistic theory. Recent research findings proved that most of the water resources variables exhibit chaotic behavior, which is a projection depends upon the initial condition. In the present study, the chaos algorithm is coupled with evolutionary optimization algorithms such as genetic algorithm (GA) and differential evolution (DE) algorithm for generating the initial population and applied for maximizing the hydropower production from a reservoir. The results are then compared with conventional genetic algorithm and differential evolution algorithm. The results show that the chaotic differential evolution (CDE) algorithm performs better than other techniques in terms of total annual power production. This study also shows that the chaos algorithm has enriched the search of general optimization algorithm and thus may be used for optimizing complex non-linear water resources systems.     

Large Scale Reservoirs System Operation Optimization: the Interior Search Algorithm (ISA) Approach

Reservoirs are built to provide a powerful tool to control and manage surface water resources in order to cover inconsistency between water resources and demands. Due to finite available water and the increasing demands for water especially in arid and semi-arid regions like Iran, reservoirs must be optimally operated in order to use water in the most efficient way. This study applies the Interior Search Algorithm (ISA) to solve large scale reservoirs system operation optimization problems. The ISA is a meta-heuristic algorithm inspired from a systematic methodology of architecture process and mirror work utilized by Persian designers for decoration. Unlike other meta-heuristic algorithms, the ISA just have one parameter to tune which is a great advantage. In this study the parameter of the ISA tuned automatically using a linear equation. A real-world one-reservoir operation problem (i.e. Karun-4) and two large scale benchmark problems (i.e. four-reservoir and ten-reservoir operation problem) were employed to show the effectiveness of the ISA. The results shows the high ability of the ISA to solve reservoirs system operation problems as it achieved solutions 99.97, 99.99 and 99.95 % of global optimum for Karun-4 reservoir, four-reservoir and ten-reservoir system operation problems, respectively. These results are the best results reported so far in the studied problems. Comparing results of the ISA with those of non-linear programming (NLP), linear programming (LP), genetic algorithm (GA) and other meta-heuristic algorithms indicates fast convergence to global optimum. Considering the results, it can be stated that the ISA is a powerful tool to optimize complex large scale reservoir system operation problems.     

边坡临界滑动面搜索的奖惩蚁群算法研究

边坡滑动面搜索是边坡稳定计算中一项关键的问题，其实质为安全系数最小的滑动路径的搜索问题，采用路径搜索算法蚁群算法是目前研究的热点。为了克服传统蚁群算法效率低、效果差的缺点，通过引入奖惩策略，加快较优路径和普通路径上信息素的差异，分化各条路径上的信息素，从而提出了一种奖惩蚁群算法。通过把边坡滑动面搜索问题的离散模型化，采用奖惩蚁群算法解决滑动面搜索问题，提出了一种临界滑动面搜索的新方法。通过一个简单边坡和复杂边坡的典型算例计算及一个大坝边坡的工程的应用实例应用，验证了新滑动面搜索算法的有效性及其高效性。结果表明，无论是对简单边坡还是复杂边坡，本文算法都可以能以更快的速度搜索得到效果更好的临界滑动面，且工程应用效果良好。     

基于C-PSO算法的混凝土面板堆石坝断面优化设计

针对基本粒子群算法(PSO)寻优过程中存在收敛速度慢、易陷入局部最优和计算精度差等缺陷,采用分簇思想和碰撞策略,提出了一种改进的粒子群算法(C-PSO),在该算法中,粒子通过分簇并行搜索,有效避免了群体过度集中现象,极大地增强粒子全局搜索能力。将C-PSO算法应用于混凝土面板堆石坝断面优化设计中,优化结果表明,该算法对解决复杂的多变量多约束非线性问题具有较好的适应性,为复杂的混凝土面板堆石坝断面优化设计问题提供了新的解决思路。     

Surrogate-Based Stochastic Multiobjective Optimization for Coastal Aquifer Management under Parameter Uncertainty

Linked simulation-optimization (S/O) approaches have been extensively used as tools in coastal aquifer management. However, parameter uncertainties in seawater intrusion (SI) simulation models often undermine the reliability of the derived solutions. In this study, a stochastic S/O framework is presented and applied to a real-world case of the Longkou coastal aquifer in China. The three conflicting objectives of maximizing the total pumping rate, minimizing the total injection rate, and minimizing the solute mass increase are considered in the optimization model. The uncertain parameters are contained in both the constraints and the objective functions. A multiple realization approach is utilized to address the uncertainty in the model parameters, and a new multiobjective evolutionary algorithm (EN-NSGA2) is proposed to solve the optimization model. EN-NSGA2 overcomes some inherent limitations in the traditional nondominated sorting genetic algorithm-II (NSGA-II) by introducing information entropy theory. The comparison results indicate that EN-NSGA2 can effectively ameliorate the diversity in Pareto-optimal solutions. For the computational challenge in the stochastic S/O process, a surrogate model based on the multigene genetic programming (MGGP) method is developed to substitute for the numerical simulation model. The results show that the MGGP surrogate model can tremendously reduce the computational burden while ensuring an acceptable level of accuracy.

     

Reservoir Management Using a Network Flow Optimization Model Considering Quadratic Convex Cost Functions on Arcs

The allocation of water resources between different users is a hard task for water managers because they must deal with conflicting objectives. The main objective is to obtain the most accurate distribution of the resource and the associated circulating flows through the system. This induces the need for a river basin optimization model that provides optimized results. This article presents a network flow optimization model to solve the water allocation problem in water resource systems. Managing a water system consists in providing water in the right proportion, at the right place and at the right time. Time expanded network allows to take into consideration the temporal dimension in the decision making. Since linear cost functions on arcs present many limitations and are not realistic, quadratic convex cost functions on arcs are considered here. The optimization algorithm developed herein extend the cycle canceling algorithm developed for linear cost functions. The methodology is applied to manage the three reservoirs of La Haute-Vilaine’s watershed located in the north west of France to protect a three vulnerable areas from flooding. The results obtained with the algorithm are compared to a reference scenario which consists in considering reservoirs transparent. The results show that the algorithm succeeds in managing the reservoir releases efficiently and keeps the flow rates below the vigilance flow in the vulnerable areas.     

飞蛾火焰优化算法在承压含水层参数反演中的应用

通过10个典型低维函数对一种新型群体智能仿生算法——飞蛾火焰优化(MFO)算法进行仿真验证,并与粒子群优化(PSO)算法的寻优结果进行对比。以无界井流问题及直线隔水边界附近井流问题的解析解为基础,将MFO算法应用于分析抽水试验数据,进行反演承压含水层参数,并以2个实例对MFO算法进行验证。结果表明:MFO算法在低维函数极值寻优问题上具有较好的收敛精度和全局寻优能力,寻优精度较PSO算法提高了7个数量级以上。MFO算法对2个实例的反演精度较文献改进SA算法等提高了56.5%以上,具有较好的稳健性能、收敛速度和全局寻优能力。利用MFO算法对承压含水层参数进行反演,可获得比相关文献更高的反演精度,不但为精确估计承压含水层参数提供了有效方法,而且拓展了MFO算法在地下水模型参数反演中的应用,具有良好的应用价值和前景。     

Optimization of Reservoir Operation with a New Approach in Evolutionary Computation Using TLBO Algorithm and Jaya Algorithm

Reservoir operation and management are complex engineering problems, due to the stochastic nature of inflow, various demands and as well as tailwater in the downstream. The complexity increases when the number of reservoirs gets increased such as multi-reservoir system or chain system. To obtain optimal operation in such condition become more difficult. It requires powerful optimization algorithm to solve aforesaid problems. Teaching Learning Based Optimization (TLBO) algorithm and Jaya Algorithm (JA) are recently developed advanced optimization techniques a novel approach comparatively simple, easy, and robust. The main advantages of these algorithms are it only requires the common control parameters such as number of iterations and population size. In the present study, three different benchmark problems were evaluated to check the applicability and performance of TLBO and JA in multi-reservoir operation problems. The benchmark problems are the discrete time four-reservoir operation (DFRO), the continuous time four-reservoir operation (CFRO), and the ten-reservoir operation (TRO). The results from the TLBO and JA are compared with different approaches from the literature. The optimal net benefits obtained from JA for DFRO, CFRO and TRO problems are 401.44, 308.40 and 1194.59, respectively, and that of TLBO algorithm are 401.33, 308.30 and 1194.44, respectively. It is found that both JA and TLBO algorithms provided a satisfactory solution as other optimization techniques, from literature. In conclusion, JA outperformed over TLBO.