Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Optimization and Engineering Année : 2021

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

(1) , (1) , (2)
1
2
Gratien Bonvin
  • Fonction : Auteur
  • PersonId : 1009974
Sophie Demassey
Andrea Lodi
  • Fonction : Auteur
  • PersonId : 1082961

Résumé

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.
Fichier principal
Vignette du fichier
bonvin20opteng.pdf (747.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02158535 , version 1 (18-06-2019)
hal-02158535 , version 2 (26-11-2020)

Identifiants

Citer

Gratien Bonvin, Sophie Demassey, Andrea Lodi. Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound. Optimization and Engineering, 2021, 22, pp.1275-1313. ⟨10.1007/s11081-020-09575-y⟩. ⟨hal-02158535v2⟩
355 Consultations
1084 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More