Genetic Algorithm Solution for Convex

Hydro-Thermal Generation Scheduling Problem

Vimal Singh Bisht
1
bishtvimal@yahoo.com
#
Electrical Engineering Department, Graphic Era Hill University
Bhimtal (U.K.) India

Abstract— The paper proposes a Genetic Algorithm solution for
solving a short term hydro thermal scheduling problem. The
scheduling has been done for a period of twenty four hours. The
algorithm is first applied on hydro plants for calculating hydro
generation and then on thermal units for calculating economic
load dispatch among the given units. The various constraints like
load balancing, thermal and hydro generation limits, initial/final
volume and discharge from the hydro reservoir are taken in to
consideration .The algorithm has been demonstrated on a hydro-
thermal system having 4 Hydro & 10 Thermal units algorithm
has effectively taken care of all the constraints which has
helped in removing the penalty factors from the problem. The
parameters that affect the performance of Genetic Algorithm are
discussed and the theoretical background of the method has been
presented. The optimal cost based on the Genetic algorithm has
been calculated for the given hydro thermal system generators.
Keywords— Short-term hydrothermal scheduling, genetic
algorithm, Constraint-handling, economic load dispatch,
economic operation of power system.
I. INTRODUCTION
With advancement in technology in today’s modern era
power system has evolved up with lot many possibilities.
Today’s modern power system consist a huge network of
interconnected generating power station irrespective of their
mode of generation. The main objective behind
interconnection of power system is to supply the load demand
at a minimum cost, maintaining the system reliability and
security of power system. Hydrothermal scheduling is one
such kind of operation by which we can supply the load
demand minimizing the cost of generation.
Hydrothermal scheduling problem can be divided in to two
parts, one as a long term hydro thermal scheduling and other
as a short term scheduling problem. Long term scheduling
problem are consider for a larger period of study ranging from
1 week to 1 year. The main difficulty with such type of
scheduling is that it is very difficult to predict the flows of
water in river for such a long period. This uncertainty in flows
makes long term scheduling a difficult task. Whereas short
term scheduling problem is free from such constraint as the
range of scheduling period lies from a day to a week.
With new emerging trends in artificial computational
techniques it is now very much possible to solve real world
complex problem in a quick time with reliable results. Hydro-
thermal scheduling is one such area where artificial
computational techniques have given reliable results.
been applied to the hydro thermal system consisting of 6
thermal and 4 hydro generating units. The power generation
limits, load balancing, initial/final volume of hydro reservoirs
and discharge limit of hydro reservoir are the constraints that
the problem has to take care of.
II. GENETIC ALGORITHM
Genetic algorithms are the general purpose optimization
tools inspired out of natural living nature. Genetic algorithm
lies in the categories of most widely used evolutionary
algorithms. In the last decade, approaches based on genetic
algorithms (GA) have received large attention from both
academic and industrial communities for dealing optimization
problems that have been shown to be intractable using
conventional problem solving approaches [5,6,7,8,9,10,11] .
The algorithm operates on the set of strings called as
chromosomes which are made up of genes. These
chromosomes together form population in GA. At the run of
algorithm the size of population is decided randomly,
generally it depends on the experience of programmer. Every
individual in the chromosome is characterized by a set of
parameters called as Genes. These Genes constitutes of all the
necessary information regarding the encoding or value
encoding. The choice of encoding depends up on the type of
problem. Among the three encoding schemes the binary
encoding scheme is mostly used. Working of a genetic
algorithm can be understood very clearly from figure 1.
The competition process is based on the fitness value of the
individual. The one having higher value of fitness is taken in
Figure 1 Darwinian paradigm
to the next generation and the one with the lower value of
fitness are discarded. Selection is applied on the entire
population after the competition. Roulette wheel and
tournament are the two popular selection methods. One’s
selection is completed reproduction operators are applied on
the entire survivor’s. After reproduction again competition

978-1-4673-0766-6/12/$31.00 ©2012 IEEE

Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.
occurs among the newly 

 Phij = C1i (Vhij ) + C2i (Qhij ) 2 + C3i (Vhij )(Qhij )

are discarded. Selection is applied on the entire population after
the competition. Roulette wheel and tournament are the two
popular selection methods. One’s selection is completed + C 4 i (Vhij ) + C5 i (Qhij ) + C 6 i (2)
reproduction operators are applied on the entire survivor’s. The
probability of these operators depends up on the user and cannot Where C1, i. . . C6,i are the hydraulic power generation
have a zero value. After reproduction again competition occurs coefficients. Based on the value of Hydro Generation (Phij)
among the newly generated population and the cycle goes on till thermal generation has to be scheduled accordingly to meet the
any of the specified constraints are met. total demand.
III. PROBLEM FORMULATION
A hydro thermal scheduling problem is all about minimizing the B. Constraints
thermal generation cost by making use of hydro generation. The
problem of minimizing the operating cost of the system can be The following presents the counted constraints within the HTSP
viewed as one of minimizing the fuel cost of thermal plants formulation:
under the constraints of water availability (storage and inflow) 1. Balancing the Load: The total power generated by hydro and
for hydro generation over a given period of operation. thermal generating units should meet the total demand and
Cost function for thermal unit is given as [1] losses.
Pt + Ph = Pdemand + Ploss
 Fk ( Ptkl ) = ak + bk ( Ptkl ) + ck ( ptkl ) 2 ;ϭͿ
In the paper losses are not considered, So the constraint
Where ak, bk , ck , are the cost function coefficients ($/h, Takes the form of:
$/MWh, $/MW2h); Ptkl is the power generated by the ith
thermal unit at time t (MW); Fi (·) is the cost of production of
Pt + Ph = Pdemand
the ith thermal unit at time t ($/h).
2 .Hydro Generation limit: Power Generated by Hydro
Thus our objective function is to minimize: generation should lie in between min. and max. Limit of the
generations.
T Ng  Ph (min) ≤ ( Ph ) ≤ Ph (max) 
 ¦¦ Fk ( Ptkl )
t =1 k =1 3. Thermal Generation limit: Power generated by Thermal
generation should lie in between min. and max. Limit of the
generation.
A. Nomenclature
 Pt (min) ≤ ( Pt ) ≤ Pt (max) 
th
Pdj Power Demand for the J hour.
4. Hydro Reservoir Volume: As the reservoir storage
Phij Hydro power generated by I th reservoir in J th Volume is limited, so account of available volume of water
time Interval. has to be kept for every hour. Volume should always lie in
th
between specified limits.
Ptkl Thermal Power generated by K thermal unit
in I
th
time Interval. Vhij (min) ≤ (Vhij ) ≤ Vhij (max)
th th
Vhij Volume of I reservoir at J time interval.
ϱ. Hydro Reservoir Discharge: similar to the volume of
th th
Qhij Water discharge from I unit at J interval. reservoir its discharge should also lie in between specified
th limits.
Fk Thermal generation cost for K unit.
a , b, c Cost Coefficient of Thermal generation.  Qhij (min) ≤ (Qhij ) ≤ Qhij (max) 
C1 − C6 Generation Coefficient for Hydro Generation.
IV. GENETIC ALGORITHM SOLUTION
N gt Total number of thermal unit in the system. The general scheme of the genetic algorithm for short-term
hydrothermal scheduling is summarized as follows:
N gh Total number of hydro unit in the system.
1. Population Initialization: Initializing the Population is a most
important step for Genetic Algorithm approach. Here each
B. Hydro Power Generation Characteristics
individual in the population represents discharge from the
Hydro power generation is purely the function of water reservoir for every hour. The initial population is generated
discharge (Q) and volume (V) of the reservoir. Different models with individuals whose phenotype is represented in matrix form
have been proposed; this article uses the same relationship as in with dimension T × N gh genes. Here T represents total time
Esteban et al. [2].
period for which scheduling has to be done and Ngh is the total
 number of available hydro units.



Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.
1.1 Number of bits required: Bits should be clearly able to to the problem. The process can be stopped if any one of the
represents the discharge. To calculate the number of bits three stopping criterion is met.
required we make use of formula [4]
V. SYSTEM DESCRIPTION
2bit _ reqdh −1 < (Qh max − Qh min ) × prec ≤ 2bit _ reqdh −1  The system consists of 6 thermal unit and 4 hydro units.
Load demand and other data for the problem are given from
Where prec. = 10number of decimal place accuracy required Table. II to Table IV show the demand pattern, generation,
volume, discharge limit of hydro reservoir power generation
2. Fitness function: fitness function for the scheduling coefficients of the hydraulic unit.
problem is minimization of the thermal generation cost. The
TABLE II
fuel cost/power output characteristics of the composite thermal HYDRO GENERATION, VOLUME AND DISCHARGE LIMITS
plant is represented by [3]
Plant Vmin Vmax Qmin Qmax Pmin Pmax
FK (Ptk ) = 5000 +19.2 × (Ptk )  (1) 1 55 150 5 15 0 500
2
 + 0.002 × ( Pdemand − Phj )  2 60 120 6 15 0 500
3 100 240 10 30 0 500
Where Ptk, the thermal generation is given by 4 70 160 13 25 0 500

 Pt k = Pd e m a n d − Ph j
Therefore the equation (1) becomes TABLE III
HYDRO POWER GENERATION COEFFICIENTS
(2)
FK ( Ptk ) = 5000 + 19.2 × ( Pdemand − Phj )  Unit C1 C2 C3 C4 C5 C6
 1 -0.0042 -0.42 0.03 0.9 10 -50
2
 + 0 .0 0 2 × ( Pd em an d − Ph j )  2 -0.004 -0.3 0.015 1.14 9.5 -70
3 -0.0016 -0.3 0.014 0.55 .55 -40
Now equation (2) becomes our final fitness function that 4 -0.003 -0.31 0.027 1.44 14 -90
has to be minimized.

3. Selection mechanism: Ones the fitness of the individual has

been calculated Selection process is carried out. Selection Limits for thermal and hydro generation should be with the
totally depends up on the fitness value of individual. All those range specified as:
having higher fitness take part in selection. Selection method
applied in this problem is Roulette wheel criterion. According 500 ≤ Pt ≤ 2500 
to this selection criterion method one having more value of
fitness has greater chance of selection. 0 ≤ Ph ≤ 500

4. Crossover and Mutation Operators: TABLE IV

GENERATING COEFFICIENTS AND LIMITS OF THERMAL GENERATING UNITS
(a) Crossover: Crossover is a genetic operator that
combines (mates) two chromosomes (parents) to
produce a new chromosome (offspring). There are Pt min Pt max
a b c
many crossover techniques like one-point, two-point, MW MW

Uniform, half uniform crossover, etc. generally the Pt1 0.00048 16.19 100 80 500
probability of cross over is taken as 0.7.
Pt2 0.00031 17.26 970 80 500
(b) Mutation: Mutation is used to maintain genetic
diversity from one generation to the next. It helps to Pt3 0.002 16.6 700 80 300
prevent the population from stagnating at any local Pt4 0.0021 16.5 680 40 400
optima. Different types of mutation are flip bit,
boundary, uniform, non-uniform, etc. generally the Pt5 0.0039 19.7 450 40 150
probability of Mutation is taken as 0.001. Mutation pt6 0.0071 22.26 370 40 150
probability is kept so that result does not get
converged at local points. Pt7 0.0007 27.74 480 10 80

Pt8 0.0041 25.92 660 10 100

5. Stopping Criterion: Stopping criterion depends on the
choice of individual. There are various criterions for stopping Pt9 0.0022 27.27 665 55 155
the algorithm: a) Maximum number of generations reached, Pt10 0.0017 27.79 670 55 155
b) Consistency in the result c) experience of individual related

Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.
 VI RESULTS
The problem is implemented in MATLAB 7.9.0.529
(R2009b). Genetic Algorithm parameters are taken as [POP.
Size=20, Pmut=.001, Pc.o=0.8] Selection criterion applied is
Roulette Wheel. Crossover and mutation applied are of
uniform and scattered type respectively. Table V and Table VI
show hydro generation of all the 4 hydro units and economic
dispatch of remaining demand through 10 thermal units
respectively. It can be seen that all the plants are generating
well within their limits, satisfying all the constraints involved
with the problem.
Fig. 2 Hydro Discharges form Reservoirs
TABLE V
HYDRO GENERATION OF HYDRO PLANTS

Hours PH1 PH2 PH3 PH4 Pd

1 182.96 44.83 130.06 309.79 1370
2 155.21 46.87 194.25 204.5 1390
3 161.96 56.06 78.14 223.33 1360
4 184.88 71.36 86.53 288.1 1290
5 181.58 73.54 87.85 331.3 1290
6 189.97 102.96 83.28 220.44 1410
7 197.07 44.8 68.36 203.25 1650
8 179.36 50.4 80 363.12 2000
9 116.77 58.11 229.33 306.99 2240 Fig. 3 Hydro Reservoir storage Volume
10 125.45 44.82 71.74 310.7 2320
11 99.42 46.71 73.94 305.15 2230
12 186.06 98.67 128.3 210.8 2310
13 187.62 69.76 108.59 263.2 2230
14 159.97 69.87 86.93 208.52 2200
15 97.31 68.68 85.05 421.5 2130
16 113.96 83.48 65.13 198.8 2070
17 181.4 90.07 73.08 348.08 2130
18 195.92 54.2 65 204.07 2140
19 180.29 133.31 75.39 215.12 2240
20 184.74 54.18 105.65 389.67 2280
Fig. 4 Demand and corresponding Hydro & Thermal Generation
21 75.42 45.58 66.32 199.17 2240
22 187.09 116.92 65.13 215.62 2120
23 169.1 125.42 92.2 204.47 1850
24 172.72 96.53 76.09 355.99 1590

Fig.2 shows the hydro discharge from the hydro reservoir and
fig. 3 shows the hydro reservoir storage volume for the 24
hours period. Fig.4 shows the demand, hydro generation &
thermal generation for the period of 24 hours. Fig. 5 and fig.
6 shows the convergence of solution and represents the
generation pattern for the thermal generating units. Table VI
gives the economic generation scheduled of the thermal units
using GA. Based on these values of generation the total cost is
calculated. The total cost for 24 hours generation scheduling
came out to be $ 689,018. Fig. 5 Convergence of solution using GA

Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.

Fig 6 Load Sharing by Thermal Units
VII CONCLUSIONS
Genetic Algorithm is best applied in an innovative way to any
specific problem where in the classical methods fails. In this
paper Hydro-Thermal coordination and Economic load
dispatch are solved by Genetic Algorithm which came out as
an effective tool. The GA is able to take into account all the
problem variables without making the usual simplifying
assumptions, required by conventional techniques. Ones the
problem is formulated in Genetic Algorithm, the work left is
choosing the control parameter of the algorithm. Tuning of the
control parameter carefully leads to a better solution of the
problem. The genetic algorithm approach provides a good
solution to convex short term hydrothermal scheduling
problem and has successfully taken care all the constraints in
to account. The results of this paper confirm the applicability
of the proposed solution.

TABLE VI REFERENCES
ELD OF THERMAL GENERATING UNITS [1] Vimal Singh Bisht,,Nikhil Kushwaha,Gautam Shah & Vaibhav
GuptaGenetic Algorithm Solution for a Convex Hydro-Thermal
Power Generation(MW) Generation Scheduling:IEEE International Conference on
Hour PT Unit 1 Unit 2 Unit 3 Unit 4 Unit 5 Computational Intelligence and Communication Networks (CICN-
1 702.36 269.65 82.623 88.087 55.304 43.143 2012).Mathura
2 789.17 115.68 108.0373 111.682 153.27 47.903 [2] Vimal Singh Bisht, Y.R sood, Suryakant & Nikhil, Short Term Hydro
3 840.5 83.113 81.044 185.081 214.095 49.842 Thermal Scheduling Problem: A Review´Inters cience Open Acces s
4 659.13 81.703 95.273 91.993 72.29 49.871 Journal(I2AJ).International Conference On Electrical and Electronics
5 605.73 81.438 87.224 150.759 48.253 49.284 Engineering (ICEEE -2012)
6 813.35 80.038 215.87 201.668 84.097 42.011 [3] Nikhil Kushwaha, Vimal Bisht & Gautam Shah Genetic algorithm
7 1136.52 112.706 313.87 225.539 172.261 43.038 based bacterial foraging approach for optimization. National
8 1327.12 251.143 394.275 228.157 218.251 40.411 Conference on Future Aspects of Artificial intelligence in Industrial
9 1528.8 490.86 201.733 283.691 288.646 82.187 Automation (NCFAAIIA 2012), Proceedings published by
International Journal of Computer Applications® (IJCA)
10 1767.29 380.767 500.00 241.894 400.00 47.306
11 1704.88 238.768 498.267 300.00 398.517 50.345 [4] Vimal Singh Bisht,Y.R Sood, Nikhil Kushwaha & Suryakant, “A
Genetic Algorithm Approach to Solve a Short term Hydro-Thermal
12 1686.14 481.975 500.00 299.1276 194.827 44.062
SchedulingProblem”International conference on Emerging Trends In
13 1601.01 495.92 416.029 271.063 151.142 44.979 Engineering and Technology, TMU University,Mooradabad,U.P
14 1674.71 476.365 374.509 300.00 198.025 44.564
[5] A.J. Wood and B.Wollenberg, Power Generation, Operation, and
15 1457.46 496.622 328.52 207.566 177.901 48.311
control New York: Wiley-Intersciene, 1996.
16 1608.63 375.88 500.00 258.306 148.597 45.795 [6] E. Gil, J. Bustos, and H. Rudnick, “Short-term hydrothermal
17 1437.37 399.377 335.537 209.423 249.003 67.296 Generation scheduling model using a genetic algorithm,” IEEE
18 1620.81 496.492 478.182 183.828 184.953 48.687 Transactions on Power Systems, vol. 18, no. 4, pp. 1256–1264
19 1635.89 489.478 320.634 170.307 287.635 43.306 [7] Orero SO, Irving MR. A genetic algorithm modeling framework and
20 1545.76 117.118 435.16 300.00 400.00 61.036 Solution technique for short-term optimal hydrothermal scheduling.
IEEE Trans Power Systems 1998;13 (2):501–18.
21 1853.51 388.98 500.00 300.00 399.841 47.434
[8] Yog Raj Sood, Evolutionary programming based optimal power flow
22 1535.24 185.58 495.689 293.97 268.181 44.311 and its validation for deregulated power system analysis, Elsevier
23 1258.81 160.705 369.362 115.31 219.343 41.716 Electrical Power and Energy Systems 29 (2007) 65–75
24 888.67 86.132 164.098 236.73 100.717 54.997 [9] M. Dotoli, G. Maione, D. Naso, E.B. Turchiano, Genetic identification
of dynamical systems with static nonlinearities, in: Proceedings IEEE
Hours SMC Mountain Workshop Soft Computing Industrial Applications,
PT Unit 6 Unit 7 Unit 8 Unit 9 Unit 10
1 702.36 42.427 12.205 10.456 55.359 55.411 Blacksburg, VA, 2001, pp. 65–70.
2 789.17 46.721 59.075 12.066 78.088 76.452 [10] P.J. Fleming, R.C. Purshouse, Evolutionary algorithms in control
3 840.5 51.506 51.264 22.821 62.906 62.144 system engineering: A survey, Control Engineering Practice 10 (2002)
1223–1241.
4 659.13 53.434 36.384 19.316 91.136 81.192
[11] C.M. Fonseca, P.J. Fleming, Multi objective optimization and multiple
5 605.73 51.422 10.171 13.303 69.056 56.373 constraint handling with evolutionary algorithms – Part I: A unified
6 813.35 42.658 36.018 10.711 63.266 63.026
formulation; – Part II: Application example, IEEE Transactions on
7 1136.5 43.190 72.084 10.771 93.514 91.612
Systems Man and Cybernetics Part A – Systems and Humans 28 (1)
8 1327.12 43.969 17.537 14.172 94.076 77.552 (1998) 26–47.
9 1528.8 46.154 37.585 18.583 75.213 68.278 [12] G.J. Gray, D.J. Murray-Smith, Y. Li, K.C. Sharman, T. Weinbrenner,
10 1767.29 40.654 52.23 12.935 97.905 89.452 Nonlinear model structure identification using genetic programming,
11 1704.78 41.986 72.83 11.406 91.966 90.735 Control Engineering Practice 6 (1998) 1341–1352.
12 1686.14 40.751 49.627 26.424 64.926 63.276 [13] K. Kristinnson, G.A. Dumont, System identification and control using
13 1601.01 47.732 80.00 12.883 73.058 78.235 genetic algorithms, IEEE Transactions on Systems Man and
14 1674.71 49.550 79.691 10.409 112.436 108.675 Cybernetics 22 (1992) 1033–1046.
15 1457.46 50.143 60.561 12.199 64.809 66.537 [14] C.L. Lin, H.W. Su, Intelligent control theory in guidance and control
16 1608.63 40.653 71.818 15.891 118.975 111.192 system design: An overview, Proceedings of the National Science
17 1437.37 46.758 33.437 16.865 71.724 64.158 Council, Republic of China – Part A: Physical Science and Engineering
18 1620.81 49.458 74.073 42.704 64.898 70.482 24 (1) (2000) 15–30.
19 1635.89 50.085 51.625 11.302 155.00 133.911 [15] R. Tanese, Distributed genetic algorithm, in: Proceedings of
20 1545.76 55.210 32.593 14.399 113.335 97.067 International Conference on Genetic Algorithms, 1989, pp. 434–439.
[16] Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution
21 1853.51 46.134 44.382 16.566 114.833 100.765
Programs, Springer-Verlag, Berlin Heideberg, 1996
22 1535.24 52.956 56.781 14.702 103.717 95.574 [17] S. Tsutsui, D.E. Goldberg, Simplex crossover and linkage identification:
23 1258.81 53.363 50.548 12.558 155.00 133.411 Single-stage evolution vs. multi-stage evolution, in: Proceedings IEEE
24 888.67 50.053 26.005 42.364 81.436 70.695 International Conference on Evolutionary Computation, 2002, pp. 974–
979.

Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.
[18] H. Yoshida, K. Kawata, Y. Fukuyama, A particle swarm optimization [25] NidulSinha, R. Chakrabarti, and P. K. Chattopadhyay, “Fast
for reactive power and voltage control considering voltage security Evolutionary Programming Techniques for Short-Term Hydrothermal
assessment, IEEE Transactions on Power Systems 15 (2000) 1232– Scheduling” IEEE TRANSACTIONS ON POWER SYSTEMS, VOL.
1239. 18, NO. 1, FEBRUARY 2003
[19] Julian Bustos, Esteban Gil, and Hugh Rudnick, Short-Term [26] Md.S.Salam, K.M. Nor, A.R. Hamdan, “Comprehensive Algorithm for
Hydrothermal Generation Scheduling Model Using a Genetic hydrothermalco-ordination”, IEE Proc.-Gener,tronsm ,Distrib..Vol 142.
Algorithm, IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. No 5 September 1997.
18, NO. 4, NOVEMBER 2003
[20] JUAN M. RAMIREZ PABLO E. OÑATE, The Short-Term
Hydrothermal Coordination via Genetic Algorithms, Electric Power
Components and Systems, 34:1–19, 2006Taylor & Francis , ISSN:
1532-5008 print/1532-5016 online DOI: 10.1080/1532500069100158
[21] R. F. Loyola and V. H. Quintana, “Medium-term hydrothermal
coordination by semi definite programming,” IEEE Transactions on
Power Systems, vol. 18, no. 4, pp. 1515–1522, November 2003
[22] NidulSinha, R. Chakrabarti, and P. K. Chattopadhyay, “Fast
Evolutionary Programming Techniques for Short-Term Hydrothermal
Scheduling” IEEE TRANSACTIONS ON POWER SYSTEMS, VOL.18,
NO. 1, FEBRUARY 2003
[23] Kang Yong-hui, Zhang Zhigang, Huang Weijun, “NSGA-II Algorithms
for Multi-objective Short-term Hydrothermal Scheduling” IEEE2009
[24] P.K. Hota, R. Chakrabarti, P.K. Chattopadhyay, “Short-term
hydrothermal scheduling through evolutionary programming
technique”, Electric Power Systems Research 52 (1999) 189–196.

Authorized licensed use limited to: Universidad de La Salle. Downloaded on December 12,2020 at 04:22:22 UTC from IEEE Xplore. Restrictions apply.