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

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

https://hal-mines-paristech.archives-ouvertes.fr/hal-02158535
Contributeur : Sophie Demassey <>
Soumis le : mardi 18 juin 2019 - 10:32:02
Dernière modification le : samedi 22 juin 2019 - 01:47:03

Fichier

Pump_Scheduling_DWDN.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-02158535, version 1

Citation

Gratien Bonvin, Sophie Demassey, Andrea Lodi. Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. 2019. ⟨hal-02158535⟩

Partager

Métriques

Consultations de la notice

48

Téléchargements de fichiers

67