2015
DOI: 10.1016/j.ejor.2015.04.028
|View full text |Cite
|
Sign up to set email alerts
|

Simulation-optimization approaches for water pump scheduling and pipe replacement problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
28
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 40 publications
(28 citation statements)
references
References 30 publications
0
28
0
Order By: Relevance
“…In this paper the authors are concerned with pump scheduling optimization (PSO): which pumps are to be operated and with which settings at different periods of the day, so that the energy cost, the largest operational cost for water utilities, is minimized. Nonlinearities, and binary decisions in the case of ON/OFF pumps, make PSO computationally challenging, even for small WDNs [4]. While mathematical programming approaches linearize/convexify the equations regulating the flow distribution in the WDN, the more recent optimization strategies use a hydraulic simulation software which can solve all the equations and provide computed values relatively to objective function (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper the authors are concerned with pump scheduling optimization (PSO): which pumps are to be operated and with which settings at different periods of the day, so that the energy cost, the largest operational cost for water utilities, is minimized. Nonlinearities, and binary decisions in the case of ON/OFF pumps, make PSO computationally challenging, even for small WDNs [4]. While mathematical programming approaches linearize/convexify the equations regulating the flow distribution in the WDN, the more recent optimization strategies use a hydraulic simulation software which can solve all the equations and provide computed values relatively to objective function (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, these approaches rely on a heuristic algorithm to recover the feasibility of the relaxed solutions in a second phase. As a direct evolution of relaxation techniques, two recent works apply decomposition techniques (lagrangian relaxation [5] and Benders decomposition [26]): to get an optimal solution, the relaxation is solved iteratively driven by a master program. Again, as the convergence is too slow, the method is truncated and coupled with Local Search [5].…”
mentioning
confidence: 99%
“…In inventory management problems, for instance, we often need to optimize a system modeled through a discrete event simulation to obtain the optimal stocking quantities ( Jalali & Van Nieuwenhuyse, 2015 ). Examples in other fields include supply chain design ( Saif & Elhedhli, 2015 ), pump scheduling ( Naoum-Sawaya, Ghaddar, Arandia, & Eck, 2015 ), and ambulance fleet allocation ( McCormack & Coates, 2015 ).…”
Section: Introductionmentioning
confidence: 99%