Chance-constrained model predictive control for drinking water networks

This paper addresses a chance-constrained model predictive control (CC-MPC) strategy for the management of drinking water networks (DWNs) based on a finite horizon stochastic optimisation problem with joint probabilistic (chance) constraints. In this approach, water demands are considered additive s...

Descripción completa

Detalles Bibliográficos
Autores: Grosso Pérez, Juan Manuel|||0000-0002-4300-1500, Ocampo-Martínez, Carlos|||0000-0001-9251-6044, Puig Cayuela, Vicenç|||0000-0002-6364-6429, Joseph Duran, Bernat
Tipo de recurso: artículo
Fecha de publicación:2014
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/23369
Acceso en línea:https://hdl.handle.net/2117/23369
https://dx.doi.org/10.1016/j.jprocont.2014.01.010
Access Level:acceso abierto
Palabra clave:Water-supply -- Management -- Mathematical models
Chance constraints
Drinking water networks
MPC
Reliability
Robustness
Aigua -- Abastament -- Control
Àrees temàtiques de la UPC::Informàtica::Automàtica i control
Descripción
Sumario:This paper addresses a chance-constrained model predictive control (CC-MPC) strategy for the management of drinking water networks (DWNs) based on a finite horizon stochastic optimisation problem with joint probabilistic (chance) constraints. In this approach, water demands are considered additive stochastic disturbances with non-stationary uncertainty description, unbounded support and known (or approximated) quasi-concave probabilistic distribution. A deterministic equivalent of the stochastic problem is formulated using Boole's inequality to decompose joint chance constraints into single chance constraints and by considering a uniform allocation of risk to bound these later constraints. The resultant deterministic-equivalent optimisation problem is suitable to be solved with tractable quadratic programming (QP) or second order cone programming (SOCP) algorithms. The reformulation allows to explicitly and easily propagate uncertainty over the prediction horizon, and leads to a cost-efficient management of risk that consists in a dynamic back-off to avoid frequent violation of constraints. Results of applying the proposed approach to a real case study - the Barcelona DWN (Spain) - have shown that the network performance (in terms of operational costs) and the necessary back-off (to cope with stochastic disturbances) are optimised simultaneously within a single problem, keeping tractability of the solution, even in large-scale networks. The general formulation of the approach and the automatic computation of proper back-off within the MPC framework replace the need of experience-based heuristics or bi-level optimisation schemes that might compromise the trade-off between profits, reliability and computational burden. © 2014 Elsevier Ltd.