An official website of the United States government
The widespread deployment of smart heterogeneous technologies and the growing complexity in our modern society calls for effective coordination of the interdependent lifeline networks. In particular, operation coordination of electric power and water infrastructures is urgently needed as the water system is one of the most energy-intensive networks, an interruption in which may quickly evolve into a dramatic societal concern. The closely-intertwined ecosystem of water and power infrastructures is commonly known as water-energy nexus. This paper develops a novel analytic for uncertainty-aware day-ahead operation optimization of the interconnected power and water systems (PaWS). Joint probabilistic constraint (JPC) programming is employed to capture the uncertainties in wind resources and water demand forecasts. The proposed integrated stochastic model is presented as a non-linear non-convex optimization problem, where the non-linear hydraulic constraints in the water network are linearized using piece-wise linearization technique, and the non-convexity is efficiently tackled with a Boolean solution methodology to convert the proposed model with JPCs to a tractable mixed-integer linear programming (MILP) formulation that can be quickly solved to optimality. The suggested framework is applied to a 15-node commercial-scale water network jointly operated with a power transmission system using a modified IEEE 57-bus test system. The numerical results demonstrate the of the proposed stochastic framework, resulting in cost reduction (13% on average when compared to the traditional setting) and energy saving of the integrated model under different realizations of uncertain renewable energy sources (RESs) and water demand scenarios. Additionally, the scalability of the proposed model is tested on a modified IEEE 118-bus test system connected to five water networks.
more »
« less
A Mixed‐Integer Linear Programming Framework for Optimization of Water Network Operations Problems
Abstract Water distribution systems (WDSs) are critical infrastructure used to convey water from sources to consumers. The mathematical framework governing the distribution of flows and heads in extended period simulations of WDSs lends itself to application in a wide range of optimization problems. Applying the classical mixed integer linear programming (MILP) approach to model WDSs hydraulics within an optimization framework can contribute to higher solution accuracy with lower computational effort. However, adapting WDSs models to conform to a MILP formulation has proven challenging because of the intrinsic non‐linearity of system hydraulics and the complexity associated with modeling hydraulic devices that influence the state of the WDS. This paper introduces MILPNet, an adjustable framework for WDSs that can be used to build and solve an extensive array of MILP optimization problems. MILPNet includes constraints that represent the mass balance and energy conservation equations, hydraulic devices, control rules, and status checks. To conform to MILP structure, MILPNet employs piece‐wise linear approximation and integer programming. MILPNet was implemented and tested using Gurobi Python API. Modeling accuracy was shown to be comparable to EPANET, a public domain software for hydraulic modeling, and sensitivity analyses were conducted to examine the impacts of the modeling assumptions on the performance of MILPNet. Additionally, application of the framework was demonstrated using pump scheduling optimization examples in single and rolling horizon scenarios. Our results show that MILPNet can facilitate the construction and solution of optimization problems for a range of applications in WDSs operations.
more »
« less
- Award ID(s):
- 1943428
- PAR ID:
- 10489919
- Publisher / Repository:
- DOI PREFIX: 10.1029
- Date Published:
- Journal Name:
- Water Resources Research
- Volume:
- 60
- Issue:
- 2
- ISSN:
- 0043-1397
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Lin, Binshan (Ed.)This paper formulates a mixed integer linear programming (MILP) model to optimize a system of electric vehicle (EV) charging stations. Our methodology introduces a two-stage framework that integrates the first-stage system design problem with a second-stage control problem of the EV charging stations and develops a design and analysis of computer experiments (DACE) based system design optimization solution method. Our DACE approach generates a metamodel to predict revenue from the control problem using multivariate adaptive regression splines (MARS), fit over a binned Latin hypercube (LH) experimental design. Comparing the DACE based approach to using a commercial solver on the MILP, it yields near optimal solutions, provides interpretable profit functions, and significantly reduces computational time for practical application.more » « less
-
null (Ed.)Job shops are an important production environment for low-volume high-variety manufacturing. Its scheduling has recently been formulated as an Integer Linear Programming (ILP) problem to take advantages of popular Mixed-Integer Linear Programming (MILP) methods, e.g., branch-and-cut. When considering a large number of parts, MILP methods may combinatorial difficulties. To address this, a critical but much overlooked issue is formulation tightening. The idea is that if problem constraints can be transformed to directly delineate the problem convex hull in the data preprocessing stage, then a solution can be obtained by using linear programming methods without combinatorial difficulties. The tightening process, however, is fundamentally challenging because of the existence of integer variables. In this paper, an innovative and systematic approach is established for the first time to tighten the formulations of individual parts, each with multiple operations, in the data preprocessing stage. It is a major advancement of our previous work on problems with binary and continuous variables to integer variables. The idea is to first link integer variables to binary variables by innovatively combining constraints so that the integer variables are uniquely determined by the binary variables. With binary and continuous variables only, it is proved that the vertices of the convex hull can be obtained based on vertices of the linear problem after relaxing binary requirements. These vertices are then converted to tightened constraints for general use. This approach significantly improves our previous results on tightening individual operations. Numerical results demonstrate significant benefits on solution quality and computational efficiency. This approach also applies to other ILP problems with similar characteristics and fundamentally changes the way how such problems are formulated and solved.more » « less
-
Localizing pipe leaks is a significant challenge for water utilities worldwide. Pipe leaks in water distribution systems (WDSs) can cause the loss of a large amount of treated water, leading to pressure loss, increased energy costs, and contamination risks. What makes localizing pipe leaks challenging is the underground location of the water pipes and the similarity in impact on hydraulic properties (e.g., pressure, flow) due to leaks as compared to the effects of WDS operational changes. Physical methods to locate leaks are expensive, intrusive, and heavily localized. Computational approaches such as data-driven machine learning models provide an economical alternative to physical methods. Machine learning models are readily available and easily customizable to most problems; therefore, there is an increasing trend in their application for leak localization in WDSs. While several studies have applied machine learning models to localize leaks in single pipes and small test networks, these studies have yet to thoroughly test these models against the different complexities of leak localization problems, and hence their applicability to real-world WDSs is still unclear. The simplicity of the WDSs, the oversimplification of leak characteristics, and the lack of consideration of modeling and measuring device uncertainties adopted in most of these studies make the scalability of their proposed approaches questionable to real-world WDSs. Our study addresses this issue by devising four study cases of different complexity that account for realistic leak characteristics and model- and measuring device-related uncertainties. Two established machine learning models—multilayer perceptron (MLP) and convolutional neural network (CNN)—are trained and tested for their ability to localize the leaks and predict their sizes for each of the four study cases using different simulated hydraulic inputs. In addition, the potential benefit of combining different types of hydraulic data as inputs to the machine learning models in localizing leaks is also explored. Pressure and flow, two common hydraulic measurements, are used as inputs to the machine learning models. Further, the impact of single and multiple time point input in leak localization is also investigated. The results for the L-Town network indicate good accuracies for both the models for all study cases, with CNN consistently outperforming MLP.more » « less
-
While mixed integer linear programming (MILP) solvers are routinely used to solve a wide range of important science and engineering problems, it remains a challenging task for end users to write correct and efficient MILP constraints, especially for problems specified using the inherently non-linear Boolean logic operations. To overcome this challenge, we propose a syntax guided synthesis (SyGuS) method capable of generating high-quality MILP constraints from the specifications expressed using arbitrary combinations of Boolean logic operations. At the center of our method is an extensible domain specification language (DSL) whose expressiveness may be improved by adding new integer variables as decision variables, together with an iterative procedure for synthesizing linear constraints from non-linear Boolean logic operations using these integer variables. To make the synthesis method efficient, we also propose an over-approximation technique for soundly proving the correctness of the synthesized linear constraints, and an under-approximation technique for safely pruning away the incorrect constraints. We have implemented and evaluated the method on a wide range of benchmark specifications from statistics, machine learning, and data science applications. The experimental results show that the method is efficient in handling these benchmarks, and the quality of the synthesized MILP constraints is close to, or higher than, that of manually-written constraints in terms of both compactness and solving time.more » « less
