The Computational Complexity of the Problem of Determining Least Capital Cost Designs for Water Supply Networks

Yates, Derek; Templeman, Andrew B.; Boffey, T. B.

doi:10.1080/03052158408960635

Cited by 105 publications

(35 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Simply the selection of pipe diameters (from a set of commercially available discrete diameters) to form a water supply system of least capital cost has been demonstrated to be an NP-hard problem, let alone considering multiple loading conditions, operating cost, rehabilitation options and other aspects that affect real-life networks. Yates et al (1984) stated that the global optimum solution to WDS design problem can only be guaranteed by means of explicit or implicit enumeration techniques such as dynamic programming. These techniques require a great amount of computer time as they involve searching the entire solution space.…”

Section: Introductionmentioning

confidence: 99%

Penalty-Free Feasibility Boundary Convergent Multi-Objective Evolutionary Algorithm for the Optimization of Water Distribution Systems

Siew

Tanyimboh

2012

Water Resour Manage

View full text Add to dashboard Cite

This version is available at https://strathprints.strath.ac.uk/43222/ Strathprints is designed to allow users to access the research output of the University of Strathclyde. Unless otherwise explicitly stated on the manuscript, Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Please check the manuscript for details of any other licences that may have been applied. You may not engage in further distribution of the material for any profitmaking activities or any commercial gain. You may freely distribute both the url (https://strathprints.strath.ac.uk/) and the content of this paper for research or private study, educational, or not-for-profit purposes without prior permission or charge.Any correspondence concerning this service should be sent to the Strathprints administrator: strathprints@strath.ac.ukThe Strathprints institutional repository (https://strathprints.strath.ac.uk) is a digital archive of University of Strathclyde research outputs. It has been developed to disseminate open access research outputs, expose data about those outputs, and enable the management and persistent access to Strathclyde's intellectual output. AbstractThis paper presents a new penalty-free multi-objective evolutionary approach (PFMOEA) for the optimization of water distribution systems (WDSs). The proposed approach utilizes pressure dependent analysis (PDA) to develop a multi-objective evolutionary search. PDA is able to simulate both normal and pressure deficient networks and provides the means to accurately and rapidly identify the feasible region of the solution space, effectively locating global or near global optimal solutions along its active constraint boundary. The significant advantage of this method over previous methods is that it eliminates the need for ad-hoc penalty functions, additional "boundary search" parameters, or special constraint handling procedures. Conceptually, the approach is downright straightforward and probably the simplest hitherto. The PFMOEA has been applied to several WDS benchmarks and its performance examined. It is demonstrated that the approach is highly robust and efficient in locating optimal solutions. Superior results in terms of the initial network construction cost and number of hydraulic simulations required were obtained. The improvements are demonstrated through comparisons with previously published solutions from the literature.

show abstract

Section: Introductionmentioning

confidence: 99%

Penalty-Free Feasibility Boundary Convergent Multi-Objective Evolutionary Algorithm for the Optimization of Water Distribution Systems

Siew

Tanyimboh

2012

Water Resour Manage

View full text Add to dashboard Cite

show abstract

“…Moreover, this problem is a combinatorial optimization problem, since its decision variables (i.e., the type of each pipe) are discrete. The problem has also been proven to be NP-hard (nondeterministic polynomial time hard) by Yates [28].…”

Section: Mathematical Formulationmentioning

confidence: 99%

An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization

Corte¹,

Sörensen²

2016

Water

View full text Add to dashboard Cite

Water distribution networks consist of different components, such as reservoirs and pipes, and exist to provide users (households, agriculture, industry) with high-quality water at adequate pressure and flow. Water distribution network design optimization aims to find optimal diameters for every pipe, chosen from a limited set of commercially available diameters. This combinatorial optimization problem has received a lot of attention over the past forty years. In this paper, the well-studied single-period problem is extended to a multi-period setting in which time varying demand patterns occur. Moreover, an additional constraint-which sets a maximum water velocity-is imposed. A metaheuristic technique called iterated local search is applied to tackle this challenging optimization problem. A full-factorial experiment is conducted to validate the added value of the algorithm components and to configure optimal parameter settings. The algorithm is tested on a broad range of 150 different (freely available) test networks.

show abstract

“…A design in this context is a selection of a set of pipes, nodes, pumps, valves and storage tanks or reservoirs, along with their properties and operational rules. The problem of evaluating a design is complex (Yates, Templeman, & Boffey, 1984) and this is why many person-hours have gone into developing EPANET. For a particular design, EPANET tracks the flow of water in each pipe, the pressure at each node, the height of the water in each tank, and the concentration of a chemical species throughout the network during a simulation period (Rossman, 2000).…”

Section: Figure 1 Schematic Representation Of the Black-box Optimizamentioning

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 Computational Complexity of the Problem of Determining Least Capital Cost Designs for Water Supply Networks

Cited by 105 publications

References 2 publications

Penalty-Free Feasibility Boundary Convergent Multi-Objective Evolutionary Algorithm for the Optimization of Water Distribution Systems

Penalty-Free Feasibility Boundary Convergent Multi-Objective Evolutionary Algorithm for the Optimization of Water Distribution Systems

An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization

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

Contact Info

Product

Resources

About