Skip to Main content Skip to Navigation
Journal articles

Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound

Abstract : This paper offers a novel approach for computing globally optimal solutions to the pump scheduling problem in drinking water distribution networks. A tight integer linear relaxation of the original non-convex formulation is devised and solved by branch and bound where integer nodes are investigated through non-linear programming to check the satisfaction of the non-convex constraints and compute the actual cost. This generic method can tackle a large variety of networks , e.g. with variable-speed pumps. We also propose to specialize it for a common subclass of networks with several improving techniques, including a new primal heuristic to repair near-feasible integer relaxed solutions. Our approach is numerically assessed on various case studies of the literature and compared with recently reported results.
Complete list of metadata

https://hal-mines-paristech.archives-ouvertes.fr/hal-02158535
Contributor : Sophie Demassey <>
Submitted on : Thursday, November 26, 2020 - 9:37:47 AM
Last modification on : Saturday, November 28, 2020 - 3:10:14 AM

File

bonvin20opteng.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02158535, version 2

Citation

Gratien Bonvin, Sophie Demassey, Andrea Lodi. Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. Optimization and Engineering, Springer Verlag, In press. ⟨hal-02158535v2⟩

Share

Metrics

Record views

175

Files downloads

653