A two‐phase decomposition method for optimal design of looped water distribution networks

Fujiwara, Okitsugu; Khang, Do Ba

doi:10.1029/wr026i004p00539

Cited by 430 publications

(267 citation statements)

References 10 publications

Supporting

Mentioning

242

Contrasting

Unclassified

Order By: Relevance

“…To test it, some local optima Gessler (1982) 41.8 Discrete diameters Morgan and Goulter (1985) 38.9 Split-pipe Morgan and Goulter (1985) 39.2 Discrete diameters Goulter et al (1986) 435 Split-pipe Kessler (1988) 39.0 Split-pipe Kessler and Shamir (1989) 418 Split-pipe Fujiwara and Khang (1990) 36.6 Split-pipe Khang (1990, 1991) 6116 Continuous diameters Khang (1990, 1991) 6319 Split-pipe Walski et al (1990) 1884.432 Discrete diameters Sonak and Bhave (1993) 6045 Split-pipe Murphy et al (1993) 38.8 Discrete diameters Eiger et al (1994) 402 6027 Split-pipe Loganathan et al (1995) 38.0 Split-pipe Dandy et al (1996) 38.8 Discrete diameters Varma et al (1997) 6000 Continuous diameters Varma et al (1997) 6162 Discrete diameters Savic and Walters (1997) solutions regarding New York network (network 3) included in the literature were used as starting solutions to run the tabu search algorithm developed. They are presented in Table 5 for Morgan and Goulter (1985) and Murphy et al (1993) and in Table 6 for Gessler (1982).…”

Section: Resultsmentioning

confidence: 99%

“…In the successive iterations, the flow variables are heuristically adjusted according to the gradient of the objective function. Other authors followed this innovative course and introduced alternative derivations from the linear programming-based gradient expressions (Quindry et al, 1981;Fujiwara et al, 1987;Kessler and Shamir, 1989;Fujiwara and Khang, 1990). It should be noted that this approach leads to solutions in which pipes have one or two fixed diameter segments.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Tabu search algorithms for water network optimization

Cunha

Ribeiro²

2004

European Journal of Operational Research

124

View full text Add to dashboard Cite

In this paper we propose a tabu search algorithm to find the least-cost design of looped water distribution networks. The mathematical nature of this optimization problem, a nonlinear mixed integer problem, is at the origin of a multitude of contributions to the literature in the last 25 years. In fact, exact optimization methods have not been found for this type of problem, and, in the past, classical optimization methods, like linear and nonlinear programming, were tried at the cost of drastic simplifications. Tabu search is a valuable heuristic technique for solving problems cast in combinatorial form. This is based on the human memory process and uses an iterative neighborhood search procedure in an attempt to avoid becoming trapped in local optima. The use of such a heuristic procedure to solve the aforementioned problem needs particular tailoring to produce high quality solutions. In this paper we present the essential features of the algorithm and the results obtained when it is applied to some of the classical water distribution network case studies appearing in the literature. The results are very promising and demonstrate the usefulness of tabu search algorithms in solving this kind of optimization problem.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Tabu search algorithms for water network optimization

Cunha

Ribeiro²

2004

European Journal of Operational Research

124

View full text Add to dashboard Cite

show abstract

“…The value of depends on the problem and, in the literature, a value of has been used for the New York City problem (Shaake & Lai, 1969), while a value of has been used for the Hanoi network (Fujiwara & Khang, 1987). These are the two problems that we use for experimentation, with the values of that are suggested in the literature.…”

Section: Water Distribution Network Problemmentioning

confidence: 99%

A black-box scatter search for optimization problems with integer variables

et al. 2013

View full text Add to dashboard Cite

The goal of this work is the development of a black-box solver based on the scatter search methodology. In particular, we seek a solver capable of obtaining high quality outcomes to optimization problems for which solutions are represented as a vector of integer values. We refer to these problems as integer optimization problems. We assume that the decision variables are bounded and that there may be constraints that require that the black-box evaluator is called in order to know whether they are satisfied. Problems of this type are common in operational research areas of applications such as telecommunications, project management, engineering design and the like. Our experimental testing includes 171 instances within four classes of problems taken from the literature. The experiments compare the performance of the proposed method with both the best context-specific procedures designed for each class of problem as well as context-independent commercial software. The experiments show that the proposed solution method competes well against commercial software and that can be competitive with specialized procedures in some problem classes.

show abstract

“…The Hanoi Problem (HP) (Fujiwara and Khang 1990) has frequently been used as a benchmark WDS case study to test the performance of various optimization algorithms.…”

Section: N O T C O P Y E D I T E Dmentioning

confidence: 99%

Coupled Binary Linear Programming–Differential Evolution Algorithm Approach for Water Distribution System Optimization

Zheng

Simpson

Zecchin

2014

J. Water Resour. Plann. Manage.

View full text Add to dashboard Cite

A coupled binary linear programming-differential evolution (BLP-DE) approach is proposed in this paper to optimize the design of water distribution systems (WDSs). Three stages are involved in the proposed BLP-DE optimization method. In the first stage, the WDS that is being optimized is decomposed into trees and the core using a graph algorithm. Binary linear programming (BLP) is then used to optimize the design of the trees during the second stage. In the third stage, a differential evolution (DE) algorithm is utilized to deal with the core design while incorporating the optimal solutions for the trees obtained in the second stage, thereby yielding near-optimal solutions for the original whole WDS. The proposed method takes advantage of both BLP and DE algorithms: BLP is capable of providing global optimal solution for the trees (no loops involved) with great efficiency, while a DE is able to efficiently generate good quality solutions for the core (loops involved) with a reduced search space compared to the original full network. Two benchmark WDS case studies and one real-world case study (with multiple demand loading cases) with a number of decision variables ranging from 21 to 96 are used to verify the effectiveness of the proposed BLP-DE optimization

show abstract

A two‐phase decomposition method for optimal design of looped water distribution networks

Cited by 430 publications

References 10 publications

Tabu search algorithms for water network optimization

Tabu search algorithms for water network optimization

A black-box scatter search for optimization problems with integer variables

Coupled Binary Linear Programming–Differential Evolution Algorithm Approach for Water Distribution System Optimization

Contact Info

Product

Resources

About