Bi-objective design-for-control of water distribution networks with global bounds

This manuscript investigates the design-for-control (DfC) problem of minimizing pressure induced leakage and maximizing resilience in existing water distribution networks. The problem consists in simultaneously selecting locations for the installation of new valves and/or pipes, and optimizing valve...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Optimization and engineering 2022-03, Vol.23 (1), p.527-577
Hauptverfasser: Ulusoy, Aly-Joy, Pecci, Filippo, Stoianov, Ivan
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This manuscript investigates the design-for-control (DfC) problem of minimizing pressure induced leakage and maximizing resilience in existing water distribution networks. The problem consists in simultaneously selecting locations for the installation of new valves and/or pipes, and optimizing valve control settings. This results in a challenging optimization problem belonging to the class of non-convex bi-objective mixed-integer non-linear programs (BOMINLP). In this manuscript, we propose and investigate a method to approximate the non-dominated set of the DfC problem with guarantees of global non-dominance. The BOMINLP is first scalarized using the method of ϵ -constraints. Feasible solutions with global optimality bounds are then computed for the resulting sequence of single-objective mixed-integer non-linear programs, using a tailored spatial branch-and-bound (sBB) method. In particular, we propose an equivalent reformulation of the non-linear resilience objective function to enable the computation of global optimality bounds. We show that our approach returns a set of potentially non-dominated solutions along with guarantees of their non-dominance in the form of a superset of the true non-dominated set of the BOMINLP. Finally, we evaluate the method on two case study networks and show that the tailored sBB method outperforms state-of-the-art global optimization solvers.
ISSN:1389-4420
1573-2924
DOI:10.1007/s11081-021-09598-z