2009
DOI: 10.2174/1874114200903010014
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear Programming Techniques for Operative Planning in Large Drinking Water Networks

Abstract: Mathematical decision support for operative planning in water supply systems is highly desirable; it leads, however, to very difficult optimization problems. We propose a nonlinear programming approach that yields practically satisfactory operating schedules in acceptable computing time even for large networks. Based on a carefully designed model supporting gradient-based optimization algorithms, this approach employs a special initialization strategy for convergence acceleration, special minimum up and down t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
37
0
1

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 39 publications
(39 citation statements)
references
References 47 publications
0
37
0
1
Order By: Relevance
“…Interesting recent developments include problem-specific reformulations and decompositions, as in [5] for drinking water networks. The authors reformulate the MIOCP as a large-scale, structured nonlinear program (NLP) and solve a small scale integer program on a second level to approximate the calculated continuous aggregated output of all pumps in a water works.…”
Section: Mioc Approaches In the Literaturementioning
confidence: 99%
“…Interesting recent developments include problem-specific reformulations and decompositions, as in [5] for drinking water networks. The authors reformulate the MIOCP as a large-scale, structured nonlinear program (NLP) and solve a small scale integer program on a second level to approximate the calculated continuous aggregated output of all pumps in a water works.…”
Section: Mioc Approaches In the Literaturementioning
confidence: 99%
“…A clever problem-specific reformulation is proposed in [10,11]. For the optimal operation of a water network the authors propose to decompose the problem in the sense that a pure NLP is solved for the overall network with a (continuous) aggregated output of the discrete-valued pumps in each waterworks.…”
Section: Reformulations To Avoid Integralitymentioning
confidence: 99%
“…These models are typically nonconvex MINLP's and are in general hard to solve. They are often solved by means of some NLP solvers, after the binary variables are relaxed or the model reformulated (Cembrano et al, 2000;Burgschweiger et al, 2009). Heuristic methods are also frequently used to solve these models (Savic and Walters, 1997;López-Ibáñez et al, 2008;Nicklow et al, 2010).…”
Section: Introductionmentioning
confidence: 99%