2015
DOI: 10.1007/s11269-015-1209-2
|View full text |Cite
|
Sign up to set email alerts
|

A Branch-and-Bound Algorithm for Optimal Pump Scheduling in Water Distribution Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
29
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(29 citation statements)
references
References 21 publications
0
29
0
Order By: Relevance
“…Pumped water systems have been analyzed by different authors [99][100][101][102][103] whose main objective has been to minimize the energy costs. Rodriguez-Diaz et al [99] proposed a new methodology with energy savings between 10% and 30% in real case studies, considering the most critical consumption points, which depend on needs and location.…”
Section: Pumped Water Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…Pumped water systems have been analyzed by different authors [99][100][101][102][103] whose main objective has been to minimize the energy costs. Rodriguez-Diaz et al [99] proposed a new methodology with energy savings between 10% and 30% in real case studies, considering the most critical consumption points, which depend on needs and location.…”
Section: Pumped Water Systemsmentioning
confidence: 99%
“…Costa et al [103] presented a general optimization routine integrated with EPANET [104]. This routine allows the determination of strategic optimal rules of operation for any type of water distribution system.…”
Section: Pumped Water Systemsmentioning
confidence: 99%
“…Mathematical optimisation approaches that have been applied to pump scheduling include dynamic programming (Dreizin 1970), model predictive control (Sun et al 2015), iterative methods (Price and Ostfeld 2013), benders decomposition (Cai et al 2001) and branch and bound methods (Costa et al 2016).…”
Section: Review Of Mathematical Optimisation Approachesmentioning
confidence: 99%
“…Finally, we experimented our approach on various benchmark sets (Simple FSD/VSD [35], AT(M) [44,10], Poormond [20,37,49] and DWG [56]), and drove an empirical comparison with recently reported results [10,20,37,49] and with the reference global optimization solver BARON [46]. The computational results demonstrate the applicability of our generic solution method and also its efficiency regarding the results of the dedicated algorithms on given instances, although solving the non-convex NLP subproblems remains a bottleneck for the largest instances of class MS.…”
Section: Introductionmentioning
confidence: 99%