2005
DOI: 10.1109/tevc.2005.844168
|View full text |Cite
|
Sign up to set email alerts
|

Parametric Study for an Ant Algorithm Applied to Water Distribution System Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
100
0
18

Year Published

2006
2006
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 169 publications
(120 citation statements)
references
References 29 publications
2
100
0
18
Order By: Relevance
“…Four WDS case studies have been used to investigate the effectiveness of the proposed algorithm. These include the New York Tunnels Problem (NYTP) (Dandy et al 1996), the Hanoi Problem (HP) (Fujiwara and Khang 1990), the Double New York Tunnels Problem (NYTP2) (Zecchin et al 2005) For the computer runs presented in this research the Tol value was set to be 10 -6 .…”
Section: Case Studiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Four WDS case studies have been used to investigate the effectiveness of the proposed algorithm. These include the New York Tunnels Problem (NYTP) (Dandy et al 1996), the Hanoi Problem (HP) (Fujiwara and Khang 1990), the Double New York Tunnels Problem (NYTP2) (Zecchin et al 2005) For the computer runs presented in this research the Tol value was set to be 10 -6 .…”
Section: Case Studiesmentioning
confidence: 99%
“…The current best known solutions for the NYTP, HP and NYTP2 case studies were first reported by Maier et al (2003), Reca and Martínez (2006) and Zecchin et al (2005) with costs of $38.64 million, $6.081 million and $77.28 million respectively. These current best known solutions were also found by the proposed SADE with different population sizes.…”
Section: Populatuion Size Studymentioning
confidence: 99%
“…It employs some basic heuristics in order to escape from local optima and to find the global optimum in a multimodal space. The most successful applications of ant algorithms are combinatorial optimization and network problems, such as the traveling salesman problem (TSP) [4] , the vehicle routing problem (VRP) [5,6] , the job shop scheduling problem (JSP) [7] , the water distribution system (WDS) [8] , data mining [9] and network routing [10] , etc. However, all these algorithms are designed for solving discrete optimization problems.…”
Section: Introductionmentioning
confidence: 99%
“…Varios autores han utilizado, dentro del proceso de optimización, una función objetivo que sólo considera los costes de las tuberías (Maier et al, 2003;Zecchin et al, 2005). Otros han tomado en cuenta varios costes involucrados (Matías, 2003;Dandy y Engelhardt, 2006).…”
Section: La Función Objetivounclassified