Information Technology Reference
In-Depth Information
The total number of candidate designs is 10 454 , where 454 is the number of pipes
and 10 is the number of candidate diameters for each pipe.
Table 3. Design Results of Balerma Network
Algorithms
Minimal Cost
Number of Evaluations
45,400
45,400
45,400
45,400
Table 3 shows the computational results of various meta-heuristic algorithms such
as GA [16], SA [16], simulated annealing & tabu search (SA+TS) [16], and HS [14].
Results show that HS reached the least-cost design solution (cost =
Genetic Algorithm
Simulated Annealing
SA + TS
Harmony Search
€ 3.738 M
€ 3.476 M
€ 3.298 M
€ 2.601 M
€ 2.601 million)
with the same number of function evaluations, taking eight minutes on a desktop
computer with Intel Celeron 1.8GHz CPU.
2.5 New York City Network Example
Schaake and Lai [20] proposed the real-world example of New York City network
which has one reservoir, 19 demand nodes, and 21 pipes, as shown in Figure 4.
Fig. 4. Schematic of New York City network
Search WWH ::




Custom Search