Citation

BibTex format

@article{Menke:2016:10.1007/s11269-016-1490-8,
author = {Menke, RM and Abraham, EA and Stoianov, IS and Parpas, PP},
doi = {10.1007/s11269-016-1490-8},
journal = {Water Resources Management},
pages = {5333--5349},
title = {Exploring optimal pump scheduling in water distribution networks with branch and bound methods},
url = {http://dx.doi.org/10.1007/s11269-016-1490-8},
volume = {30},
year = {2016}
}

RIS format (EndNote, RefMan)

TY  - JOUR
AB - Water utilities can achieve signi cant savings in operating costs by optimising pump scheduling to improve efficiency and shift electricity consumption to low-tari periods. Due to the complexityof the optimal scheduling problem, heuristic methods that cannot guarantee global optimality are often applied. This paper investigates formulations of the pump scheduling problem solved using a branch and bound method. Piecewise linear component approximations outperform non-linear approximationswithin application driven accuracy bounds and demand uncertainties. It is shown that the reduction of symmetry through the grouping of pumps signi cantly reduces the computational e ort, whereas loopsin the network have the opposite e ect. The computational e ort of including convex, non-linear pump operating, and maintenance cost functions is investigated. Using case studies, it is shown that linear and xed-cost functions can be used to nd schedules which, when simulated in a full hydraulic simulation, have performances that are within the solver optimality gap and the uncertainty of demand forecasts.
AU - Menke,RM
AU - Abraham,EA
AU - Stoianov,IS
AU - Parpas,PP
DO - 10.1007/s11269-016-1490-8
EP - 5349
PY - 2016///
SN - 0920-4741
SP - 5333
TI - Exploring optimal pump scheduling in water distribution networks with branch and bound methods
T2 - Water Resources Management
UR - http://dx.doi.org/10.1007/s11269-016-1490-8
UR - http://hdl.handle.net/10044/1/39749
VL - 30
ER -