Research Article  Open Access
Ieda G. Hidalgo, Regiane S. de Barros, Jéssica P. T. Fernandes, João Paulo F. Estrócio, Paulo B. Correia, "Metaheuristic Approaches for Hydropower System Scheduling", Journal of Applied Mathematics, vol. 2015, Article ID 701851, 6 pages, 2015. https://doi.org/10.1155/2015/701851
Metaheuristic Approaches for Hydropower System Scheduling
Abstract
This paper deals with the shortterm scheduling problem of hydropower systems. The objective is to meet the daily energy demand in an economic and safe way. The individuality of the generating units and the nonlinearity of their efficiency curves are taken into account. The mathematical model is formulated as a dynamic, mixed integer, nonlinear, nonconvex, combinatorial, and multiobjective optimization problem. We propose two solution methods using metaheuristic approaches. They combine Genetic Algorithm with Strength Pareto Evolutionary Algorithm and Ant Colony Optimization. Both approaches are divided into two phases. In the first one, to maximize the plant’s net generation, the problem is solved for each hour of the day (static dispatch). In the second phase, to minimize the units’ switching onoff, the day is considered as a whole (dynamic dispatch). The proposed methodology is applied to two Brazilian hydroelectric plants, in cascade, that belong to the national interconnected system. The nondominated solutions from both approaches are presented. All of them meet demand respecting the physical, electrical, and hydraulic constraints.
1. Introduction
Brazilian power generation system is predominantly hydroelectric. The operation planning/scheduling of this system is divided into three stages: longterm, mediumterm, and shortterm. In the longterm the horizon is up to five years with monthly timestep. In this stage, the plants are grouped by subsystems. In the mediumterm the horizon is up to one year with monthly or weekly timestep. In this stage, the plants are treated individually. In the shortterm the horizon is up to two weeks with hourly timestep. In this stage the generating units (GUs) of the plants are considered and the physical, electrical, and hydraulic aspects are taken into account.
Within the shortterm stage is made the optimal dynamic dispatch (ODD) of the GUs, which is the focus of this paper. It consists of determining, for each hour of the day, which units should be operating and their generating level. The objective is to meet energy demand, optimally utilizing the available water resources and reducing the maintenance costs of the GUs.
Two equations are important for the ODD of the GUs: the hydraulic balance and production function, Hidalgo et al. [1]. The hydraulic balance determines the reservoir’s final volume from the initial volume, water inflow, and water outflow. The production function relates the plant’s generation with the turbines efficiency, generators efficiency, net head, and water discharged.
The optimal use of the available water resources is related to plant’s efficient operation. Yi et al. [2] propose to maximize the system efficiency, Arce et al. [3] aim to minimize the power generation losses, Finardi and Scuzziato [4] suggest minimizing the total water released, and Catalão et al. [5] propose to maximize the value of the stored water in the reservoir.
The maintenance cost of the GUs is affected, among other things, by the number of startups and shutdowns during the operation. Each switching onoff of a unit is estimated to reduce its useful life by about 10 to 15 hours, Nilsson et al. [6]. Borghetti et al. [7] define a cost for the switching onoff of GUs. Chang et al. [8] propose a penalty for each of the status changes of the units. Chancelier and Renaud [9] determine a minimum time required between the startup and shutdown of the GUs.
As shown, in general, the ODD problem has two main objectives: to increase the net generation of the plant and reduce the number of times that status of the GUs is changed. System constraints related to this problem include meeting the load demand and respecting the physical, electrical, and hydraulic constraints. It has discrete variables for the selection of GUs and continuous variables for the loading dispatch of each online GU. The production function of a hydroelectric plant and the efficiency curves of the units are nonlinear. The ODD problem is usually nonconvex. The combinatorial nature of the problem makes it more complex.
Artificial Intelligence techniques have been applied to solve similar problems to ODD. Santos and Ohishi [10] apply Genetic Algorithm (GA) and Lagrangian Relaxation (LR) to three Brazilian hydroelectric systems. Muller [11] employs GA and Sequential Quadratic Programming (SQP) for the Unit Commitment (UC) problem in order to minimize losses in power generation. Colnago [12] employs GAs to solve the problem. Naresh and Sharma [13] present a model based on Artificial Neural Networks (ANNs) for hydrosystem scheduling. Huang [14] proposes an optimization approach based on Ant Colony System (ACS) to enhancement of hydroelectric generation scheduling. Villasanti et al. [15] employ MultiObjective Evolutionary Algorithms (MOEAs) to dispatch hydroelectric generating units. Musirin et al. [16] apply Ant Colony Optimization (ACO) technique to solve the economic power dispatch problem with cost minimization as objective function. Columbus et al. [17] propose the Nodal Ant Colony Optimization (NACO) technique to solve the UC problem with profit maximization as objective function. Mo et al. [18] present a hybrid algorithm based on MultiAnt Colony System (MACS) and Adaptive Differential Evolution (ADE) for solving the shortterm hydrogeneration scheduling problem.
This paper presents a comparison of two metaheuristic approaches developed to solve the ODD problem of GUs. They are based on GA, Strength Pareto Evolutionary Algorithm (SPEA), and ACO. GA is used to create and diversify the solutions’ search space. SPEA is employed to select the solutions that approach Pareto Frontier. ACO is applied to explore the search space using the experience accumulated by ants.
2. Objects of Study
The objects of study of this research are two Brazilian hydroelectric plants that operate in cascade: Jupiá (Engenheiro Souza Dias) and Porto Primavera (Engenheiro Sérgio Motta). According to the company that manages the operation of these plants, their head can be considered constant, during the day, and equal to 20 m. Figure 1 shows the operation schematic diagram of these plants. They are located at Paraná River.
Jupiá is a runofriver plant, with 1,551 MW of installed power and 14 GUs. The first 12 units of Jupiá plant are connected to the 440 kV busbar and the last 2 units are connected to the 138 kV busbar. Its dam is 5,495 m long and its reservoir is 330 km^{2}.
Porto Primavera has a small capacity of storage, 618 hm^{3}. For this reason, it is operated as a runofriver plant. Porto Primavera plant has 1,540 MW of installed power and also 14 GUs. All of them are connected to the 440 kV busbar. Its dam, the largest in Brazil, is 10,186.20 m long and its reservoir is 2,250 km^{2}.
For Jupiá plant, the range of operating limits of GUs 1, 3, 5, 6, 7, 8, 9, 11, 12, and 14 is 25–110.8 MW; GU 2 range is 40–110.8 MW; GU 4 can only operate 100 MW. GUs 10 and 13 range is 50–100 MW. For Porto Primavera plant, all GUs have the same operating limits: the lower is 30 MW and the upper is 110 MW.
The characteristic curves of the GUs are represented by a fourth degree polynomial. They relate efficiency and power for head = 20 m. Table 1 shows the coefficients for Jupiá’s GUs. Table 2 displays the coefficients for Porto Primavera’s GUs.


3. Mathematical Formulation
3.1. Objective Functions
The proposed optimization model consists of two conflicting objectives. They are (1) maximizing the total net generation of the plant and (2) minimizing the number of times that the status of the GUs is changed. Jupiá and Porto Primavera are individually optimized, since they are operated as runofriver plants:where = index of the time period; = index of the GU; = total number of GUs; = generation of the unit , in the time period (MW); = efficiency of the unit , in the time period ; = net head of the plant; and = binary variable that indicates whether the unit is active in the time period (1 = active, 0 = inactive).
3.2. Constraints
The optimization is subject to the following set of constraints, for each time period. Inequality (2) is the demand constraint by busbar, which states that the power generated must meet the specified load demand. According to (3), the sum of the water discharge of the units is equal to the total water discharge of the plant. Since the plants are runofriver, the water inflow must be equal to the water outflow, water discharge plus water spillage (4). Inequalities (5) and (6) specify the lower and upper bounds of net generation, respectively:where = demand of the plant, in the time period (MW); = water discharge of the unit , in the time period (m^{3}/s); = water discharge of the plant, in the time period (m^{3}/s); = water inflow of the plant, in the time period (m^{3}/s); and = water spillage of the plant, in the time period (m^{3}/s).
3.3. Variables
The integer and continuous variables of the model are represented in integrity constraints (7) and (8), respectively. The integer variables are used for the selection of GUs and the continuous variables are employed for the loading dispatch of the selected GUs:
4. Methodology
We propose two solution strategies using metaheuristic approaches. The first one combines GA, Holland [19], with SPEA, Zitzler et al. [20]. The second approach relates GA with ACO, Dorigo and Stüzle [21]. Table 3 shows the main characteristics of these approaches.

Both approaches are divided into two phases. In Phase 1, to maximize the plant’s net generation using GA, the problem is solved for each hour of the day (static dispatch). The resulting population consists of a set of individuals containing dispatch solutions for each hour of the day. These solutions are randomly combined to compose the individuals of the initial population for Phase 2.
For the first approach, Phase 2 employs SPEA. In our problem, this multiobjective algorithm searches a tradeoff between maximizing the plant’s net generation and minimizing the GUs’ switching onoff. The day is considered as a whole (dynamic dispatch). As a result the algorithm saves the nondominated solutions in an external archive.
For the second approach, ACO is used in Phase 2. Ants exploit the search space based on accumulated experience by them. In this approach, the dynamic dispatch is solved as a minimal cost path problem. The main objective in this phase is to minimize the GUs’ switching onoff using a state transition rule. The first objective function is also taken into account since the search space consists of suboptimal solutions from Phase 1. Tradeoff curve is employed to deal with both objective functions simultaneously.
5. Case Studies
The parameters used for GA, SPEA, and ACO, chosen according to literature, are shown in Table 4. In this table, = relative importance of pheromone trail and = relative importance of heuristic function.

We conduct case studies to the days 02/11/2012 and 01/16/2013 (chosen by the company that holds the concession of the plants), for Jupiá and Porto Primavera plants, using GA + SPEA and GA + ACO approaches. In the total there are eight case studies grouped in Frames I, II, III, and IV.
For all studies, the net generations at least meet demand; the physical, electrical, and hydraulic constraints are satisfied. Tables 5 and 6 show the results for the studies of 02/11/2012 and 01/16/2013, respectively. For each day, plant, and approach two variables are presented: number (#) of GUs’ switching onoff and plant’s total net generation (MW).


The better results have lower number of GUs’ switching onoff and higher plant’s total net generation. It is possible to compare the results just focusing on the first line (highlighted) of these tables.
In Frame I, the better results are presented by GA + SPEA, in relation to the number of startups and shutdowns of the GUs and net generation of the plant (32,512.59 MW). In Frame II, although both strategies avoid GU’s onoff in a perfect way , GA + SPEA exhibits better net generation values (33,774.55 MW). In Frame III, GA + SPEA yields higher plant’s net generation value (31,949.96 MW), whereas GA + ACO yields lower number of startups and shutdowns . In Frame IV, again both strategies avoid GU’s onoff in a perfect way , but GA + SPEA exhibits better net generation values (36,426.65 MW).
6. Summary and Conclusions
This paper presents metaheuristic approaches to optimize the dynamic dispatch of hydropower systems. The mathematical model consists of two conflicting objectives. It is formulated as a dynamic, mixed integer, nonlinear, nonconvex, and combinatorial optimization problem.
The solution strategies that employ GA, SPEA, and ACO consist of two phases. The first one solves the static problem for each hour of the day, in order to maximize the total net generation of the plant. The second phase is concerned with the linking hourbyhour of the statics solutions throughout the day, setting the dynamic dispatch. Its objectives are to maximize the total net generation of the plant and to reduce the number of startups and shutdowns of the units.
The proposed approaches are applied to two hydroelectric plants that operate in cascade: Jupiá and Porto Primavera plants. Eight case studies are carried out for two days of these two plants, comparing GA + SPEA and GA + ACO strategies.
For the case studies of this research, on the whole, GA + SPEA approach shows better results for both objectives functions of the problem. This can be seen in Frames I, II, and IV where the higher net generation values and lower number of startups and shutdowns are in GA + SPEA column. Besides, in general, GA + SPEA presents better result in terms of plant’s net generation and GA + ACO exhibits better performance in relation to GU’s switching onoff, as shown in Frame III. That probably occurs because, in Phase 2, SPEA deals with both objectives of the problem in a simultaneous way, since it is a multiobjective algorithm, whereas ACO focuses on the second objective, minimizing GU’s onoff, although the first objective is also taken into account in a preemptive way.
In conclusion, both solution strategies, GA + SPEA and GA + ACO, are good alternatives to solve the optimal dynamic dispatch in the shortterm operation of hydroelectric plants. As future work, the authors propose to run the models several times to collect an expressive number of case studies. The goal will be to apply statistical analyses in a bigger sample to compare the models in a more accurate way.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
The research reported herein was supported by three Brazilian Government agencies and one of the largest power generating companies. They are Conselho Nacional de Desenvolvimento Científico e Tecnológio (CNPq), Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES), Agência Nacional de Energia Elétrica (ANEEL), and Companhia Energética de São Paulo (CESP), respectively.
References
 I. G. Hidalgo, D. G. Fontane, J. E. Lopes, J. G. Andrade, and A. F. de Angelis, “Efficiency curves for hydroelectric generating units,” Journal of Water Resources Planning and Management, vol. 140, no. 1, pp. 86–91, 2014. View at: Publisher Site  Google Scholar
 J. Yi, J. W. Labadie, and S. Stitt, “Dynamic optimal unit commitment and loading in hydropower systems,” Journal of Water Resources Planning and Management, vol. 129, no. 5, pp. 388–398, 2003. View at: Publisher Site  Google Scholar
 A. Arce, T. Ohishi, and S. Soares, “Optimal dispatch of generating units of the Itaipu hydroelectric plant,” IEEE Transactions on Power Systems, vol. 17, no. 1, pp. 154–158, 2002. View at: Publisher Site  Google Scholar
 E. C. Finardi and M. R. Scuzziato, “Hydro unit commitment and loading problem for dayahead operation planning problem,” International Journal of Electrical Power & Energy Systems, vol. 44, no. 1, pp. 7–16, 2013. View at: Publisher Site  Google Scholar
 J. P. S. Catalão, S. J. P. S. Mariano, V. M. F. Mendes, and L. A. F. M. Ferreira, “Parameterisation effect on the behaviour of a headdependent hydro chain using a nonlinear model,” Electric Power Systems Research, vol. 76, no. 67, pp. 404–412, 2006. View at: Publisher Site  Google Scholar
 O. Nilsson, L. Söder, and D. Sjelvgren, “Integer modelling of spinning reserve requirements in short term scheduling of hydro systems,” IEEE Transactions on Power Systems, vol. 13, no. 3, pp. 959–964, 1998. View at: Publisher Site  Google Scholar
 A. Borghetti, C. D'Ambrosio, A. Lodi, and S. Martello, “An MILP approach for shortterm hydro scheduling and unit commitment with headdependent reservoir,” IEEE Transactions on Power Systems, vol. 23, no. 3, pp. 1115–1124, 2008. 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.P. Chancelier and A. Renaud, “Daily generation scheduling: decomposition methods to solve the hydraulic problems,” International Journal of Electrical Power & Energy Systems, vol. 16, no. 3, pp. 175–181, 1994. View at: Publisher Site  Google Scholar
 E. F. Santos and T. Ohishi, “A hydro unit commitment model using genetic algorithm,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 2, pp. 1368–1374, IEEE, June 2004. View at: Publisher Site  Google Scholar
 G. Muller, Dispatch of generating units and generation of individual hydroelectric using genetic algorithm [M.S. thesis], Federal University of Rio de Janeiro, Rio de Janeiro, Brazil, 2010.
 G. R. Colnago, Contribution for turbines optimization in hydroelectric plants: specification and operation [Ph.D. thesis], State University of Campinas, São Paulo, Brazil, 2011.
 R. Naresh and J. Sharma, “Hydro system scheduling using ANN approach,” IEEE Transactions on Power Systems, vol. 15, no. 1, pp. 388–395, 2000. View at: Publisher Site  Google Scholar
 S.J. Huang, “Enhancement of hydroelectric generation scheduling using ant colony system based optimization approaches,” IEEE Transactions on Energy Conversion, vol. 16, no. 3, pp. 296–301, 2001. View at: Publisher Site  Google Scholar
 C. M. Villasanti, C. V. Lucken, and B. Baran, “Dispatch of hydroelectric generating units using multiobjective evolutionary algorithms,” in Proceedings of the IEEE/PES Transmission & Distribution Conference & Exposition: Latin America, pp. 929–934, São Paulo, Brazil, 2004. View at: Google Scholar
 I. Musirin, N. H. F. Ismail, M. R. Kalil, M. K. Idris, T. K. A. Rahman, and M. R. Adzman, “Ant Colony Optimization (ACO) technique in economic power dispatch problems,” in Trends in Communication Technologies and Engineering Science, P.K. A. Wai, X. Huang, and S.I. Ao, Eds., vol. 33, chapter 15, pp. 191–203, Springer Netherlands, 2009. View at: Google Scholar
 C. C. Columbus, K. Chandrasekaran, and S. P. Simon, “Nodal ant colony optimization for solving profit based unit commitment problem for GENCOs,” Applied Soft Computing Journal, vol. 12, no. 1, pp. 145–160, 2012. View at: Publisher Site  Google Scholar
 L. Mo, P. Lu, C. Wang, and J. Zhou, “Shortterm hydro generation scheduling of Three GorgesGezhouba cascaded hydropower plants using hybrid MACSADE approach,” Energy Conversion and Management, vol. 76, pp. 260–273, 2013. View at: Publisher Site  Google Scholar
 J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, Mich, USA, 1975.
 E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: improving the strength pareto evolutionary algorithm,” Tech. Rep. TIK103, Department of Electrical Engineering, Swiss Federal Institute of Technology, Zürich, Switzerland, 2001. View at: Google Scholar
 M. Dorigo and T. Stüzle, Ant Colony Optimization, A Bradford Book, The MIT Press, 2004.
Copyright
Copyright © 2015 Ieda G. Hidalgo 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.