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

Abstract : 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.
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal-mines-paristech.archives-ouvertes.fr/hal-02158565
Contributeur : Sophie Demassey <>
Soumis le : mardi 18 juin 2019 - 10:44:24
Dernière modification le : jeudi 11 juillet 2019 - 10:07:22

Fichier

INOC_2019_paper_10.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

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⟩

Partager

Métriques

Consultations de la notice

22

Téléchargements de fichiers

21