2003
DOI: 10.1061/(asce)0733-9496(2003)129:3(200)
|View full text |Cite
|
Sign up to set email alerts
|

Ant Colony Optimization for Design of Water Distribution Systems

Abstract: ABSTRACT:During the last decade, evolutionary methods such as genetic algorithms have been used extensively for the optimal design and operation of water distribution systems. More recently, ant colony optimization algorithms (ACOAs), which are evolutionary methods based on the foraging behavior of ants, have been successfully applied to a number of benchmark combinatorial optimization problems. In this paper, a formulation is developed which enables ACOAs to be used for the optimal design of water distributio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
133
0
4

Year Published

2011
2011
2016
2016

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 408 publications
(139 citation statements)
references
References 17 publications
2
133
0
4
Order By: Relevance
“…Only two players have not managed to find a feasible solution to the problem (#1 and #13), i.e., a solution that satisfies all minimum pressure requirements. have learned will be assessed qualitatively using the knowledge of the decisions (pipe diameters) implemented in the optimized solution [51].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Only two players have not managed to find a feasible solution to the problem (#1 and #13), i.e., a solution that satisfies all minimum pressure requirements. have learned will be assessed qualitatively using the knowledge of the decisions (pipe diameters) implemented in the optimized solution [51].…”
Section: Resultsmentioning
confidence: 99%
“…Savic and Walters [50] used the problem to illustrate the sensitivity of such optimization problems to small changes in the coefficients used in calculating the frictional losses observed in the system, demonstrating solutions ranging from $37.14M to $40.45M. The best-known feasible solution (using the latest EPANET software version) of $38.64M was obtained using the Ant Colony Simulation approach of Maier et al [51].…”
Section: Problem Description and Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…These four typical runs used the same starting random number seeds. The current best known solution for the NYTP case study with a cost of $38.64 million was first reported by Maier et al (2003). This best known solution was found by the runs of the four algorithms presented in Figure 3.…”
Section: New York Tunnels Problemmentioning
confidence: 99%
“…where p ij (k, t) is the probability that option l ij is chosen by ant k for variable i at iteration t; τ ij (t) is the pheromone concentration associated with option l ij at iteration t; ij is a heuristic factor for preferring among available options and is an indicator of how good it is for ant k to select option l ij (this heuristic factor is generated as per the problem characteristics and its value is fixed for each option l ij ); and α and β are exponent parameters that control the relative importance of pheromone concentration versus the heuristic factor [10]. Both α and β can take values greater than zero and can be determined by trial and error.…”
Section: Ant Colony Optimizationmentioning
confidence: 99%