15. Real-Time, Large-Scale Optimization of Water Network Systems Using a Subdomain Approach
Lists
Only you see this
Abstract
15.1 Introduction Certain classes of dynamic network problems can be modeled by a set of hyperbolic partial differential equations (PDEs) describing behavior along network edges and a set of differential and algebraic equations describing behavior at network nodes. In this chapter, we demonstrate real-time performance for optimization problems in drinking water networks. While optimization problems subject to partial differential, differential, and algebraic equations can be solved with a variety of techniques, efficient solutions are difficult for large network problems with many degrees of freedom and variable bounds. Sequential optimization strategies can be inefficient for this problem due to the high cost of computing derivatives with respect to many degrees of freedom [11]. Simultaneous techniques can be more efficient but are difficult because of the need to solve a large nonlinear program; a program that may be too large for current solver. This study describes a dynamic optimization formulation for estimating contaminant sources in drinking water networks, given concentration measurements at various network nodes. We achieve real-time performance by combining an efficient large-scale nonlinear programming algorithm with two problem reduction techniques. D'Alembert's principle can be applied to the PDEs governing behavior along the network edges (distribution pipes).
BibTeX
@inproceedings{laird2007real,
author = {Carl D. Laird and Lorenz T. Biegler and Bart G. van Bloemen Waanders},
title = {{15. Real-Time, Large-Scale Optimization of Water Network Systems Using a Subdomain Approach}},
booktitle = {Society},
year = {2007},
doi = {10.1137/1.9780898718935.ch15},
}Loading related content...