Harmony Search Algorithms for Water and Environmental Systems - Music-Inspired Harmony Search Algorithm: Theory and Applications - page 114

Table 1. Design Results of Two-Loop Network

Algorithms Minimal Cost Number of Evaluations

Genetic Algorithm
Simulated Annealing
Shuffled Frog Leaping
Cross Entropy
Scatter Search
Harmony Search

$ 419,000
$ 419,000
$ 419,000
$ 419,000
$ 419,000
$ 419,000

7,467
> 25,000
11,155
35,000
3,215
1,121

2.3 Hanoi Network Example

Fujiwara and Khang [15] first proposed the real-world example of Hanoi network located
in Vietnam with a reservoir, 31 demand nodes, and 34 pipes, as shown in Figure 2.

Fig. 2. Schematic of Hanoi network

The number of total candidate designs is 6 34 = 2.87 × 10 26 , which is derived because
the number of pipes is 34 and the number of candidate diameters for each pipe is 6.
Table 2 shows the computational results using various meta-heuristic algorithms
such as GA [16], ant colony optimization (ACO) [17], CE [12], SS [13], and HS [14].
Results show that HS reached the optimal design solution (cost = $ 6.018 million)
with the least number of function evaluations comparing with other algorithms. It
takes 20 seconds to solve this problem using the same desktop computer mentioned