Simultaneous optimisation of large-scale problems of heat-integrated water networks

Energy ◽  
2021 ◽  
pp. 121354
Author(s):  
Nidret Ibrić ◽  
Elvis Ahmetović ◽  
Zdravko Kravanja ◽  
Ignacio E. Grossmann
Water ◽  
2021 ◽  
Vol 13 (16) ◽  
pp. 2209
Author(s):  
Mashor Housh

Optimal management of water systems tends to be very complex, especially when water quality aspects are included. This paper addresses the management of multi-quality water networks over a fixed time horizon. The problem is formulated as an optimization program that minimizes cost by determining the optimal flow distribution that satisfies the water quantity and quality requirement in the demand nodes. The resulted model is nonlinear and non-convex due to bilinear terms in the mass balance equations of blending multi-quality flow. This results in several local optima, making the process of solving large-scale problems to global optimality very challenging. One classical approach to deal with this challenge is to use a multi-start procedure in which off-the-shelf local optimization solvers are initialized with several random initial points. Then the final optimal solution is considered as the lowest objective value over the different runs. This will lead to a cumbersome and slow solution process for large-scale problems. In light of the above, this study supports using ultra-fast simple optimization heuristics, which despite their moderate accuracy, can still reach the optimum solution when run many times using a multi-start procedure. As such, the final solution from simple optimization heuristics can compete with off-the-shelf nonlinear solvers in terms of accuracy and efficiency. The paper presents a simple optimization heuristic, which is specially tailored for the problem and compares its performance with a state-of-the-art nonlinear solver on large-scale systems.


Water ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 899
Author(s):  
Djordje Mitrovic ◽  
Miguel Crespo Chacón ◽  
Aida Mérida García ◽  
Jorge García Morillo ◽  
Juan Antonio Rodríguez Diaz ◽  
...  

Studies have shown micro-hydropower (MHP) opportunities for energy recovery and CO2 reductions in the water sector. This paper conducts a large-scale assessment of this potential using a dataset amassed across six EU countries (Ireland, Northern Ireland, Scotland, Wales, Spain, and Portugal) for the drinking water, irrigation, and wastewater sectors. Extrapolating the collected data, the total annual MHP potential was estimated between 482.3 and 821.6 GWh, depending on the assumptions, divided among Ireland (15.5–32.2 GWh), Scotland (17.8–139.7 GWh), Northern Ireland (5.9–8.2 GWh), Wales (10.2–8.1 GWh), Spain (375.3–539.9 GWh), and Portugal (57.6–93.5 GWh) and distributed across the drinking water (43–67%), irrigation (51–30%), and wastewater (6–3%) sectors. The findings demonstrated reductions in energy consumption in water networks between 1.7 and 13.0%. Forty-five percent of the energy estimated from the analysed sites was associated with just 3% of their number, having a power output capacity >15 kW. This demonstrated that a significant proportion of energy could be exploited at a small number of sites, with a valuable contribution to net energy efficiency gains and CO2 emission reductions. This also demonstrates cost-effective, value-added, multi-country benefits to policy makers, establishing the case to incentivise MHP in water networks to help achieve the desired CO2 emissions reductions targets.


Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.


2011 ◽  
Vol 204-210 ◽  
pp. 2196-2201
Author(s):  
Yan Tao Jiang ◽  
Si Tian Chen ◽  
Cheng Hua Li

In this paper, the fast multipole virtual boundary element - least square method (Fast Multipole VBE - LSM) is proposed and used to simulate 2-D elastic problems, which is based on the fast multipole method (FMM) and virtual boundary element - least square method (VBE - LSM).The main idea of the method is to change computational model by applying the FMM to conventional VBE - LSM. The memory and operations could be reduced to be of linear proportion to the degree of freedom (DOF) and large scale problems could be effectively solved on a common desktop with this method. Numerical results show that this method holds virtues of high feasibility, accuracy and efficiency. Moreover, the idea of this method can be generalized and extended in application.


1991 ◽  
Vol 73 (3-4) ◽  
pp. 271-284 ◽  
Author(s):  
E.G. O'Neill ◽  
R.V. O'Neill ◽  
R.J. Norby

2008 ◽  
Vol 18 (05) ◽  
pp. 1589-1597 ◽  
Author(s):  
M. FRIEDMAN ◽  
W. QIU

CL_MATCONT is a MATLAB package for the study of dynamical systems and their bifurcations. It uses a minimally augmented system for continuation of the Hopf curve. The Continuation of Invariant Subspaces (CIS) algorithm produces a smooth orthonormal basis for an invariant subspace [Formula: see text] of a parameter-dependent matrix A(s). We extend a minimally augmented system technique for location and continuation of Hopf bifurcations to large-scale problems using the CIS algorithm, which has been incorporated into CL_MATCONT. We compare this approach with using a standard augmented system and show that a minimally augmented system technique is more suitable for large-scale problems. We also suggest an improvement of a minimally augmented system technique for the case of the torus continuation.


Sign in / Sign up

Export Citation Format

Share Document