An Improved Differential Evolution Method Based on the Dynamic Search Strategy to Solve Dynamic Economic Dispatch Problem with Valve-Point Effects

and Applied Analysis 3 The main improvement is reflected in the following three aspects. (1) DE/rand/1 strategy is replaced by DE/best/1 in local search strategy. The DE/best/1 strategy can make the population search toward the best feasible solution and guide the population into the feasible region quickly. (2) Constraint pretreatment (Section 4.5) is used to handle infeasible individuals of the population in local search strategy in order to reduce the number of infeasible solutions. (3) Quantization orthogonal crossover (QOX) operator is introduced into global search strategy. QOX operator can search the better solution with less computation time, so that it can enhance global search ability. At the same time, considering that infeasible solutions may be obtained by QOX operator. The information of infeasible solutions is utilized reasonably, which can provide important help to search the globally optimal solution, especially when the optimal solution is in the feasible region boundary. Finally, the proposed method is implemented to solve the DED problem by three test systems, and the feasibility and efficiency of the proposed algorithm are shown by simulation results. Compared with other optimization methods reported in the literature, the proposed IDEBDSS method can obtain better solutions in a shorter computation time alongwith higher effectiveness and robustness. This paper is organized as follows. DED problem formulation is introduced in Section 2. Since DE is used as the search algorithm in this paper, it is briefly introduced in Section 3. In Section 4, IDEBDSS algorithm is presented for solving DED problem in detail. In Section 5, the effectiveness of the proposed algorithm is verified through a numerical example. Finally, some conclusions are given in Section 6. 2. Formulation of DED Problem 2.1. Objective Function. TheDED problem is nonconvex and nondifferentiable considering valve-point effects [42]. The objective of the classic DED problem is to minimize the total fuel cost function associated with theN generating units for T intervals in the given dispatch horizon as follows [43]:


Introduction
The dynamic economic dispatch (DED) is very important optimization problems in the power system operation, which is a complicated nonlinear dynamic constrained problem [1], and its purpose is to find the optimal combination of power outputs of all generating units to minimize the total fuel cost and meanwhile satisfy all equality and inequality constraints during all the dispatch periods.Generally, the generating unit fuel cost function is represented approximately as a nonlinear convex quadratic function.In this approximation, the valuepoint effects of generator are not considered, so that the inaccuracy of the dispatch results is inevitable.However, in reality, convex fuel cost function cannot be exhibited by the generating units due to steam valves in large steam turbines, and the generator exhibits the characteristics of nonsmooth and nonconvex mathematically.From the perspective of math, the DED problem with valve-point effects can be categorized as a dynamic nonlinear optimization problem with nonsmooth and nonconvex characteristics subjected to various equality and inequality constraints.Therefore, it is a challenge to find the optimal dispatch result in a reasonable computation time.
Over the past decades, many traditional mathematic methods have been developed to solve the DED problem, including linear programming (LP) [2], quadratic programming (QP) [3], Lagrangian relaxation (LR) [4], and dynamic programming (DP) [5].However, when applying these traditional methods to DED problem with valve-point effects, the global optimal solution can hardly be achieved due to their drawbacks.For example, large errors would be generated during the process of linearizing the DED model when using LP to solve DED problem.For QP, the objective function needs to be transformed for the reason that the objective function must be continuous and differentiable, which would bring inaccuracy to the final solution.Though DP can solve the DED problem without imposing any restrictions, it suffers from the "curse of dimensionality, " when applied in large scale power systems; it may not converge in a possible time.
GA suffers from the premature convergence, and the encoding and decoding strategies adopted by GA causes it to take a long computation time to achieve convergence.For EP, though it can obtain a reasonable solution occasionally, the slow convergence may lead to a long computation time in DED problem.TS algorithm can escape from local optima and fast convergence to the global optimum; however, it may not reach the global optimum solution in a reasonable computational time when the initial solution is far away from the region where the global optimal solution exists.For PSO and DE methods, the premature convergence may trap the algorithm into the local optimum and reduce their optimization ability when solving DED problems.Recently, some hybrid methods are proposed to solve DED problems with nonsmooth fuel cost functions, including PSO-SQP [27], hybrid BBO-DE [28], hybrid EP-SQP [29], and BCO-SQP [30].These hybrid methods utilize the features of different algorithms to keep balance between global search capability and local search capability and obtain good actual effects.However, these hybrid methods still have drawbacks for solving the DED problem, such as choosing suitable parameter values and slowing the convergence because of the large amount of iteration procedures.
Differential evolution algorithm (DE), first proposed by Storn and Price, is one of the best global optimization methods [31].Compared with other evolutionary algorithms, DE is a simple yet efficient optimizer with fewer parameters.In recent years, DE has been applied successfully to solve optimization problems in various fields due to its high efficiency, such as economic dispatch optimization problem [11], transient stability constrained optimal power flow problem [32], network reconfiguration problem of distribution systems problem [33], optimal reactive power dispatch problem [34], and electromagnetic inverse scattering problems [35].With the popularization of DE, it has drawn more and more attention of the scholars all over the world [36][37][38][39].However, DE still has its drawbacks that need to be improved, such as how to select suitable parameter values for DE, how to avoid premature convergence for DE, and how to enhance the global search capability in searching the global optimal solution rapidly and efficiently.Furthermore, it does not consider the constraints of the complicated optimization problem in the canonical version of DE.In view of the defects of the standard DE, some improved DE algorithms are proposed to solve DED or ELD problems.In [11], a combined version of the DE algorithm with the generator of chaos sequences and sequential quadratic programming (SQP) technique is proposed to optimize the performance of economic dispatch problems of which the DE with chaos sequences is the global optimizer, and the SQP is used to fine-tune the DE run in a sequential manner.Duvvuru and Swarup [12] proposed a novel hybrid algorithm that integrated interior point method (IPM) and differential evolution (DE) for solving economic load dispatch (ELD) problem with valve-point effect.Firstly, interior point method is used to solve the problem without valve-point loading, and the obtained solution is called .Then, an initial population around  was generated using a new strategy.Finally, the ELD problem with valve-point loading could be solved using DE.He et al. [13] combined the GA algorithm with the deferential evolution (DE) and sequential quadratic programming (SQP) technique to improve the performance of the algorithm, of which GA is the main optimizer, while the DE and SQP are used to adjust the solution of the GA running.In [18], a modified differential evolution approach (MDE) is proposed to solve the DED problem, and its most important contribution is to handle constraints effectively by devising feasibility-based selection comparison techniques and heuristic search rules.Although some improved DE algorithm has already been proposed to deal with the constraints of the complicated optimization problem in DED problem, it still needs further study on how to improve the overall implementation efficiency of combining DE algorithm and constraint handling.
Therefore, to overcome the defects of the mentioned above, an improved differential evolution method based on the dynamic search strategy is proposed to solve DED problem in this paper.The research of this paper mainly focuses on the following three issues.Firstly, it is difficult to select suitable parameter values in the traditional DE methods, so that a dynamic parameter control mechanism based on chaotic sequences is applied to determine the parameter settings adaptively by virtue of the randomness and regularity of the chaos mechanism.Secondly, it is very difficult to handle the constraints in DED.In this paper, multiobjective concepts without penalty function method are used to handle the complex constraints of DED problem, and DED problem is converted into a biobjective optimization problem.Meanwhile, Pareto dominance which is usually used in multiobjective optimization is adopted to compare the individuals in the population.In order to improve the efficiency of constraint handling during the process of evolution, an effective rough preadjustment method is proposed to handle constraint violation of the infeasible individuals.Notably, violation of equality constraint can be handled by allocating constraint violations to units according to their regulatory abilities, which is different from handling constraint violation by selecting generators randomly [26,40].By using the proposed method, regulation of each unit becomes more reasonable, and the solving efficiency is also improved.Thirdly, in order to improve algorithm performance in solving DED problem, a new dynamic searching strategy including global search strategy and local search strategy is proposed to solve DED problem in this paper, which is different from dynamic search strategy in [41].
The main improvement is reflected in the following three aspects.(1) DE/rand/1 strategy is replaced by DE/best/1 in local search strategy.The DE/best/1 strategy can make the population search toward the best feasible solution and guide the population into the feasible region quickly.(2) Constraint pretreatment (Section 4.5) is used to handle infeasible individuals of the population in local search strategy in order to reduce the number of infeasible solutions.(3) Quantization orthogonal crossover (QOX) operator is introduced into global search strategy.QOX operator can search the better solution with less computation time, so that it can enhance global search ability.At the same time, considering that infeasible solutions may be obtained by QOX operator.The information of infeasible solutions is utilized reasonably, which can provide important help to search the globally optimal solution, especially when the optimal solution is in the feasible region boundary.Finally, the proposed method is implemented to solve the DED problem by three test systems, and the feasibility and efficiency of the proposed algorithm are shown by simulation results.Compared with other optimization methods reported in the literature, the proposed IDEBDSS method can obtain better solutions in a shorter computation time along with higher effectiveness and robustness.
This paper is organized as follows.DED problem formulation is introduced in Section 2. Since DE is used as the search algorithm in this paper, it is briefly introduced in Section 3. In Section 4, IDEBDSS algorithm is presented for solving DED problem in detail.In Section 5, the effectiveness of the proposed algorithm is verified through a numerical example.Finally, some conclusions are given in Section 6.

Formulation of DED Problem
2.1.Objective Function.The DED problem is nonconvex and nondifferentiable considering valve-point effects [42].The objective of the classic DED problem is to minimize the total fuel cost function associated with the  generating units for  intervals in the given dispatch horizon as follows [43]: where  is the total fuel cost over the whole dispatch periods,  is the number of intervals over the dispatch horizon,  is the number of generating units,    is the power output of the th unit at the th dispatch interval, and   (   ) is the fuel cost of th unit at the output of    .Traditionally, the fuel cost function of each unit can be described as a quadratic function as shown in where   ,   , and   are cost coefficients of the th unit.However, in reality, when steam admission valve starts to open, a sharp increase in fuel loss would be added to the fuel cost curve due to the wire drawing effects, which is named as valve-point effects.In order to model the DED problem with the consideration of valve-point effects more accurately, the objective function of the problem is described as a superposition of quadratic and sinusoidal functions, and meanwhile a set of nonsmooth cost functions are imported into DED problem.The cost function with valve-point effects can be represented as follows [44]: where   and ℎ  are cost coefficients of generator .
where    is the total load demand at  interval.   is the transmission loss.System loss is a function of unit power production which can be calculated using the results of load flow problem [42] or Kron's loss formula known as -matrix coefficients [45].In this work -matrix coefficients method is used to calculate system loss as follows: where  , is the ,th element of the loss coefficient square matrix,  0 is the th element of the loss coefficient vector, and  00 is the loss coefficient constant.
(2) Power Operating Limits.Consider  ,min ≤    ≤  ,max ,  = 1, 2, . . ., ,  = 1, 2, . . ., , ( where  ,min and  ,max are the minimum and maximum outputs of th generator, respectively. (3) Generating Unit Ramp Rate Limits.The output power change rate of the thermal unit must be in an acceptable range to avoid undue stress on the boiler and combustion equipments [42].The ramp rate limits of generation units are stated as follows: where UR  and DR  are the up-ramp and down-ramp limits of the th generator, respectively.

Overview of Differential Evolution Algorithm
Differential evolution algorithm (DE) is a simple and powerful population-based stochastic optimization algorithm [31].
During the evolution, DE implements mutation, crossover, and selection operations to update the population.The initial population of DE is randomly generated within the decision space, which consists of NP (NP is population size) dimensional vector, namely,   →  , = ( ,1, ,  ,2, , . . .,  ,, ),  = 1, 2, . . ., NP, where  denotes the current generation number.The key idea behind DE is to make use of mutation and crossover operations to yield a trial vector   →  , for each target vector   →  , .Afterwards, a selection operation is executed between the trial vector   →  , and the target vector   →  , to get better generation individuals.The mutation, crossover, and selection operations of this DE algorithm are explained as follows.
) is generated by a mutation operator.The following two mutation strategies are frequently used in many literatures [46]; that is, where  1 ,  2 , and  3 are generated randomly in the range of [1, NP] and satisfy  1 ̸ =  2 ̸ =  3 ,   →  best, is the best individual in the population at generation , and  is a control parameter, often called as scaling factor.The control parameter  ∈ [0, 1] is a real constant parameter supplied by users, which controls the amplification of the differential variation.
Crossover Operation.Crossover operation is applied to increase the diversity of the population.After the mutation operation, the trial vector   →  , is generated by a binomial crossover operation on the target vector   →  , and the mutant vector   → V , using the following scheme: where  rand is a randomly chosen integer from [1, ], which ensures that   →  , gets at least one element from   → V , .Otherwise, the population may not evolve for there is no new generated solution.Rand () is the th evaluation of a uniform random number generator between 0 and 1 and CR ∈ [0, 1] is a crossover control parameter called as crossover rate, which is the user-defined crossover constant that controls the recombination.
Selection Operation.Selection operation is implemented by comparing the target vector   →  , against the trial vector   →  , .According to the value of fitness, the better one will be selected to participate in the next generation.The selection operation can be expressed as follows: where ( , ) is the fitness value of the target vector   →  , and ( , ) is the fitness value of the trial vector   →  , .Recently, some successful applications of an evolutionary algorithm (EA) combined with chaotic sequences have been reported in optimization problems [11,55].Due to the randomness, ergodicity, and regularity of the chaos mechanism, chaotic sequences applied in an EA can increase the exploitation capability of the algorithm in the search space and enhance its convergence property.Therefore, in this paper, a dynamic parameter control mechanism based on chaotic sequences is applied for adjusting the parameter value settings of DE adaptively during the searching progress.The Logistic map used in this paper is described as follows:
Similarly, the parameter CR can be updated adaptively by CR 0 ∈ (0, 1) , CR 0 ∉ {0.25, 0.5, 0.75} , 4.2.Orthogonal Crossover.In a discrete single objective optimization problem, when there are  factors with each factor having  levels, the search space consists of   combinations of levels.To find the best level for each factor, it is generally inevitable to do one experiment for every combination of factor levels.If  and  are very big, it will take a long time to do all experiments.In this case, experimental design methods can be used for sampling a small number of well representative combinations for testing.Orthogonal design is regarded as a very popular experimental design tool.In orthogonal design, a series of orthogonal arrays with different numbers of factors and different levels can be provided, and all columns in orthogonal array can be evaluated independently without considering the influence of one another (a number of such arrays can be found in http://www.york.ac.uk/depts/maths/tables/orthogonal.htm).
An orthogonal array for  factors with  levels and  combinations is often denoted by   (  ).Quantization orthogonal crossover (QOX) proposed in [56] has been successfully applied into differential evolution [57] and genetic algorithm [56] to improve the exploration ability.In this paper, QOX is imported into the proposed algorithm to enhance the global search ability during evolution procedure.4.3.Structure of Individuals.For an individual , which consists of  generating units and  intervals, the array of control variable vector can be described as where    is the output of the th generating unit at the th dispatch interval, satisfying the real power output limit constraints as is shown by (6).

Initialization of the Population.
In this paper, the power outputs are initialized randomly in the feasible range, which satisfy the constraints given by (6).The initial power outputs can be generated randomly by where Rand (0, 1) is a randomly generated number between 0 and 1, which obeys uniform distribution, and  ,max and  ,min are the maximum and minimum outputs of generating unit , respectively.Above all, it is important to deal with ().If the () of infeasible individuals during the evolution is not properly dealt with, it may produce more infeasible individuals in the population and thus the () values of these individuals tend to be large.Hence, more iteration is needed to handle these constraint violations in the evolution.Consequently, in every evolution in this paper, in order to increase the number of feasible individuals as well as cut down the constraint violation of infeasible individuals in the present population, a rough preadjustment is made on the constraint violation of the infeasible individuals firstly in the case that there are not too many infeasible individuals.Notably, this preadjustment can help to improve the efficiency at the same time.This paper comes up with a new constraint handing approach in which constraint violation of infeasible individual is allocated proportionally to each unit according to their regulatory abilities.The steps are as follows.

Constraint Handling
Step 1. Set current interval  = 1, where  denotes the dispatch interval index.
where   ,min and   ,min are the up and down limits of the th unit during the th dispatch interval.Then, the outputs of each unit at current interval are adjusted to feasible horizon by where Δ  −min and Δ  max − , respectively, denote distance between    and up and down limits of the th unit at current interval and  denotes the number of units.
Step 4. Calculate the amount of load balance constraint violation at the th dispatch interval   voil according to (18).Set  = 0, where  denotes the iteration number of the preadjustment operation.Consider Step 5. Step 6.When   voil > 0, the outputs of unit would decrease, and Δ  −min = 0 should not be taken into account at this time.Calculate   −coef−min value of each unit by (19), where   −coef−min denotes allocation coefficient of each unit at the th dispatch interval.Then, calculate Δ  −app value of each unit by (20), where Δ  −app denotes allocation value of each unit at the th dispatch interval.Afterwards, modify the power outputs of all units at the th dispatch interval by (21) and go to Step 8. Consider Step 7. When   voil < 0, the outputs of unit would increase, and Δ  max − = 0 should not be taken into account at this time.Calculate   −coef−max value and Δ  −app value of each unit by (22) and (23), respectively.Afterwards, modify the power outputs of all units at the th dispatch interval by (24), and then go to Step 8. Consider Step 8.If the modified    does not violate the power output limit constraints given by ( 6), then go to Step 9; otherwise, modify the value of    by ( 16) and then go to Step 9.
Step 9. Calculate   voil by (18), and then set  =  + 1.If  <  max , where  max is the maximum iteration number of the preadjustment operation, then go to Step 5; otherwise, go to Step 10.
Step 10.If  is not the last interval, set  =  + 1, and then return to Step 2 or else go to Step 11.
Step 11.Sum the violation value  all () of this individual by Step 12.The process is terminated.) from the nondominated individuals of set  will be compared with other infeasible solutions in population.Figure 1 shows infeasible solutions obtained by QOX in the two-dimensional search space.From Figure 1, no matter if the mutant vector is feasible solution or infeasible solution (the triangle points represent the trial vectors obtained by QOX), infeasible solution may exist in trial vectors obtained by QOX.The procedure of the proposed method is shown in Algorithm 1.

Local Search Strategy.
In the local search, both the addition of feasible individuals and the quick entry into the feasible region are necessary due to the small number of feasible individuals in the population.Firstly, the constraint handling method (refer to Section 4.5) is used for constraint pretreatment on the infeasible individual of the population, which increases the number of feasible individuals and reduces the constraint violation of those infeasible ones.Secondly, DE/best/1, one of the classic versions of DE, is considered in local search strategy, and it usually has fast convergence speed because the DE/best/1 strategy mainly relies on the best individual in the population.The procedure of the proposed method is described as follows.
Step 1.For infeasible individual, the constraint handling method is adopted to carry out constraint pretreatment.
Step 2. Each target vector (i.e.,   →  , ) in the population NP is used to produce a mutation vector (i.e.,   → V , ) by the DE/best/1 mutation operation.Step 3. Crossover operation by ( 8) is used to produce a trial vector   →  , .

Procedure of IDEBDSS for DED Problems.
To sum up, the flow chart of the proposed IDEBDSS can be illustrated as shown by Figure 2.

Description of the Test Systems.
In order to verify the feasibility and effectiveness of the proposed IDEBDSS algorithm for practical application that involves nonsmooth valve-point effects, three test systems are designed for solving DED problem.
Test System 1.This test system is a ten-unit system which considers nonsmooth valve-point effects but neglects the transmission losses.Test System 2. The DED problem of the 10-unit system discussed in system 1 is solved with the consideration of transmission losses.
Test System 3. 30 units are included in this large-scale power system, which is tripled to test system 1.For all the three test systems, the dispatch horizon  is set as one day which is divided into 24 intervals.The technical data of the units, as well as the demand for the load, are taken from [52].

Parameter Settings for Simulation.
The proposed IDEBDSS method is coded with C++ programming language and executed in P-IV 2.2 GHz personal computer to solve DED problems mentioned above.To verify modification work effectiveness, the simulation is executed for 40 times from different initial populations (every population consists of 70 solutions), and the best dispatch result among these 40 independent simulations is selected as the final optimization solution.Meanwhile, in order to verify effectiveness of the proposed algorithm for solving DED problems, both  IDEBDSS and standard DE are implemented to solve the same problems.The parameters of these two algorithms are listed in Table 1.

Test System 1.
According to the dispatch results and the convergence performance of the proposed IDEBDSS method and other methods, a comparison study is implemented to solve the DED problem of this test system.Table 2 gives the comparison of the best total fuel cost, average total fuel cost, average CPU execution time, and the number of independent simulations to obtain the dispatch results by IDEBDSS method and other methods.Convergence process of the best total fuel cost obtained by IDEBDSS method compared and standard DE method are shown in Figure 3.The details of the best dispatch result obtained by the proposed IDEBDSS method are provided in Table 3, which also demonstrates whether the constraints of the problem are satisfied or not.
In order to have a relatively fair comparison of the computation effort, the CPU times obtained from different methods are converted into a common base by the CPU chip frequency [45].Notably, the total CPU time of the different algorithms is estimated based on the CPU speed of 2.2 GHz as they are all executed using a Pentium IV-2.2 GHz CPU personal computer.The equalized CPU time of an algorithm can be computed by (26).By means of the equalized transformation in computation time, it would be more meaningful to compare computational effort of different methods.The results are shown in column 6 of Table 2. Consider equalized CPU tims (s) =  eq × actual CPU time (s) ,  eq = given CPU Speed (GHz) 2.2 GHz . ( From the dispatch results in Table 2, it is clear that the proposed IDEBDSS method can provide the best dispatch result compared with other methods.The total fuel cost of the best dispatch result for test system 1 in all dispatch periods achieves 1016873$, which is the best dispatch result of all.At the same time, in terms of the average results, the proposed IDEBDSS method also achieves the best result among all the algorithms.Besides, it is noted that the dispatch results of the proposed IDEBDSS are very close to those of the EPSO.However, the average result of IDEBDSS is only 0.0395% better than that of EBSO, but it is even better than the best result of EBSO.It also indicates that the proposed IDEBDSS method is very competitive compared with EBSO.
From the average CPU time in Table 2, it can be noticed that the proposed method needs less computational effort and they are significantly faster in speed than other methods except for EBSO.Although the proposed IDEBDSS method takes slightly longer CPU time than EBSO, the number of iterations of IDEBDSS is less than EBSO.To be specific, the number of iterations in EBSO method is 700 [54], while that in IDEBDSS is only 600.What is more, the results of the IDEBDSS method are better than those of the EBSO method.Therefore, it can be concluded that the proposed IDEBDSS method will take less iteration number to get better results than the EBSO method.
In order to better display the robustness of the proposed IDEBDSS method, the results of the 40 independent trials are provided in Figures 5 and 6.From Figure 5, it can be seen that the total fuel cost of the best dispatch result obtained by the proposed IDEBDSS method from each independent trial fluctuates in a relatively small range.At the same time, Figure 6 shows that the distribution of the results falls into the same numerical interval that the 40 independent trials produce and that the results of the 40 independent trials approximately follow a normal distribution.From Figures 5 and 6, all these total fuel costs distribute between the minimum and the maximum values without obvious bias, which approximately follow a normal distribution.Hence, the proposed method has a good robustness for solving the DED problem.
In addition, in order to verify the improvement in convergence property of the proposed method relative to the standard DE for solving DED problem, the variation of the best total fuel cost during the evolutionary process is examined.From Figure 3, it is clear that the best total fuel cost of the proposed IDEBDSS method declines sharply at the beginning of iteration compared with that of standard DE, but slowly at later stages.Meanwhile, it can be seen that the proposed IDEBDSS method can get better solutions much more quickly than standard DE method.Therefore, the proposed method has better convergence property and can get the optimal solution much more quickly compared with standard DE.Moreover, the following conclusions about the modification work can be drawn from Figure 3: (1) in order to improve the parameter settings of DE, the dynamic parameter control mechanism based on chaotic sequences is adopted in the proposed IDEBDSS method to improve the convergence property of DE, without consuming extra computation time; (2) by using the local search strategy, the population can approach the feasible region more quickly in the early stage of evolution, which can accelerate convergence; (3) by using the global search strategy, search capability of the globally optimal solution can be enhanced.Although the implementation of QOX operator may need a little extra computation time, it can improve the search ability for globally optimal solution when QOX is embedded into the proposed IDEBDSS method.Thus, the IDEBDSS method can obtain the globally optimal solution with larger probability in the later stage of evolution.
Finally, the last column in Table 3 provides the sum of power generations for all units.From the analysis of the dispatch results, it can be seen that the dispatch results obtained by the proposed IDEBDSS method satisfy all kinds  of complicated constraints of DED problem, thus reducing the total fuel cost effectively.

Test System 2.
Test system 2 consists of ten generating units with the consideration of transmission losses.The coefficient values are taken from [47].The total generation cost obtained by the proposed algorithm for 24 h is 1035061$ and the corresponding generation schedule is shown in Table 5.As can be seen from Table 4, the best and the average total fuel costs of the proposed IDEBDSS method for test system 2 are higher than test system 1 due to considering of the transmission losses.Actually, the power balance constraints given by (4) without transmission losses  are easiy to implement, and CPU execution time can also be shortened, which leads to the computation time difference for the two test systems.At the same time, the comparison results of the best total cost, as well as the average total cost and the CPU execution time, between the proposed algorithm and other methods are shown in Table 4, from which it can be deduced that the proposed IDEBDSS method provides the lowest total fuel cost among all the above mentioned methods.
Besides, it can also be found that the dispatch results of the proposed IDEBDSS method are very close to those of the CSADHS method.The average total fuel cost of the IDEBDSS method is only 0.0150% better than that of the CSADHS method, but the average result of the IDEBDSS method is even better than the best result of the CSADHS method.
Abstract and Applied Analysis  Meanwhile, the IDEBDSS method spends no more than onefifth of average CPU time of the CSADHS method, which is the shortest except for the EBSO method for calculation time.
For the case with similar dispatch results in test system 1, the dispatch results of IDEBDSS are much better than those of EPSO in test system 2, which confirms the good performance of IDEBDSS in test system with transmission losses.

5.3.3.
Test System 3. Compared with test system 1, test system 3 is a 30-unit large-scale power system, which is more complex in the nonconvex, nonlinear, and nonsmooth characteristics of the solution space.In order to prove the efficiency of the proposed algorithm for solving DED problems of largescale system, the proposed IDEBDSS method and standard DE method are employed to optimize this test system, and the corresponding convergence property comparisons are illustrated in Figure 4.As can be seen, the proposed IDEBDSS method can get better results continuously in the later stage of evolution, indicating that the proposed IDEBDSS method can avoid being trapped into locally optimal area effectively.That is to say, IDEBDSS has better convergence property than standard DE.Table 6 shows the comparison results of the best total fuel cost, average total fuel cost, and average CPU execution time between the proposed IDEBDSS method and other mentioned methods.It can be found easily that IDEBDSS can get the best results both in minimum and average cost relative to other mentioned algorithms.Meanwhile, the results of IDEBDSS are very close to those of EBSO, and the solution of the former is just 0.1377% higher than that of the later.Although the improvement is relatively limited, it is more than three times higher than that observed in test system 1 (0.0395%).From viewpoint of the execution time, IDEBDSS consumes the shortest time among all methods but EBSO and the time difference between IDEBDSS and EBSO can dwindle to near insignificance with the scale-up of system from system 1 to 3.
In addition, for this test system, the average CPU time of IDEBDSS is 0.8 min, which is only about twice as that of test system 1.This demonstrates that the proposed method is efficient and superior for large-scale application.

Conclusions
In this paper, an improved differential evolution method based on the dynamic search strategy is presented to solve DED problem with valve-point effects.A new constraint pretreatment method is proposed to effectively handle complicated constraints of the DED problem, and an effective dynamic search strategy is adopted to improve convergence and global search capability during the evolution.Meanwhile, a dynamic parameter control mechanism based on Logistic map chaotic sequences is embedded into the proposed method to adjust the parameter values of DE adaptively.Finally, three different test systems are solved by the proposed method, and the dispatch results are compared directly with those of other methods in the recent literature.The result indicates that the proposed method can obtain not only the minimum total fuel cost but also a shorter CPU computation time compared with other methods.No matter in small scale or large scale, the simulation results confirm the superiority of the proposed method in both the solution quality and the computation efficiency.Therefore, the proposed IDEBDSS method can be a new and effective approach for solving DED problem.

Figure 1 :
Figure 1: Infeasible solutions obtained by QOX in the two-dimensional search space.

1
Rand < (NP − NF)/NP and compute the number of NF in population Initialize the individuals of the population Set the parameters of the algorithm; then set the number of the iteration g = 0 Use the logistic map by (11) and (12) to If the best individual?Termination and then output final calculate F and CR schedule results randomly by using (14) Evaluate the f(x), G(x) for each individual, Mutation (DE/rand/1) Mutation (DE/rand/1) Comparing and selection g > g max

Figure 3 :
Figure 3: Convergence process of the best solution obtained by IDEBDSS and DE methods for test system 1.

Figure 4 :
Figure 4: Convergence process of the best solution obtained by IDEBDSS and DE methods for test system 3.
IDEBDSS Cost distribution obtained by IDEBDSS

Figure 5 :
Figure 5: Cost distribution obtained by IDEBDSS for test system 1.

Figure 6 :
Figure 6: Distribution of the results of the 40 independent trials for test system 1.
4.1.Chaotic Sequences for Adjusting the Parameter Value Settings of DE Adaptively.The performance of DE is significantly influenced by the value settings of control parameters  (scale factor) and CR (crossover rate).Proper value settings are important for the successful application of the DE algorithm.
Pareto dominates  2 (denoted as  1 ≺  2 ). 1 and  2 are considered nondominated with each other if they cannot Pareto dominate each other.If there is no other  * satisfying  * ≺  in the population,  is called a nondominated individual in the population.
, : Target vector;   → V , : Mutant vector;   →  , : Trial vector;   : th individual in population;  infeasible : The set of all the infeasible solution of current population; Step 1. Choose the smallest of () value forms the feasible solutions, denoted as  best Step 2. For  = 1, . . ., NP, do Step 2.1.Generate a   → V , by DE/rand/1 Step 2.2.If (  =  best ) Step 2.2.1.Mix   → V , and   →  , by making use of QOX based on   (  ) to generate  trial vectors.Calculation () values and () values of  trial vectors Step 2.2.2.Choose the one feasible solutions with the smallest of () value as   →  , in  trial vectors.Step 2.2.3.If there are infeasible solutions in  trial vectors, it will be added into set  Else Step 2.2.4.Mix   → V , and   →  , by (8) to generate   →  , .End if Step 2.3.Calculate the () value and the () value for the trial vector   →  , .Step 2.4.If   →  , ≺   →  , ,   →  , will replace the   →  , , else no replacement occurs.Step 3. If  are not empty set.Select the best infeasible individual (i.e., the infeasible solution with the lowest degree of constraint violation) of the non-dominated individuals in the set , denoted as  best infeasible .Step 4. If  best infeasible exists.Compared with pareto dominance between  best infeasible and  infeasible ,  best infeasible is used to replace a randomly selected pareto dominated individual in  infeasible .Algorithm 1: Procedure of global search strategy.

Table 1 :
Parameter settings for IDEBDSS and DE.

Table 2 :
Comparison of results with different methods for test system 1.

Table 3 :
Best solutions obtained by the proposed IDEBDSS method for test system 1 (MW).

Table 4 :
Comparison of results with different methods for test system 2.

Table 5 :
Best solutions obtained by the proposed IDEBDSS method for test system 2 (MW).

Table 6 :
Comparison of results with different methods for test system 3.