Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
| Hi-index | 0.00 |
We develop and discuss an operational planning model aiming at minimizing production and distribution costs in large drinking water networks containing buffers with free inflow. Modeling drinking water networks is very challenging due of the presence of complex hydraulic constraints, such as friction losses and pump curves. Non-linear, non-convex constraints result from the relationships between pressure and flow in power terms. Also, binary variables are needed to model the possibility of free inflow or re-injection of water at reservoirs. The resulting model is thus a non-convex Mixed-Integer Non-Linear Program (MINLP). A discrete-time setting is proposed to solve the problem over a finite horizon made of several intervals. A commercial solver, BONMIN, suited for convex MINLP models is used to heuristically solve the problem.We are able to find a good solution for a small part of an existing network operated by the Vlaamse Maatschappij voor Watervoorziening (VMW), a major drinking water company in Flanders.