The Ismail Abad irrigation network is located in 7 kilometers North West of Noorabad city in Lorestan province. Land area of this project is 1000 ha. Figure 1 depicts the schematic network of Ismael Abad. This network

consists of 18 pipes and 19 nodes are. In Table 1, the hydraulic details and arrangement of pipes for water distribution networks Ismael Abad is presented.

This project consists of two kinds of steel pipe that is used. Polyethylene pipe material is used for pipe sizes equal or less than 500 mm and GRP for greater sizes. Pipe specifications are given in Table 2.

Differential Evolution (DE) algorithm is a branch of evolutionary programming developed by Rainer Storn and Kenneth Price [31] [32] for optimization problems over continuous domains. In DE, each variable’s value is represented by a real number. The advantages of DE are its simple structure, ease of use, speed and robustness. DE is one of the best genetic type algorithms for solving problems with the real valued variables. Differential Evolution is a design tool of great utility that is immediately accessible for practical applications. DE has been used in several science and engineering applications to discover effective solutions to nearly intractable problems without appealing to expert knowledge or complex design algorithms. Differential Evolution uses mutation as a search mechanism and selection to direct the search toward the prospective regions in the feasible region. Genetic Algorithms generate a sequence of populations by using selection mechanisms. Genetic Algorithms use

crossover and mutation as search mechanisms. The principal difference between Genetic Algorithms and Differential Evolution is that Genetic Algorithms rely on crossover, a mechanism of probabilistic and useful exchange of information among solutions to locate better solutions, while evolutionary strategies use mutation as the primary search mechanism.

Differential Evolution (DE) is a parallel direct search method which utilizes NP D-dimensional parameter vectors.

As a population for each generation G. NP does not change during the minimization process. The initial vector population is chosen randomly and should cover the entire parameter space. As a rule, we will assume a uniform probability distribution for all random decisions unless otherwise stated. In case a preliminary solution is available, the initial population might be generated by adding normally distributed random deviations to the nominal solution x_nom,0. DE generates new parameter vectors by adding the weighted difference between two population vectors to a third vector. Let this operation be called mutation. The mutated vector’s parameters are then mixed with the parameters of another predetermined vector, the target vector, to yield the so-called trial vector. Parameter mixing is often referred to as “crossover” in the ES-community and will be explained later in more detail. If the trial vector yields a lower cost function value than the target vector, the trial vector replaces the target vector in the following generation. This last operation is called selection. Each population vector has to serve once as the target vector so that NP competitions take place in one generation. More specifically DE’s basic strategy can be described as follows:

In general, an optimization problem either linear or nonlinear consists of an objective function which is subjected to some constraints. The classical linear optimization method may results in a branch which consists of many pipe sizes. In practice, this is considered as a strong weak point. On the other hand, linear optimization methods yields pipe sizes which are not commercially available. This leads to choose the pipe size close to that obtained by optimization. Consequently, the hydraulic conditions and cost of the network system will be different from that obtained by the optimization technique which means that the design is not optimum any more. The developed model guarantees obtaining the global optimum of pressurized branched irrigation networks.

The total annual cost of a pressurized branched irrigation network system can be introduced as:

where, L_N = length of pipe number N, N = subscript representing pipe number in the network, CP_N = unit length cost of pipe N, which is a function of pipe diameter, NP = Number of pipes, CPU_I = cost of the Ith pump which is a function of the total power of the pump required, NPU = Number of pumps in the network system, C_en = annual energy cost per unit head,

The annual energy cost per unit head of the pump can be expressed as:

In which, C_fu is the fuel cost ($/kWh); O_t is the number of annual system operating in hours; EAE is the equivalent annualized escalating energy cost factor; h_e is the overall pump efficiency in fraction.

In which, e is the decimal equivalent annual rate of energy escalation; y is the life time of the design in years, and r is the decimal equivalent annual interest rate. HPI = total dynamic head of the Ith pump, CRF = capital return factor which is calculated as below:

where, P_I = total power of the Ith pump and K = pump station cost per unit total power ($/KW).

Multiplying the terms of the first summation of equation (1) by zero-unity variables such as X_NJ, and adding for all commercially available pipes yields:

ND = number of commercially available pipe Diameter,

Shahinezhad et al. [30] to ensure of performance the model, MILP model was used for four different branch network. This study showed that MILP method, with the above objective function is the ability to provide absolute optimum for branch network.

According the literature review in the differential evolution algorithm (Suribabu, [33] ) and other evolutionary algorithms, to find the best conditions for optimizing water distribution network, at first considering an initial population of 100 member (N = 100) and generation of 500 (G = 500) to find the coefficients of F and CR, 18 different combinations of these factors was examined. It should be mentioned, at study each of the condition in this algorithm, three runs were conducted and the optimal run was chosen for that.

In general, in this study, in total 120 runs with different conditions of the algorithm was implemented, in order to derive the optimal of water distribution networks by using differential evolution algorithm.

In the first step, to obtain the best conditions for algorithm that provide the most optimum and do not face local optimum problem, 18 combinations of different modes for the coefficients F and CR were examined. The results are shown in Table 3.

The Results show that median values for the coefficients of F and Cr provide the optimum situation and cause DE algorithm not to be trapped in local optimum. The most optimal answers for coefficients are 0.6 and 0.5 for F and Cr coefficients, respectively. These values matched with the results of Suribabu [33] .

Scale factor (F) can increase the accuracy of the search. The smaller coefficient, the shorter steps needs to be taken for an accurate research. But the problem is that the algorithm may be trapped in local optimum and it cannot be withdrawn. On the other hand, the higher value of F, the more area will be searched, but the best optimum situation may not be obtained.

After finding the best combination of coefficients values F and CR, algorithms for solving the independent populations were examined. For this purpose, the population of 4, 25, 50, 100, 500 and 1000 members were studied in two generations (G = 50 and 100). Figure 3 shows these results.

Based on the DE algorithm, the initial population is very important to select the initial three members, when the population gets more, the selection of four initial members has more variety, which causes the algorithm to reach convergence.

According to Figure 4, it is clear that by increasing population, the optimal cost will be lower. In addition It is proved that the increasing population will extend the domain of the search; and more members are used for optimization.

Finally, the best combination of coefficients and population were used to examine the effect of generations’ number, so ten generations (30, 40, 50, 100, 200, 300, 500, 1000, 2000, and 3000) were studied. The results are shown in Table 4.

Table 4 indicates that the generation number 200 is suitable for optimizing water distribution networks. This results show that DE algorithm for optimizing water distribution networks in the generation of 200 gives acceptable results.

The increase in time per the number of population has almost a linear trend, which indicates the effect of population in the runtime algorithm. Hence specifying suitable population to obtain an optimal result is very important.

The runtime algorithm for 100 members of population and 50 generations is 935s and 100 generation is 1950s. According to the numbers, the running time of the algorithm to reach new member in each generation takes an average of 0.19s (Figure 5).

Results of Figure 6 indicate a fairly linear relationship between runtime and number of generations.

In general it can be said that the population and number of generations to run the algorithm, in order to optimize water distribution network is 100 and 200, respectively that requires nearly an hour to reach the optimal answer.

So it can be revealed that one of the advantages of this algorithm is the high speed runtime. Another advantage is rapid convergence of the algorithm, that takes 16 minutes (G = 50 and N = 100) to reach convergence.

The network has been optimized with conditions Cr = 0.5, F = 0.6, 100 members of population and 200 generations in the differential evolution algorithm. The algorithm makes relationship between Epanet and MATLAB software to optimize the water distribution network. The combination of optimum pipe diameter is shown in Table 5.

This combination of optimal diameter is the best diameter to have the optimal costs. According to these network diameters, hydraulic conditions in Table 6 and Table 7 are for pipes and nodes.

Due to the hydraulic conditions in the pipes, it can be seen from Table 6, each pipe is in standard conditions and velocity in each pipe is in permitted range. Table 7 shows pressure in each node in permitted range. So itcan be said in this optimized network the constraint of pressure and velocity is considered.

Shahinezhad et al. [30] optimize this network by using mixed integer linear programming method. In this paper the network is optimized by differential evolution algorithm (DE) and the results are compared with absolute optimum that is obtained from mixed integer linear programming (MILP) by Shahinezhad et al. [30] . Table 8 shows the results of optimizing from differential evolution algorithm, MILP and classic method.

In all optimization methods, the factor of time is important. MILP method to find absolute optimum needs more time than DE algorithm, that it’s one of the disadvantages of this method. Although MILP Method achieves the absolute optimum, this method is not recommended in the engineering works that the time is important. The biggest problem in this method is that this method cannot be used in the loop network.

So you cannot use this method to networks that combine the loop and branched network.

Figure 7 shows Schematic comparison between optimum diameter of the DE algorithm and MILP method.

On the other hand, MILP method is able to solve the tree network and gives absolute optimum, but is unable to solve loop and complex network (loop and branch). In this study, we compared the algorithm (DE) with this method, Therefore, According to great potential of DE, the algorithm can be used in the loop, branch and complex network.

In Table 9 optimal cost obtained by each method can be seen.

According to Table 9, it can be said that algorithm presents very good results for optimizing water distribution network. So that Differential Evolution algorithm estimates cost, 1.57% more than the lowest cost (MILP

Method). That according to less time that is required to run, DE algorithm is very efficient. While the classic method estimated cost 13.7 percent more than the lowest cost (MILP Method).