Extended linear formulation of the pump scheduling problem in water distribution networks

Gratien Bonvin (1) , Sophie Demassey (1)

1 CMA - Centre de Mathématiques Appliquées

This paper presents a generic non-compact linear programming approximation of the pump scheduling problem in drinking water distribution networks. Instead of relying on the binary on/off status of the pumps, the model draws on the continuous duration of activation of pump combinations , whose entire set is computed in a preprocessing step by ignoring the pressure variation in the water tanks. Pre-processing is accelerated using network partition and symmetry arguments. A combinatorial Benders decomposition-based local search takes the approximated solution as input to derive a feasible solution. Our experiments on two different benchmark sets, with fixed-or variable-speed pumps, show the accuracy of the approximated formulation and the ability of the matheuristic to compute near-optimal solutions in seconds, where concurrent, more specialized approaches need minutes or hours.

Domaines: Recherche opérationnelle [math.OC]; Optimisation et contrôle [math.OC]

Gratien Bonvin, Sophie Demassey. Extended linear formulation of the pump scheduling problem in water distribution networks. International Network Optimization Conference, June 12-14, 2019, Avignon, France., pp.13-18, 2019, Open Proceedings, ⟨10.5441/002/inoc.2019.04⟩. ⟨hal-02158565⟩