An Improved Particle Swarm Optimization with Biogeography-Based Learning Strategy for Economic Dispatch Problems

Chen, Xu; Xu, Bin; Du, Wenli

doi:https://doi.org/10.1155/2018/7289674

Complexity

On this page

Abstract Introduction Results and Discussion Conclusion Data Availability Conflicts of Interest Acknowledgments Supplementary Materials References Copyright Related Articles

Special Issue

Bio-Inspired Learning and Adaptation for Optimization and Control of Complex Systems

View this Special Issue

Research Article | Open Access

Volume 2018 | Article ID 7289674 | https://doi.org/10.1155/2018/7289674

An Improved Particle Swarm Optimization with Biogeography-Based Learning Strategy for Economic Dispatch Problems

Xu Chen,^1,2Bin Xu,³and Wenli Du²

Academic Editor: Zhile Yang

Received03 Apr 2018

Revised02 May 2018

Accepted14 May 2018

Published12 Jul 2018

Abstract

Economic dispatch (ED) plays an important role in power system operation, since it can decrease the operating cost, save energy resources, and reduce environmental load. This paper presents an improved particle swarm optimization called biogeography-based learning particle swarm optimization (BLPSO) for solving the ED problems involving different equality and inequality constraints, such as power balance, prohibited operating zones, and ramp-rate limits. In the proposed BLPSO, a biogeography-based learning strategy is employed in which particles learn from each other based on the quality of their personal best positions, and thus it can provide a more efficient balance between exploration and exploitation. The proposed BLPSO is applied to solve five ED problems and compared with other optimization techniques in the literature. Experimental results demonstrate that the BLPSO is a promising approach for solving the ED problems.

1. Introduction

Economic dispatch (ED) is an important optimization task in power system operation and planning. The main objective of ED problems is to allocate generation among the committed generating units so as to meet the required load demand at minimum operating cost, with various physical constraints [1]. The cost of power generation is high, and economic dispatch can help in saving a significant amount of revenue [2].

In the original ED problem, the cost function for each generation unit is approximately represented by a single quadratic function, and traditional approaches based on mathematical programming techniques have been utilized to solve the ED problem, including the lambda-iteration method, gradient method, Newton’s method, linear programming, interior point method, and dynamic programming [3–5]. Usually, these methods are highly sensitive to starting points and rely on the assumption that the cost function needs to be continuous and convex. However, the practical ED problems exhibit nonconvex and nonsmooth characteristics because of valve-point effects, ramp-rate limit, multifuel cost, prohibited operating zones, and so on [6]. The traditional methods are not capable of efficiently solving the ED problems with these characteristics.

In the past decades, more and more researchers are turning to metaheuristic search (MS) algorithms for solving the ED problems. These methods have the ability to identify higher-quality solutions and can be grouped into three categories, as original, improved, and hybrid MS algorithms.

The first category consists of methods applied in their original version, such as genetic algorithm (GA) [7], particle swarm optimization (PSO) [8], differential evolution (DE) [9], ant colony optimization (ACO) [10], harmony search (HS) [11], artificial bee colony (ABC) [12], teaching-learning-based optimization (TLBO) [13], gravitational search algorithm (GSA) [14], firefly algorithm (FA) [15], biogeography-based optimization (BBO) [16, 17], bacterial foraging optimization (BFO) [18], imperialist competitive algorithm (ICA) [19], seeker optimization algorithm (SOA) [20], grey wolf optimization (GWO) [21], backtracking search algorithm (BSA) [22], and root tree optimization (RTO) [23].

The second refers to improved or modified methods derived from the original version, and the following are included: self-adaptive real-coded genetic algorithm (SARGA) [24], random drift PSO (RDPSO) [25, 26], fuzzy adaptive modified PSO (FAMPSO) [27], improved differential evolution (IDE) [28], shuffled differential evolution (SDE) [29], improved harmony search (IHS) [30], modified artificial bee colony (MABC) [31], incremental artificial bee colony (IABC) [32], ramp-rate biogeography-based optimization (RRBBO) [33], dynamic nondominated sorting biogeography-based optimization (Dy-NSBBO) [34], multistrategy ensemble biogeography-based optimization (MsEBBO) [35], and modified group search optimizer (MGSO) [36].

The third is the hybrid method in which two or more optimization techniques are combined, including hybrid genetic algorithm (HGA) [37], chaotic PSO with sequential quadratic programming (CPSO-SQP) [38], hybrid PSO and gravitational search algorithm (HPSO-GSA) [39], hybrid differential evolution algorithm based on PSO (DEPSO) [40], hybrid differential evolution with biogeography-based optimization (DE/BBO) [41], hybrid chemical reaction optimization with differential evolution (HCRO-DE) [42], and hybrid imperialist competitive-sequential quadratic programming (HIC-SQP) [43].

In this paper, an improved PSO algorithm with biogeography-based learning strategy is proposed to solve the ED problems. The main contributions of this paper are listed as follows: (1)A biogeography-based learning particle swarm optimization (BLPSO) algorithm which employs a biogeography-based learning strategy (BLS) is presented. The computational complexity of BLPSO is also analyzed.(2)By combining the feature of ED problems, the BLPSO-based economic dispatch method is developed.(3)BLPSO is applied to solve five ED problems with various practical constraints, and the experimental results demonstrate that the proposed method can obtain promising results for ED problems.

This paper is organized as follows: Section 2 briefly introduces the formulation of ED problems. Section 3 introduces the original PSO and its three variants. In addition, a biogeography-based learning particle swarm optimization algorithm is presented in this section. Section 4 addresses the implementation of BLPSO for solving ED problems. Section 5 provides the experimental results on five test systems. Finally, the paper is concluded in Section 6.

2. Formulation of ED Problems

The objective of the ED problem is to minimize the fuel cost of thermal power plants for a given load demand subject to various physical constraints.

2.1. Objective Function

The traditional fuel cost or objective function of the ED problem is the quadratic fuel cost equation of the thermal generating units and is given by where is the total number of generating units or generators, is the cost function of the th generating unit ($/hr), is the real output of the th generating units (in MW), and , , and are fuel cost coefficients of the th generator.

In some ED problems, the admission valves control the steam entering the turbine through separate nozzle groups. When the valve opens, the fuel cost will increase dramatically because of the wire drawing effect, and this makes the practical objective function have many nondifferentiable points [44]. Therefore, the fuel cost function often contains many nonsmooth ripple curves due to the presence of valve-point effects. The objective function when the valve-point effect is taken into account is represented as where and are nonsmooth fuel cost coefficients of the th generator with valve-point effects and is the minimum power generation limit of the th generator (in MW).

2.2. Optimization Constraints

2.2.1. Power Balance Constraint

The total generated power should be equal to the sum of the total system demand () and the total transmission network loss ():

The coefficient method is widely utilized to calculate the total transmission network loss . In such a way, can be calculated as follows: where , , and are the loss coefficients or coefficients. It can be seen that is an matrix.

2.2.2. Power Generation Limits

The power generation of each generator should be within its minimum and maximum limits: where and are the minimum and maximum power generation limits of the th generator.

2.2.3. Ramp-Rate Limits

The physical limitations of starting up and shutting down of generators impose ramp-rate limits, which are modeled as follows. The increase in generation is limited by

Similarly, the decrease is limited by where is the previous output power and and are the up-ramp limit and the down-ramp limit of the th generator, respectively.

Combining 6 and 7 with 5 results in the change of the effective operating or generation limits to

2.2.4. Prohibited Operating Zones

The prohibited operating zones (POZ) are due to steam valve operation or vibration in shaft bearing. The feasible operating zones of the th generator can be described as follows: where is the number of prohibited zones of the th generator. and are the lower and upper power output of the th prohibited zone of the th generator, respectively.

Combining the equations from 2 to 9, the ED problem can be formulated as

3. Particle Swarm Optimization and Its Three Variants

3.1. Particle Swarm Optimization

The PSO algorithm is a population-based metaheuristic algorithm which was firstly proposed by Eberhart and Kennedy [45]. It is based on the swarm intelligence theory, and the fundamental idea is that the optimal solution can be found through cooperation and information sharing among individuals in the swarm. In the past decade, PSO has gained increasing popularity due to its effectiveness in performing difficult optimization tasks.

In PSO, each individual is treated as a particle in the -dimensional space, with a position vector and a velocity vector . The particle updates its velocity and position according to the following equations: where is the personal best position of particle ; is the position of the best particle in the population; is the inertia weight; and are acceleration coefficients; and and are two random real numbers distributed uniformly within [0,1].

3.2. Comprehensive Learning Particle Swarm Optimization

Liang et al. [46] proposed a comprehensive learning PSO (CLPSO) which uses a novel comprehensive learning strategy whereby all other particle personal best positions are used to update a particle velocity. This strategy can preserve the diversity of the swarm to discourage premature convergence. CLPSO uses the following velocity updating equation: where is the learning exemplar for particle and is the learning exemplar indices for particle , which is generated based on tournament selection procedure. The CLPSO does not introduce any complex operations to the original simple PSO framework, and the main difference from the original PSO is the velocity update equation.

3.3. Social Leaning Particle Swarm Optimization

Cheng and Jin [47] proposed a social learning PSO (SLPSO) inspired by learning mechanisms in social learning of animals. The SLPSO is performed on a sorted swarm, and particles learn from any better particles in the current swarm. The particles learn from different particles based on the following equations: where is the learning probability for particle , is a randomly generated probability that satisfies , is the demonstrator of particle in the th dimension, is the mean position of the all particles in the current swarm, and is the social influence factor. In addition, the SLPSO adopts dimension-dependent parameter control methods to determine the three parameters, that is, the swarm size , the learning probability, and the social influence factor .

3.4. Biogeography-Based Learning Particle Swarm Optimization

In this paper, a biogeography-based learning particle swarm optimization (BLPSO) which employs a new biogeography-based learning strategy (BLS) [48] is proposed for the ED problems.

3.4.1. Biogeography-Based Learning Strategy

BLS is inspired from both from the comprehensive learning strategy of CLPSO [46] and biogeography-based optimization [49, 50]. It has two characteristics: (1)Each particle updates itself by using the combination of its own personal best position and personal best positions of all other particles, which is similar to the comprehensive learning strategy of CLPSO. This updating method enables the diversity of the swarm to be preserved to discourage premature convergence.(2)The migration operator of biogeography-based optimization is used to generate the learning exemplar for each particle, in which a ranking technique is employed to make particles learn more from particles with high-quality personal best positions. This can provide a more effecient balance between exploration and exploitation for the new PSO algorithm.

In BLS, each particle updates its velocity and position according to the following equations: where is the learning exemplar for particle ; is the learning exemplar indices for particle , which is generated by the biogeographic migration.

In the biogeographic migration, all particles are firstly sorted based on the value of their pbest from best to worst and assigned with ranking values. For a minimization problem, assume where is the subscript of the particle with the best pbest, is the subscript of the particle with the second best pbest, and is the subscript of the particle with the worst pbest; is the population size. Then, the rankings of particles are assigned as below:

Second, immigration and emigration rates are assigned for all particles. The immigration and emigration rates for all particles can be calculated as follows:

According to 20, the solution with the best will have the lowest immigration rate and highest emigration rate; and the solution with the worst will have the highest immigration rate and lowest emigration rate.

Third, the biogeography-based exemplar indices for particle can be generated based on the biogeography-based exemplar generation method, see Algorithm 1.

1 Input: particle index immigration rate and emigration rates
2 Output: learning exemplar indices
3 For toDDo // for each dimension
4 If Then
5 Utilize a roulette wheel to select a particle index with probability ;
6 ; // learn from other particle
7 Else
8 ; // learn from itself
9 End If
10 End For
11 If in all dimension Then
12 Randomly select a particle index ;
13 Randomly select a dimension ;
14 ;
15 End If
16 Return

3.4.2. Procedures of BLPSO

Using the BLS, the procedures of BLPSO can be outlined in Algorithm 2. It can be seen from Algorithm 2 that the structure of BLPSO is as simple as the classic PSO.

1 Stage 1: Initialization
2 For each particle Do
3 Initialize position and velocity ;
4 Evaluate the fitness and store the personal best position ;
5 Generate the learning exemplar indices using Algorithm 1;
6 Set the refreshing gap ;
7 End For
8 Stage 2: Main loop
9 For each particle Do
10 If the stagnation number Then
11 Generate the exemplar vector index using Algorithm 1;
12 Set ;
13 End If
14 Update velocity using Eq.16;
15 Update position using Eq.17;
16 Evaluate the new position ;
17 If is better than Then
18 Set , ;
19 Else
20 ;
21 End If
22 End For
23 Store swarm’s with the best
24 Stage 3: If the stop criterion is satisfied, the process is terminated. Otherwise, return to Stage 2.

In addition, based on lines 10–13 in Algorithm 2, it can be seen that Algorithm 1 is executed to generate new learning exemplar indices only when there is a stagnation for generations, which is used to save computational cost of the BLPSO. In other words, if new learning exemplar indices are generated for all particles in each generation, Algorithm 2 will be executed too frequently, and this may cost a large computational time, which is inappropriate for real-world ED problems.

3.4.3. Remarks

(1) Complexity Analysis. The computational costs of the original BLPSO algorithm involve the initialization (), biogeography-based exemplar generation method (), velocity and position update (), and evaluation () for each particle. Assume is the dimensionality of the optimization problem, is the population size, and is maximum number of functional evaluations allowed for the algorithm. The complexity of initialization, velocity and position update, and evaluation are , , and , respectively. The computational costs of biogeography-based exemplar generation method include population sorting , ranking assignment , immigration and emigration rate assignment , and migration operator . Therefore, .

The total computational complexity of BLPSO is . In general, the population size is often set to be proportional to the problem dimension (i.e., ) [47]. Thus, the complexity of BLPSO is .

(2) Compared with Previous Hybrid PSO/BBO Algorithms. Several hybrid PSO/BBO algorithms have been proposed in the literature. For example, Guo et al. [51] presented a biogeography-based particle swarm optimization with fuzzy elitism (BPSO-FE) for constrained engineering problems. In this BPSO-FE algorithm, the whole population is split into several subgroups, and BBO is employed to search within each subgroup while PSO for the global search. Mo and Xu [52] applied the position updating strategy of PSO to increase the diversity of population in BBO and develop a biogeography particle swarm optimization algorithm (BPSO) to optimize the paths in path network. However, there are some differences between BLPSO and them. First, the hybrid strategies of BLPSO, BPSO-FE, and BPSO are different. In BLPSO, the biogeography-based migration is used to generate the learning exemplar for each particle; while in BPSO-FE and BPSO, the biogeography-based migration is used as search operator. Second, the application areas of BLPSO, BPSO-FE, and BPSO are different. BLPSO is presented for ED problems, while BPSO-FE and BPSO are proposed for classical engineering optimization problems and robot path planning, respectively.

4. Implementation of BLPSO for ED Problems

When solving the ED problems using BLPSO, the following three important issues should be considered: initialization of population, constraint handling, and stopping criterion.

4.1. Initialization of Population

In BLPSO, each individual of the population is a solution of an ED problem. If there are units that must be operated to provide power to load, then the current position of the th particle can be given by where is the population size, is index of the generating unit, and is the generation power output of the th generating unit in the th particle.

4.2. Constraint Handling

One of the most important issues in solving ED problems is how to handle the quality and inequality constraints. There are four types of constraints in the ELD problems: power generation limits, ramp-rate limits, prohibited operating zone, and power balance constraint.

For power generation limit and ramp-rate limit constraints, the following strategy is employed:

For prohibited operating zone constraints, if is located in the th prohibited operating zone, that is, , it is truncated to the closest boundary of the th prohibited operating zone as follows: where and denote the lower and the upper bounds of prohibited operation zone of generator , respectively.

For the power balance constraint, a repaired operator together with a common penalty is employed [28]. The repaired operator is shown in Algorithm 3, and the objective function becomes where is the penalty coefficient and the penalty term is the measure of violation of the equality constraint.

1 Initialize a set
2 If Then
3 Randomly select a component from the set ;
4 While
5 Exclude from , and let the new set be ;
6 Randomly select a component from ;
7 ;
8 End While
9 Add an amount to , such as ;
10 Else If
11 Randomly select a component from the set ;
12 While
13 Exclude from , and let the new set be ;
14 Randomly select a component from ;
15 ;
16 End While
17 Add an amount to , such as ;
18 End If

4.3. Stopping Criterion

The BLPSO algorithm will be terminated if the maximum number of functional evaluations is reached.

5. Results and Discussion

To test the effectiveness of the proposed BLPSO algorithm, five different test systems of varying computational difficulty levels have been solved using BLPSO. The results obtained by BLPSO are compared with two PSO algorithms, comprehensive learning PSO (CLPSO) [46] and social leaning PSO (SLPSO) [47]. The results are also compared with several techniques reported in the literature whose abbreviations are listed in Table 1.

To compare the performance of the BLPSO, 50 independent trial runs are made, and the statistical results including the minimum, mean, maximum fuel cost, and standard deviation, as well as average run time, are tabulated for each test system. The parameters of BLPSO are set as follows: population size , inertia weight linearly decreases from 0.9 to 0.2, acceleration coefficient , and refreshing gap . The parameters of CLPSO and SLPSO are set as those recommended in their original papers. The maximum number of functional evaluations is set as 10,000; 50,000; 50,000; 50,000; and 200,000 for the five test systems, respectively. The programs are implemented in MATLAB language on a personal computer with a 3.2 GHz processor and 8 GB RAM.

5.1. Test System 1

This is a small system comprising 6 generators and meeting a load demand of 1263 MW and includes transmission loss, POZ, and ramp-rate limits. The system data are taken from [8, 53] and listed in Table S1. Table 2 presents the optimal generation values and fuel cost obtained by BLPSO. The obtained optimal cost is 15447.34 $/hr. It can be seen that the generation values satisfy the generation limit constraints and do not fall in the POZs.

Table 3 shows the comparison of the statistical results of different algorithms. In the table, the results obtained by BLPSO are compared with CLPSO, SLPSO, NPSO-LRS [54], MTS [55], TS [55], SA [55], GAAPI [56], HCRO-DE [42], DE [57], MABC [31], CBA [58], RDPSO [26], IRDPSO [26], and ST-IRDPSO [26]. It can be seen that the minimum and mean fuel costs obtained by BLPSO are similar to SLPSO and less than all the other methods with the exceptions of HCRO-DE [42]. In addition, the smaller value of standard deviation indicates that BLPSO is consistent. It is also important to note that the BLPSO is very efficient according to the average computational time (0.50 s), which is less than most of other methods. Figure 1 presents the convergence characteristics obtained by CLPSO, SLPSO, and BLPSO. From Figure 1, SLPSO has the fastest convergence speed, and BLPSO has the second. Both BLPSO and SLPSO can converge to the optimal cost after about 6000 functional evaluations.

5.2. Test System 2

This test system consists of 15 generators meeting a load demand of 2630 MW and includes transmission loss, POZ, and ramp-rate limits. The system data are taken from [8, 59] and listed in Table S2. Table 4 presents the optimal generations and the costs obtained. The optimal cost obtained by BLPSO is 32587.33 $/hr, and the generations satisfy the generation limit constraints.

Table 5 shows the comparison of the statistical results of the BLPSO and other algorithms, including CLPSO, SLPSO, CCPSO [60], HBMO [59], CIHBMO [59], FA [15], MsEBBO [35], DEPSO [40], SWT-PSO [61], IA [62], IODPSO-G [63], and IODPSO-L [63]. The minimum and mean fuel costs obtained by BLPSO are the least of all methods with the exceptions of HBMO [59]. The average computation time of BLPSO (2.85 s) is also very small. The convergence characteristics obtained by CLPSO, SLPSO, and BLPSO are plotted in Figure 2. SLPSO has the fastest convergence speed in the beginning, but it is surpassed by BLPSO and CLPSO in the end. Only BLPSO can get the optimal cost in this case.

5.3. Test System 3

This test system consists of 20 generators supplying a demand of 2500 MW. Transmission losses are included in this system. The cost coefficient and coefficient data are taken from [22, 64] and listed in Table S3. Table 6 presents the optimal generation values and fuel cost obtained by the BLPSO. The optimal obtained fuel cost is 62456.58 $/hr. It is seen that the all the generation limit constraints are satisfied.

Table 7 shows the comparison of the statistical results of different algorithms. In the table, the results obtained by BLPSO are compared with CLPSO, SLPSO, EHNN [65], -iteration [64], HM [64], GSO [66], CQGSO [66], BBO [22], BSA [22], and CBA [58]. It can be seen that the best fuel cost obtained by BLPSO is the least of all methods, and the mean fuel cost is the least of all methods with the sole exception of CBA [58]. In addition, the standard deviation and average computation time of BLPSO are both very small. Again, the BLPSO is efficient for this case. The convergence characteristics obtained by CLPSO, SLPSO, and BLPSO are plotted in Figure 3.

5.4. Test System 4

This test system consists of 38 generators, and the demand of this system is 6000 MW. The system data are taken from [28, 41] and listed in Table S4. Table 8 presents the optimal generation values and cost obtained by BLPSO. The optimal cost is 9417208.19 $/hr. It is seen that the generations satisfy the generation limit constraints.

The results obtained by BLPSO are compared with those obtained by CLPSO, SLPSO, New-PSO [67], PSO-TVAC [67], HS [68], HHS [68], BBO [41], DE/BBO [41], MsEBBO [35], and IDE [28], as shown in Table 9. It can be seen that the minimum and mean fuel costs obtained by BLPSO are the least of all the methods. The average computation time of BLPSO is 2.89 s, smaller than all methods, with the exception of CLPSO. The convergence characteristics obtained by CLPSO, SLPSO, and BLPSO are plotted in Figure 4.

5.5. Test System 5

In order to study the performance of the BLPSO on high-dimensional ED problems, a large system with 110 generators is considered. The demand of this system is 15,000 MW, and the system data are taken from [69, 70] and listed in Table S5. Table 10 presents the optimal generation values and cost obtained by BLPSO. The optimal cost is 197988.16 $/hr.

Table 11 shows the comparison of the statistical results of BLPSO and other algorithms, including CLPSO, SLPSO, SAB [71], SAF [71], SA [71], ORCCRO [72], BBO [72], DE/BBO [72], and OIWO [69]. The minimum, mean, and maximum fuel costs obtained by BLPSO are the least of all the methods. Meanwhile, the smaller value of standard deviation indicates that BLPSO is consistent. The average computation time of BLPSO is also very small compared with other methods. The convergence characteristics obtained by CLPSO, SLPSO, and BLPSO are presented in Figure 5.

6. Conclusion

This paper has presented a biogeography-based learning particle swarm optimization (BLPSO) for solving the economic dispatch (ED) problems, which is nonlinear, nonconvex, and discontinuous in nature, with numerous equality and inequality constraints. In the BLPSO, a biogeography-based learning strategy is used to generate the learning exemplar for each particle, in which particles learn more from high-quality particles. The biogeography-based learning strategy can provide a more effective balance between exploration and exploitation for the BLPSO.

The BLPSO was applied to five test systems with various constraints such as power balance, POZs, and ramp-rate limits. Transmission losses have also been included in some systems. The experimental results show that the fuel costs obtained by BLPSO are either comparable or lower than those reported by other methods. The application to a 110-unit system shows that the BLPSO is also capable of handling high-dimensional ED problems.

In the future, we are planning to extend the BLPSO to solve other more complicated ED problems, such as dynamical ED problems and environmental ED problems. We are also interested in applying the BLPSO to other optimization problems in energy field such as solar photovoltaic modeling [73].

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was supported in part by the Natural Science Foundation of Jiangsu Province (Grant no. BK 20160540), China Postdoctoral Science Foundation (Grant no. 2016M591783), and Fundamental Research Funds for the Central Universities (Grant no. 222201717006).

Supplementary Materials

Table S1∼Table S5 provides the system data of the five test systems studied in this paper. (1) Table S1: the system data of test system 1 (6-unit system). (2) Table S2: the system data of test system 2 (15-unit system). (3) Table S3: the system data of test system 3 (20-unit system). (4) Table S4: the system data of test system 4 (38-unit system). (5) Table S5: the system data of test system 5 (110-unit system). (Supplementary Materials)

References

N. Ghorbani and E. Babaei, “Exchange market algorithm for economic load dispatch,” International Journal of Electrical Power & Energy Systems, vol. 75, pp. 19–27, 2016.
View at: Publisher Site | Google Scholar
K. T. Chaturvedi, M. Pandit, and L. Srivastava, “Self-organizing hierarchical particle swarm optimization for nonconvex economic dispatch,” IEEE Transactions on Power Systems, vol. 23, no. 3, pp. 1079–1087, 2008.
View at: Publisher Site | Google Scholar
R. A. Jabr, A. H. Coonick, and B. J. Cory, “A homogeneous linear programming algorithm for the security constrained economic dispatch problem,” IEEE Transactions on Power Systems, vol. 15, no. 3, pp. 930–936, 2000.
View at: Publisher Site | Google Scholar
J. P. Zhan, Q. H. Wu, C. X. Guo, and X. X. Zhou, “Fast λ -iteration method for economic dispatch with prohibited operating zones,” IEEE Transactions on Power Systems, vol. 29, no. 2, pp. 990-991, 2014.
View at: Publisher Site | Google Scholar
Z. Li, W. Wu, B. Zhang, H. Sun, and Q. Guo, “Dynamic economic dispatch using Lagrangian relaxation with multiplier updates based on a quasi-Newton method,” IEEE Transactions on Power Systems, vol. 28, no. 4, pp. 4516–4527, 2013.
View at: Publisher Site | Google Scholar
T. Niknam, “A new fuzzy adaptive hybrid particle swarm optimization algorithm for non-linear, non-smooth and non-convex economic dispatch problem,” Applied Energy, vol. 87, no. 1, pp. 327–339, 2010.
View at: Publisher Site | Google Scholar
C.-L. Chiang, “Genetic-based algorithm for power economic load dispatch,” IET Generation, Transmission & Distribution, vol. 1, no. 2, pp. 261–269, 2007.
View at: Publisher Site | Google Scholar
Z.-L. Gaing, “Particle swarm optimization to solving the economic dispatch considering the generator constraints,” IEEE Transactions on Power Systems, vol. 18, no. 3, pp. 1187–1195, 2003.
View at: Publisher Site | Google Scholar
N. Noman and H. Iba, “Differential evolution for economic load dispatch problems,” Electric Power Systems Research, vol. 78, no. 8, pp. 1322–1331, 2008.
View at: Publisher Site | Google Scholar
S. Pothiya, I. Ngamroo, and W. Kongprawechnon, “Ant colony optimisation for economic dispatch problem with non-smooth cost functions,” International Journal of Electrical Power & Energy Systems, vol. 32, no. 5, pp. 478–487, 2010.
View at: Publisher Site | Google Scholar
A. Vasebi, M. Fesanghary, and S. M. T. Bathaee, “Combined heat and power economic dispatch by harmony search algorithm,” International Journal of Electrical Power & Energy Systems, vol. 29, no. 10, pp. 713–719, 2007.
View at: Publisher Site | Google Scholar
S. Hemamalini and S. P. Simon, “Artificial bee colony algorithm for economic load dispatch problem with non-smooth cost functions,” Electric Power Components and Systems, vol. 38, no. 7, pp. 786–803, 2010.
View at: Publisher Site | Google Scholar
M. Basu, “Teaching–learning-based optimization algorithm for multi-area economic dispatch,” Energy, vol. 68, pp. 21–28, 2014.
View at: Publisher Site | Google Scholar
S. D. Beigvand, H. Abdi, and M. La Scala, “Combined heat and power economic dispatch problem using gravitational search algorithm,” Electric Power Systems Research, vol. 133, pp. 160–172, 2016.
View at: Publisher Site | Google Scholar
X.-S. Yang, S. S. Sadat Hosseini, and A. H. Gandomi, “Firefly algorithm for solving non-convex economic dispatch problems with valve loading effect,” Applied Soft Computing, vol. 12, no. 3, pp. 1180–1186, 2012.
View at: Publisher Site | Google Scholar
A. Bhattacharya and P. K. Chattopadhyay, “Biogeography-based optimization for different economic load dispatch problems,” IEEE Transactions on Power Systems, vol. 25, no. 2, pp. 1064–1077, 2010.
View at: Publisher Site | Google Scholar
U. Krishnasamy and D. Nanjundappan, “Hybrid weighted probabilistic neural network and biogeography based optimization for dynamic economic dispatch of integrated multiple-fuel and wind power plants,” International Journal of Electrical Power & Energy Systems, vol. 77, pp. 385–394, 2016.
View at: Publisher Site | Google Scholar
R. Vijay, “Intelligent bacterial foraging optimization technique to economic load dispatch problem,” International Journal of Soft Computing and Engineering (IJSCE), vol. 2, no. 2, pp. 2231–2307, 2012.
View at: Google Scholar
E. Bijami, M. Jadidoleslam, A. Ebrahimi, J. Askari, and M. M. Farsangi, “Implementation of imperialist competitive algorithm to solve non-convex economic dispatch problem,” Journal of the Chinese Institute of Engineers, vol. 37, no. 2, pp. 232–242, 2014.
View at: Publisher Site | Google Scholar
B. Shaw, V. Mukherjee, and S. P. Ghoshal, “Seeker optimisation algorithm: application to the solution of economic load dispatch problems,” IET Generation, Transmission & Distribution, vol. 5, no. 1, pp. 81–91, 2011.
View at: Publisher Site | Google Scholar
M. Pradhan, P. K. Roy, and T. Pal, “Grey wolf optimization applied to economic load dispatch problems,” International Journal of Electrical Power & Energy Systems, vol. 83, pp. 325–334, 2016.
View at: Publisher Site | Google Scholar
M. Modiri-Delshad and N. A. Rahim, “Solving non-convex economic dispatch problem via backtracking search algorithm,” Energy, vol. 77, pp. 372–381, 2014.
View at: Publisher Site | Google Scholar
Y. Labbi, D. B. Attous, H. A. Gabbar, B. Mahdad, and A. Zidan, “A new rooted tree optimization algorithm for economic dispatch with valve-point effect,” International Journal of Electrical Power & Energy Systems, vol. 79, pp. 298–311, 2016.
View at: Publisher Site | Google Scholar
P. Subbaraj, R. Rengaraj, and S. Salivahanan, “Enhancement of self-adaptive real-coded genetic algorithm using Taguchi method for economic dispatch problem,” Applied Soft Computing, vol. 11, no. 1, pp. 83–92, 2011.
View at: Publisher Site | Google Scholar
J. Sun, V. Palade, X.-J. Wu, W. Fang, and Z. Wang, “Solving the power economic dispatch problem with generator constraints by random drift particle swarm optimization,” IEEE Transactions on Industrial Informatics, vol. 10, no. 1, pp. 222–232, 2013.
View at: Publisher Site | Google Scholar
W. T. Elsayed, Y. G. Hegazy, M. S. El-bages, and F. M. Bendary, “Improved random drift particle swarm optimization with self-adaptive mechanism for solving the power economic dispatch problem,” IEEE Transactions on Industrial Informatics, vol. 13, no. 3, pp. 1017–1026, 2017.
View at: Publisher Site | Google Scholar
T. Niknam, H. D. Mojarrad, and M. Nayeripour, “A new fuzzy adaptive particle swarm optimization for non-smooth economic dispatch,” Energy, vol. 35, no. 4, pp. 1764–1778, 2010.
View at: Publisher Site | Google Scholar
D. Zou, S. Li, G. G. Wang, Z. Li, and H. Ouyang, “An improved differential evolution algorithm for the economic load dispatch problems with or without valve-point effects,” Applied Energy, vol. 181, pp. 375–390, 2016.
View at: Publisher Site | Google Scholar
A. Srinivasa Reddy and K. Vaisakh, “Shuffled differential evolution for economic dispatch with valve point loading effects,” International Journal of Electrical Power & Energy Systems, vol. 46, pp. 342–352, 2013.
View at: Publisher Site | Google Scholar
L. D. S. Coelho and V. C. Mariani, “An improved harmony search algorithm for power economic load dispatch,” Energy Conversion and Management, vol. 50, no. 10, pp. 2522–2526, 2009.
View at: Publisher Site | Google Scholar
D. C. Secui, “A new modified artificial bee colony algorithm for the economic dispatch problem,” Energy Conversion and Management, vol. 89, pp. 43–62, 2015.
View at: Publisher Site | Google Scholar
S. Ozyon and D. Aydin, “Incremental artificial bee colony with local search to economic dispatch problem with ramp rate limits and prohibited operating zones,” Energy Conversion and Management, vol. 65, pp. 397–407, 2013.
View at: Publisher Site | Google Scholar
S. K. Gachhayat and S. K. Dash, “Non-convex multi objective economic dispatch using ramp rate biogeography based optimization,” International Journal of Electrical Computer Energetic Electronic and Communication Engineering, vol. 11, pp. 545–549, 2017.
View at: Google Scholar
H. Ma, Z. Yang, P. You, and M. Fei, “Multi-objective biogeography-based optimization for dynamic economic emission load dispatch considering plug-in electric vehicles charging,” Energy, vol. 135, pp. 101–111, 2017.
View at: Publisher Site | Google Scholar
G. Xiong, D. Shi, and X. Duan, “Multi-strategy ensemble biogeography-based optimization for economic dispatch problems,” Applied Energy, vol. 111, pp. 801–811, 2013.
View at: Publisher Site | Google Scholar
K. Zare, M. T. Haque, and E. Davoodi, “Solving non-convex economic dispatch problem with valve point effects using modified group search optimizer method,” Electric Power Systems Research, vol. 84, no. 1, pp. 83–89, 2012.
View at: Publisher Site | Google Scholar
D. He, F. Wang, and Z. Mao, “A hybrid genetic algorithm approach based on differential evolution for economic dispatch with valve-point effect,” International Journal of Electrical Power & Energy Systems, vol. 30, no. 1, pp. 31–38, 2008.
View at: Publisher Site | Google Scholar
J. Cai, Q. Li, L. Li, H. Peng, and Y. Yang, “A hybrid FCASO-SQP method for solving the economic dispatch problems with valve-point effects,” Energy, vol. 38, no. 1, pp. 346–353, 2012.
View at: Publisher Site | Google Scholar
S. Jiang, Z. Ji, and Y. Shen, “A novel hybrid particle swarm optimization and gravitational search algorithm for solving economic emission load dispatch problems with various practical constraints,” International Journal of Electrical Power & Energy Systems, vol. 55, pp. 628–644, 2014.
View at: Publisher Site | Google Scholar
S. Sayah and A. Hamouda, “A hybrid differential evolution algorithm based on particle swarm optimization for nonconvex economic dispatch problems,” Applied Soft Computing, vol. 13, no. 4, pp. 1608–1619, 2013.
View at: Publisher Site | Google Scholar
A. Bhattacharya and P. K. Chattopadhyay, “Hybrid differential evolution with biogeography-based optimization for solution of economic load dispatch,” IEEE Transactions on Power Systems, vol. 25, no. 4, pp. 1955–1964, 2010.
View at: Publisher Site | Google Scholar
P. K. Roy, S. Bhui, and C. Paul, “Solution of economic load dispatch using hybrid chemical reaction optimization approach,” Applied Soft Computing, vol. 24, pp. 109–125, 2014.
View at: Publisher Site | Google Scholar
M. J. Morshed and A. Asgharpour, “Hybrid imperialist competitive-sequential quadratic programming (HIC-SQP) algorithm for solving economic load dispatch with incorporating stochastic wind power: a comparative study on heuristic optimization techniques,” Energy Conversion and Management, vol. 84, pp. 30–40, 2014.
View at: Publisher Site | Google Scholar
A. Meng, J. Li, and H. Yin, “An efficient crisscross optimization solution to large-scale non-convex economic load dispatch with multiple fuel types and valve-point effects,” Energy, vol. 113, pp. 1147–1161, 2016.
View at: Publisher Site | Google Scholar
R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Micro Machine and Human Science, 1995. MHS '95., Proceedings of the Sixth International Symposium on, pp. 39–43, Nagoya, Japan, Japan, October 1995.
View at: Publisher Site | Google Scholar
J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281–295, 2006.
View at: Publisher Site | Google Scholar
R. Cheng and Y. Jin, “A social learning particle swarm optimization algorithm for scalable optimization,” Information Sciences, vol. 291, pp. 43–60, 2015.
View at: Publisher Site | Google Scholar
X. Chen, H. Tianfield, C. Mei, W. Du, and G. Liu, “Biogeography-based learning particle swarm optimization,” Soft Computing, vol. 21, no. 24, pp. 7519–7541, 2017.
View at: Publisher Site | Google Scholar
S. Dan, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, pp. 702–713, 2008.
View at: Google Scholar
X. Chen, H. Tianfield, W. Du, and G. Liu, “Biogeography-based optimization with covariance matrix based migration,” Applied Soft Computing, vol. 45, pp. 71–85, 2016.
View at: Publisher Site | Google Scholar
W. Guo, W. Li, Q. Zhang, L. Wang, Q. Wu, and H. Ren, “Biogeography-based particle swarm optimization with fuzzy elitism and its applications to constrained engineering problems,” Engineering Optimization, vol. 46, no. 11, pp. 1465–1484, 2014.
View at: Publisher Site | Google Scholar
H. Mo and L. Xu, “Research of biogeography particle swarm optimization for robot path planning,” Neurocomputing, vol. 148, pp. 91–99, 2015.
View at: Publisher Site | Google Scholar
Z.-L. Gaing, “Closure to “Discussion of ‘Particle swarm optimization to solving the economic dispatch considering the generator constraints’”,” IEEE Transactions on Power Systems, vol. 19, no. 4, pp. 2122-2123, 2004.
View at: Publisher Site | Google Scholar
A. I. Selvakumar and K. Thanushkodi, “A new particle swarm optimization solution to nonconvex economic dispatch problems,” IEEE Transactions on Power Systems, vol. 22, no. 1, pp. 42–51, 2007.
View at: Publisher Site | Google Scholar
S. Pothiya, I. Ngamroo, and W. Kongprawechnon, “Application of multiple tabu search algorithm to solve dynamic economic dispatch considering generator constraints,” Energy Conversion and Management, vol. 49, no. 4, pp. 506–516, 2008.
View at: Publisher Site | Google Scholar
I. Ciornei and E. Kyriakides, “A GA-API solution for the economic dispatch of generation in power system operation,” IEEE Transactions on Power Systems, vol. 27, no. 1, pp. 233–242, 2012.
View at: Publisher Site | Google Scholar
W. T. Elsayed and E. F. El-Saadany, “A fully decentralized approach for solving the economic dispatch problem,” IEEE Transactions on Power Systems, vol. 30, no. 4, pp. 2179–2189, 2015.
View at: Publisher Site | Google Scholar
B. R. Adarsh, T. Raghunathan, T. Jayabarathi, and X.-S. Yang, “Economic dispatch using chaotic bat algorithm,” Energy, vol. 96, pp. 666–675, 2016.
View at: Publisher Site | Google Scholar
T. Niknam, H. D. Mojarrad, H. Z. Meymand, and B. B. Firouzi, “A new honey bee mating optimization algorithm for non-smooth economic dispatch,” Energy, vol. 36, no. 2, pp. 896–908, 2011.
View at: Publisher Site | Google Scholar
J.-B. Park, Y.-W. Jeong, J.-R. Shin, and K. Y. Lee, “An improved particle swarm optimization for nonconvex economic dispatch problems,” IEEE Transactions on Power Systems, vol. 25, no. 1, pp. 156–166, 2010.
View at: Publisher Site | Google Scholar
S. Chalermchaiarbha and W. Ongsakul, “Stochastic weight trade-off particle swarm optimization for nonconvex economic dispatch,” Energy Conversion and Management, vol. 70, pp. 66–75, 2013.
View at: Publisher Site | Google Scholar
V. S. Aragón, S. C. Esquivel, and C. A. Coello Coello, “An immune algorithm with power redistribution for solving economic dispatch problems,” Information Sciences, vol. 295, pp. 609–632, 2015.
View at: Publisher Site | Google Scholar
Q. Qin, S. Cheng, X. Chu, X. Lei, and Y. Shi, “Solving non-convex/non-smooth economic load dispatch problems via an enhanced particle swarm optimization,” Applied Soft Computing, vol. 59, pp. 229–242, 2017.
View at: Publisher Site | Google Scholar
C.-T. Su and C.-T. Lin, “New approach with a Hopfield modeling framework to economic dispatch,” IEEE Transactions on Power Systems, vol. 15, no. 2, pp. 541–545, 2000.
View at: Publisher Site | Google Scholar
A. Y. Abdelaziz, S. F. Mekhamer, M. A. L. Badr, and M. Z. Kamh, “Economic dispatch using an enhanced Hopfield neural network,” Electric Power Components and Systems, vol. 36, no. 7, pp. 719–732, 2008.
View at: Publisher Site | Google Scholar
M. Moradi-Dalvand, B. Mohammadi-Ivatloo, A. Najafi, and A. Rabiee, “Continuous quick group search optimizer for solving non-convex economic dispatch problems,” Electric Power Systems Research, vol. 93, pp. 93–105, 2012.
View at: Publisher Site | Google Scholar
K. T. Chaturvedi, M. Pandit, and L. Srivastava, “Particle swarm optimization with time varying acceleration coefficients for non-convex economic power dispatch,” International Journal of Electrical Power & Energy Systems, vol. 31, no. 6, pp. 249–257, 2009.
View at: Publisher Site | Google Scholar
M. Fesanghary and M. M. Ardehali, “A novel meta-heuristic optimization methodology for solving various types of economic dispatch problem,” Energy, vol. 34, no. 6, pp. 757–766, 2009.
View at: Publisher Site | Google Scholar
A. K. Barisal and R. C. Prusty, “Large scale economic dispatch of power systems using oppositional invasive weed optimization,” Applied Soft Computing, vol. 29, pp. 122–137, 2015.
View at: Publisher Site | Google Scholar
S. Orero and M. R. Irving, “Large scale unit commitment using a hybrid genetic algorithm,” International Journal of Electrical Power & Energy Systems, vol. 19, no. 1, pp. 45–55, 1997.
View at: Publisher Site | Google Scholar
K. K. Vishwakarma and H. M. Dubey, “Simulated annealing based optimization for solving large scale economic load dispatch problems,” International journal of engineering research & technology (IJERT), vol. 1, 2012.
View at: Google Scholar
K. Bhattacharjee, A. Bhattacharya, and S. H. n. Dey, “Oppositional real coded chemical reaction optimization for different economic dispatch problems,” International Journal of Electrical Power & Energy Systems, vol. 55, pp. 378–391, 2014.
View at: Publisher Site | Google Scholar
X. Chen, B. Xu, C. Mei, Y. Ding, and K. Li, “Teaching–learning–based artificial bee colony for solar photovoltaic parameter estimation,” Applied Energy, vol. 212, pp. 1578–1588, 2018.
View at: Publisher Site | Google Scholar

Copyright

Copyright © 2018 Xu Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

1914

Downloads

1397

Citations