Research Article  Open Access
A Parallel Adaptive Particle Swarm Optimization Algorithm for Economic/Environmental Power Dispatch
Abstract
A parallel adaptive particle swarm optimization algorithm (PAPSO) is proposed for economic/environmental power dispatch, which can overcome the premature characteristic, the slowspeed convergence in the late evolutionary phase, and lacking good direction in particles’ evolutionary process. A search population is randomly divided into several subpopulations. Then for each subpopulation, the optimal solution is searched synchronously using the proposed method, and thus parallel computing is realized. To avoid converging to a local optimum, a crossover operator is introduced to exchange the information among the subpopulations and the diversity of population is sustained simultaneously. Simulation results show that the proposed algorithm can effectively solve the economic/environmental operation problem of hydropower generating units. Performance comparisons show that the solution from the proposed method is better than those from the conventional particle swarm algorithm and other optimization algorithms.
1. Introduction
The electric power generation scheduling is one of the main optimization tasks in power systems. In planned economy pattern, the electric power generation dispatch is to realize power balance under the law of equal consumed energy ratio. With the electric power market reform, the breakup of monopolies creates competition, especially in the power generation side which realized the separation of electricity generation and transmission. In order to get much revenue, the power grid company attempts to schedule the committed generating units’ outputs to meet the load demand at minimum production and transmission (operating) costs. This is the classical economic dispatch (ED) which is routinely used to minimize the market purchasing cost while fulfilling the operational constraints. In 1990s, due to the amendment of clean air act, economic/environmental dispatch (EED) formed at the base of emission dispatch (EMD), which simultaneously minimizes both fuel costs and pollutant emissions [1, 2]. EED problem is a multiobjective mathematical programming problem which is concerned with the attempt to obtain the optimal solution. For these two contradictory objectives, fuel costs and pollutant emissions, individual optimization could not serve the purpose. Most techniques had been used to solve the economic/environmental dispatch (EED) problem. One of the solutions is to transfer two different objectives into a single objective by treating the emission as a constraint with a permissible limit [3]. Then some conventional methods such as the Bundle method [4], nonlinear programming [5, 6], mixed integer linear programming [7–10], dynamic programming [11], quadratic programming [12], the Lagrange relaxation method [13], network flow method [14], and direct search method [15] are used to solve such problems. It is unfortunately that the EED problem is a highly nonlinear optimization problem. Therefore, conventional optimization methods that make use of derivatives and gradients, in general, are not able to locate or identify the global optimum. There is still another research direction which converted the EED problem to a single objective by linear combination of different objectives as a weighted sum [16, 17] or price penalty factor approach [18]. Modern heuristic optimization techniques proposed by researchers based on operational research and artificial intelligence concepts are used to solve the problem. The studies on evolutionary algorithms have shown that these methods can be efficiently used to eliminate most of the difficulties of classical methods. The main intelligent algorithms include genetic algorithm [19], particle swarm optimization algorithm [20], and differential evolutionary algorithm [21]. Genetic algorithm is an optimizing searching method based on a biology evolutionary theory, which has disadvantages such as slow astringency and precocity [22]. Particle swarm optimization (PSO) is a newly emerging method for the swarm intelligence optimization, which has low precision and divergence problems [23]. Differential evolutionary algorithm (DE) can avoid the dependence effectively and has a good stability, but it is very time consuming and less efficient [24].
So it is still the kernel study topic that how to design a hybrid algorithm which works with high adaptability, high precision, and rapid computing efficiency.
In this paper, we developed PAPSO approach for solving the EED problem in the power system. The proposed multiobjective method for the EED was demonstrated to be feasible by the application in two different power systems.
This paper is organized as follows. In Section 2, the problem formulation is presented. In Section 3, the proposed approach is introduced. In Section 4, we present the studies of application cases and demonstrate the potential of the presented algorithm. Finally, in Section 5, the conclusions are given.
2. Problem Formulation
Economic/environmental generation dispatch is an optimization problem of determining the schedule of real power outputs of generating units within a power system with a number of constraints [25–27].
The economic/environmental power dispatch problem can be formulated as a multicriteria optimization model.
2.1. Problem Objectives
2.1.1. Minimization of Fuel Cost
Let where depresses the total generation cost which is represented by quadratic functions; is the cost function of th generator; , , and are the cost coefficients of th generator; is the real power output of th generator; and is the number of generators. A typical cost function curve is shown in Figure 1.
2.1.2. Minimization of Emission
The total emission of atmospheric pollutants such as sulphur oxides and nitrogen oxides caused by fossilfueled thermal units can be expressed as where , , , , and are coefficients of the generator emission characteristics.
2.2. Problem Constraints
2.2.1. Power Balance Constraint
Let where : total system demand in MW; : total system losses, which can be calculated by the Kron’s loss formula; it is expressed in the quadratic form as follows: where , , and are the transmission network power loss coefficients, which are assumed to be constant, and reasonable accuracy can be achieved when the actual operating conditions are close to the base case where the B coefficients were derived [28].
2.2.2. Generation Capacity Constraint
Let where and are the minimum and maximum generation limit (MW) of th generator, respectively.
2.2.3. Grid Capacity Constraint
For secure operation, the actual transmission capacity must be restricted by its upper limit as where is the number of transmission lines; is the electric power flow of the th transmission line which is influenced by the ; and is the upper limit of the th transmission line.
2.3. Problem Formulation
To solve a multiobjectives optimization problem, many traditional methods are transforming the multiobjectives into a single objective by averaging the objectives with a certain weight vector.
In the economic/environmental dispatch problem, the two objectives are converted into a single objection by the price of emission which is calculated as follows: where is the antipollution equipment depreciation costs, is maximum treatment capacity, is the operation cost of the antipollution equipment, is the total amount of treatment pollution, and is the adjust coefficient.
So the EED problem can be mathematically formulated as a single objective optimization problem as follows:
subject to where is the equality constraint representing the power balance, while is the inequality constraint representing the generation capacity and power emission constraint.
3. Overview of PSO
3.1. The Basic Principle of PSO
Inspired by the movement pattern in a bird flock or fish school, Kennedy and Eberhart proposed the PSO algorithm in 1995 which is one of the modern heuristic optimization algorithms [29]. It is a populationbased, selfadaptive, and heuristic optimization technique, which gets the optimization problem solution through the revision of individual action strategies based on information sharing and selfoptimizing among the individuals. The classical PSO model consists of a swarm of particles moving in the Ddimensional space of possible problem solutions. In the Ddimensional space, each particle in the swarm is moved toward the optimal point in search of its optimal solution by adding a velocity with its position. By doing so, the th particle gets the best position , the best position of all particles is . The position and velocity of the particle are modified by the following: where is the iteration count; and are the acceleration coefficients; and are uniformly distributed random numbers in the range of ; is the dimension of the optimization problem (number of decision variables); is the number of particles in the swarm; and is the inertia weight, it calculates by (3.3). where and are the initial value and stop value of ; , are the number of iterations and the maximum number of iterations.
3.2. Subgroups Information Sharing
In order to solve the low precision and divergence problems of traditional PSO, the subgroups information sharing technique is introduced here. Based on the parallel algorithm, the initial swarms are divided into subgroups. Then the optimization process is done under the PAPSO. Because each subgroup searches optimization results separately, it is easy to fall into the local extreme value point and to be “premature.” In order to solve this problem, the crossover operator is introduced, which is shown in the following: where r is the random numbers in the range of ; is the th component of the th vector among the th group; is the th component of the best position vector in the th group; and .
3.3. Adaptive Updates of the Search Direction
It is obviously shown in (3.2) that particles’ locations update are only simple sum of particles’ former location and update speeds. While the particles’ speed update is influenced by the parameters , , , rand_{1}, and rand_{2}. It is possible that the speed update may be at the wrong direction. It will slow down the convergence speed and make the performance of the algorithm bad. So the search direction variable is introduced to realize the adaptive update of the particle location; the updated formula is shown in the following: where express the th component of the search direction variable at the iteration.
The behavior of the information exchange among the particles during the optimization at solution space can be called coordination. So the search direction of every particle has closed relationship with the coordination behavior among the particles. The behaviors can be divided into two kinds: one is egotistic direction, and the other is altruistic behavior. Under egotistic direction, the particle’s search direction is expressed as follows: where is sign function which gets the corresponding element determined by the variable , if , , if , , if , .
Under altruistic behavior, the particles in the same subgroup collaborate clearly, and they exchange information each other and adjust their behavior according to the other particle movement to achieve the target. The altruistic behavior can be expressed as follows: where is history best position of other particles expect th particle. is current best position of other particles expect th particle.
Besides the egotistic and altruistic behavior, particle also has proactiveness behavior which does not act simply following the environment change. The proactiveness direction can be expressed as follows: where , is better than . Actually, the search direction of the particle is determined by the compromise of , , , and . Here we used the method of selection in formula (3.7) to get the th component in the th particle’s search direction vector. The formula is shown in the following: where is the evenly distributed random number on the internal . express the percentage of m in the assemble .
3.4. The Procedure of PAPSO
The procedures of the PAPSO are shown in Figure 2.
The steps of the PAPSO are listed below.
Step 1. Setting the initial parameters, including the particle size , the total iterations number , and the initial position .
Step 2. Dividing the parent population into subgroups.
Step 3. Using (2.8) to calculate the fitness of the EED problem.
Step 4. Taking the current position of each particle as best position, recording the subgroup’s best position and global best position.
Step 5. Using (3.1), (3.5), and (3.10) to calculate the next positions of the particles.
Step 6. Using (3.4) realizing the information sharing among the subgroups.
Step 7. Calculating the fitness of the EED problem by (2.8), if fitness value is better than the former, recording the new positions of the particles.
Step 8. Judge whether meet the algorithm termination conditions. If meeting, ending the algorithm, otherwise turning to Step 5.
4. Simulation and Results
The proposed PAPSO method for EED problem is validated and tested on the IEEE 30bus with 6unit system [30] and 57bus with 15unit system [31]. In order to illustrate the performance of PAPSO, the EED schedule with emission and cost of generating units were obtained with system and power flow constraints using a different intelligent such as GA, PSO, CFPSO (Constriction Factor Particle Swarm Optimization), and PAPSO. Table 1 gives the generator characteristic of the IEEE 30bus with 6unit system.

The demand load of 24 hours is shown in Figure 3, the price of emission . The simulation results are shown in Figures 4, 5, 6, and 7. The results show that the PAPSO has the best smooth dispatch schedule than the others. The total variance of schedule by PAPSO is 224.71, while the total variances of schedule by GA, PSO, and CFPSO are 494.66, 358.54, and 319.48, respectively. The total costs per hour by the different methods are shown in Figure 8. Figure 8 shows that the PAPSO has the best dispatch schedule than the others. Table 2 shows that the proposed PAPSO provides the lower total cost as well as the less CPU execution time for all the GA, PSO, and CFPSO methods. Table 3 shows the generator characteristic of the IEEE 57bus with the 15unit system. The results tested by the 57bus with the 15unit system are shown in Table 4.



5. Conclusions
In this paper, we propose a combined intelligent algorithm (PAPSO) and compare with traditional GA, PSO, and CFPSO algorithm to solve economic/environmental power dispatch problems with unit, line flow constraints. By analyzing the power operation cost, energy consumption, and emission cost in detail, the singleobjective optimization model of economic/environmental dispatch is established. Then IEEE 30bus with 6unit system and IEEE57bus with 15unit system are used to testify the proposed method. The results display a satisfactory performance by PAPSO, with respect to both the quality of its evolved solutions and the computational requirements. This algorithm gives a realistic solution for dealing with future economic/environmental generation dispatch problems.
Acknowledgments
The authors thank the editor and the reviewers whose comments improved the quality of this study. This work was supported by “NSFC under Grant no. 71071052,” “the Fundamental Research Funds for the Central Universities no. 12MS74,” and “China Postdoctoral Science Foundation no. 2012M520221”.
References
 R. Petrovic and B. Kralj, “Economic and environmental power dispatch,” European Journal of Operational Research, vol. 64, no. 1, pp. 2–11, 1993. View at: Google Scholar
 J. H. Talaq, F. ElHawary, and M. E. ElHawary, “Summary of environmental/economic dispatch algorithms,” IEEE Transactions on Power Systems, vol. 9, no. 3, pp. 1508–1516, 1994. View at: Publisher Site  Google Scholar
 G. P. Granelli, M. Montagna, G. L. Pasini, and P. Marannino, “Emission constrained dynamic dispatch,” Electric Power Systems Research, vol. 24, no. 1, pp. 55–64, 1992. View at: Google Scholar
 A. J. Mezger and K. C. de Almeida, “Short term hydrothermal scheduling with bilateral transactions via bundle method,” International Journal of Electrical Power and Energy Systems, vol. 29, no. 5, pp. 387–396, 2007. View at: Publisher Site  Google Scholar
 S. J. P. S. Mariano, J. P. S. Catalão, V. M. F. Mendes, and L. A. F. M. Ferreira, “Profitbased shortterm hydro scheduling considering headdependent power generation,” in Proceedings of the IEEE Power Tech Conference, pp. 1362–1367, July 2007. View at: Publisher Site  Google Scholar
 L. J. Martinez, T. A. Lora, and R. J. Santos, “Short term hydrothermal coordination based on interior point nonlinear programming and genetic Algorithm,” in Proceedings of the IEEE Porto Power Tech Conference, 2001. View at: Google Scholar
 C. W. Gar, M. Aganagic, J. G. Waight et al., “Experiences with mixed integer linear programming based approaches on shortterm hydro scheduling,” IEEE Transactions on Power Systems, vol. 16, no. 4, pp. 743–749, 2001. View at: Publisher Site  Google Scholar
 G. W. Chang, M. Aganagic, J. G. Waight et al., “Experiences with mixed integer linear programming based approaches on shortterm hydro scheduling,” IEEE Transactions on Power Systems, vol. 16, no. 4, pp. 743–749, 2001. View at: Publisher Site  Google Scholar
 J. GarciaGonzalez and G. Alonso Castro, “Short term hydro scheduling with cascaded and head dependent reservoir based on mixed integer linear programming,” in Proceedings of the IEEE Porto Power Tech Conference, vol. 3, pp. 758–765, 2001. View at: Google Scholar
 J. GarcíaGonzález and G. Alonso Castro, “Profit based optimal scheduling of a hydro chain in the day ahead electricity market,” European Journal of Operational Research, vol. 18, no. 1, pp. 1354–1369, 2007. View at: Google Scholar
 C. C. Shi, H. C. Chun, I. K. Fomg, and P. B. Lah, “Hydroelectric generation scheduling with an effective differential dynamic programming algorithm,” IEEE Transactions on Power System, vol. 5, no. 3, pp. 737–743, 1990. View at: Google Scholar
 C. Erion Finardi, L. D. Silva Edson, and C. V. Laudia Sagastizabal, “Solving the unit commitment problem of hydropower plants via Lagrangian relaxation and sequential quadratic programming,” Computational & Applied Mathematics, vol. 24, no. 3, pp. 23–35, 2005. View at: Google Scholar
 S. Tkayuki and W. Kamu, “Lagrangian relaxation method for price based unit commitment problem,” Engineering Optimization Taylor Francis, vol. 36, no. 6, pp. 705–719, 2004. View at: Google Scholar
 P. E. C. Franco, M. F. Carvalho, and S. Soares, “Network flow model for shortterm hydrodominated hydrothermal scheduling problems,” IEEE Transactions on Power Systems, vol. 9, no. 2, pp. 1016–1022, 1994. View at: Publisher Site  Google Scholar
 A. J. Wood and B. F. Wollenberg, Power Generation Operation and Control, John Wiley & Sons, New York, NY, USA, 1984.
 J. S. Dhillon, S. C. Parti, and D. P. Kothari, “Stochastic economic emission load dispatch,” Electric Power Systems Research, vol. 26, no. 3, pp. 179–186, 1993. View at: Google Scholar
 C. S. Chang, K. P. Wong, and B. Fan, “Securityconstrained multiobjective generation dispatch using bicriterion global optimization,” IEE Proceedings of Generation, Transmission and Distribution, vol. 142, no. 4, pp. 406–414, 1995. View at: Google Scholar
 A. I. S. Kumar, K. Dhanushkodi, J. J. Kumar, and C. K. C. Paul, “Particle swarm optimization solution to emission and economic dispatch problem,” in Proceedings of the IEEE Region 10th International Conference, pp. 748–759, 2001. View at: Google Scholar
 H. H. Chang, “Genetic algorithms and nonintrusive energy management system based economic dispatch for cogeneration units,” Energy, vol. 36, no. 1, pp. 181–190, 2011. View at: Publisher Site  Google Scholar
 D. N. Jeyakumar, T. Jayabarathi, and T. Raghunathan, “Particle swarm optimization for various types of economic dispatch problems,” International Journal of Electrical Power and Energy Systems, vol. 28, no. 1, pp. 36–42, 2006. View at: Publisher Site  Google Scholar
 S. Sivasubramani and K. S. Swarup, “Environmental/economic power dispatch problem using multiobjective differential evolution algorithm,” Electric Power Systems Research, vol. 88, pp. 1171–1181, 2010. View at: Google Scholar
 M. Kop and X. Liu, “Texture detection by genetic programming,” in Proceedings of the Congress on Evolutionary Computation, pp. 867–872, May 2001. View at: Google Scholar
 T. Qiaoling, Z. Xuecheng, Z. Qiao, G. Fei, and H. Tong, “The hardware/software partitioning in embedded system by improved particle swarm optimization algorithm,” in Proceedings of the 5th IEEE International Symposium on Embedded Computing (SEC '08), pp. 43–46, October 2008. View at: Publisher Site  Google Scholar
 S. W. Leung, S. Y. Yuen, and C. K. Chow, “Parameter control system of evolutionary algorithm that is aided by the entire search history,” Applied Soft Computing, vol. 12, no. 9, pp. 3063–3078, 2012. View at: Google Scholar
 M. A. Abido, “A novel multiobjective evolutionary algorithm for environmental/economic power dispatch,” Electric Power Systems Research, vol. 65, no. 1, pp. 71–81, 2003. View at: Publisher Site  Google Scholar
 D. W. Gong, Y. Zhang, and C. L. Qi, “Environmental/economic power dispatch using a hybrid multiobjective optimization algorithm,” International Journal of Electrical Power and Energy Systems, vol. 32, no. 6, pp. 607–614, 2010. View at: Publisher Site  Google Scholar
 L. Wang and C. Singh, “Reserveconstrained multiarea environmental/economic dispatch based on particle swarm optimization with local search,” Engineering Applications of Artificial Intelligence, vol. 22, no. 2, pp. 298–307, 2009. View at: Publisher Site  Google Scholar
 H. Saadat, Power System Analysis, The McGrawHill Companies, New York, NY, USA, 1999.
 J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, December 1995. View at: Google Scholar
 A. Farag, S. AlBaiyat, and T. C. Cheng, “Economic load dispatch multiobjective optimization procedures using linear programming techniques,” IEEE Transactions on Power Systems, vol. 10, no. 2, pp. 731–738, 1995. View at: Publisher Site  Google Scholar
 S. Balakrishnana, P. S. Kannanb, C. Aravindanc, and P. Subathra, “Online emission and economic load dispatch using adaptive Hopfield neural network,” Applied Soft Computing, vol. 2, pp. 297–305, 2003. View at: Google Scholar
Copyright
Copyright © 2012 Jinchao Li 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.