Accéder directement au contenu Accéder directement à la navigation
Nouvelle interface
Article dans une revue

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

https://hal-mines-paristech.archives-ouvertes.fr/hal-02158535
Contributeur : Sophie Demassey Connectez-vous pour contacter le contributeur
Soumis le : jeudi 26 novembre 2020 - 09:37:47
Dernière modification le : samedi 22 octobre 2022 - 05:13:52

Fichier

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

Identifiants

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, 2021, 22, pp.1275-1313. ⟨10.1007/s11081-020-09575-y⟩. ⟨hal-02158535v2⟩

Partager

Métriques

Consultations de la notice

355

Téléchargements de fichiers

1084