Professional Documents
Culture Documents
An Economic Dispatch Algorithm For Cogeneration Systems: M. A. Gonzalez Chapa, and J. R. Vega Galaz
An Economic Dispatch Algorithm For Cogeneration Systems: M. A. Gonzalez Chapa, and J. R. Vega Galaz
procedure, because of the weakness of inequality constraints Where the upper term in (16) is the linear form of (6)
compared with the strength of equality constraints. equalized to zero. When we calculate (16) we must be aware
that the imaginary line described by the distance from the
partial solution point to each now linear constraint touch a
A. Consideration for buying and selling power
feasible operating point over the linear constraint. The
The industries supplying their own energy demands with algorithm can be described as follows:
CHP systems are almost always interconnected to the utility 0. The initial vector x0 that has approximate values for
electric grid. Indeed, sometimes they keep the boilers used power and heat generation of every unit included in the
before the CHP to supply their thermal demands as auxiliary system is given.
or backup boilers. 1. The local restrictions for power units and or for the utility
We can model the utility electric system as an infinite bus to buy and sell power, boilers and the global restrictions
and take into account the purchase of power from the utility. are given.
The cost equation to buy power is similar to (1) and has a 2. The objective function as well as its gradient is given.
restriction like (3). The utility can buy surplus of power from 3. The partial solution with SQP gives a partial optimum
the co-generator at any time, but normally with a lower cost. generation. Now we must consider the point (pchp,hchp) for
This transaction of power from the co-generator to the utility every CHP unit to be inside their feasible operation
or another customer can be taken into account too with the region:
opportunity to increase the profit. It should be added to the a. FOR chp=1:CHP
objective function (9) as positive but restricted as negative IF (pchp,hchp) ∈ Feasible Area
with: It found a local or global optimum
max ELSE
−p ≤p ≤0 (15)
s s i. It looks for the right CHP
These considerations don’t assurance the optimum selling restriction among all the restrictions
of power but we are considering that the main interest for the that form the plane power vs. heat.
industry still being supply their own energy demands. It starts applying (16) and then using
The same could be applied to sell heat to other customers analytical geometry. The simple
but is not considered here. bounds related with the linear
restriction used should be updated
B. Proposal for CHP Economic Dispatch Problem during the process.
ii. The SQP technique is used with
The difficulties to solve a problem like (10) came from the
the now equality restrictions.
inequality linear constraints related with the µ multiplier. The
END
algorithm considered in this paper take the basis of the SQP
4. An optimum vector x with the production levels for all
procedure and the logic of the Lagrangian relaxation
units of the system is found.
technique used before to solve the economic dispatch joined
together with the unit commitment problem [4]. The key lays
IV. CASE STUDIES
in making an easier problem when the inequality constraints
are temporary removed from the problem. Then the SQP Three case studies are considered in this paper. The first
algorithm solves partially it and immediately is checked if the one shows the efficacy of the proposed algorithm using
solution is inside the trust-region that form the inequality models of units taken from [1]. The second one uses the
constraints. If the solution is in the trust-region the problem is models of units taken from [3] whose are the same used in [1]
trivial, if not then we calculate the distances from the partial but one steam turbine is added. In the last one we model a
solution to each linear inequality constraint taking them like combined cycle CHP plant and an auxiliary boiler used in a
equality to be checked later if that point is inside the trust- paper mill located in northern Mexico with software of the
region and solving the whole problem. This is achieved with THERMOFLOW company; the purchase and sell of power to
analytical geometry and by so doing the approach of the the electric utility is considered.
global solution is improved. The proposed algorithm is implemented in MATLAB
The distance from the partial solution to each now equality taking the basis of the fmincon subroutine.
constraint for one CHP unit operating into a plane bounded by
L lines is obtained with: A. Case No. 1
m ⋅h +u ⋅p +f The system addressed in [3] has a conventional power unit,
chp, l chp chp, l chp chp, l two CHP units and a boiler. Numbering each unit, their cost
dist = (16)
l =1 functions in USD/h and their capacity limits in MW are
m2 + u2 expressed with:
chp, l chp, l
4
100 (135.6,110.2)
90 purchase and sale of power from and to it is considered but
80
70
with different cost functions because the cost of power sold
60 (15.9,44) (75,40) by the utility is much higher than the cost of power bought by
50 p3 = 1.1584h3 - 46.881
40 it.
30
p3 = -0.0677h3 + 45.076
20
10
0
0 10 20 30 40 50 60 70 80 90 100 110 120 130 140
Heat [MW]
5
The cost function for the CHP plant is expressed by standard SQP to reach the solution inside the feasible region
2 of CHP units. This improvement is possible thanks to the
C ( p , h ) = −287.582 + 37.32778 ⋅ p + 0.0005 ⋅ p modification introduced in the standard SQP algorithm and
1 1 1 1 1
used in the three cases showed.
2
+ 3.898043 ⋅ h + 0.005 ⋅ h + 0.0025 ⋅ p ⋅ h Case 1 shows the same result presented in [3]. Case 2
1 1 1 1
shows an error in [5] that was corrected with our algorithm
and represented with Fig. 4. Its main restrictions are
giving moreover a better result than using only the SQP
expressed in Fig. 5.
technique. The case 3 includes sale and purchase of power to
the public utility from the CHP proprietary point of view, that
is, it was included not to optimize the sale of surplus power,
but to give additional earnings to the co-generator.
VI. REFERENCES
[1] Mexican Energy Secretary, "Prospectivas del sector electrico 2002-2011,"
Mexico, D.F., 2002.
48
47 (1.483,49.58) (36.54,48.16)
46
45 M. A. Gonzalez Chapa (B. Eng. 2001, M. Sc.
44 2003) received his B. Eng. in mechanical
(1.483,42.23)
43
42 engineering at Universidad Autonoma de Nuevo
41 (36.54,38.09) Leon (UANL) where he was awarded several times
40
with the ‘Grupo de los Cien’ recognition. He
39 p 1 = -0.1198h1 + 42.418
38 received his M. Sc. in energy at Instituto
37 Tecnologico y de Estudios Superiores de Monterrey
0 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 (ITESM). This paper is part of his M. Sc. thesis
Heat [MW] Metodology for the optimum operation in co-
generation plants. His main research areas include
Fig. 5. Feasible Operating Region unit 1in Case 3.
thermo-mechanical, electric power and CHP systems evaluation, design and
At any time the power and heat demands are 35 MW and operation as well as alternate sources of energy, HVAC systems efficient design
40 MW respectively. and computerized energetic simulation.
Following the steps of the algorithm the final optimum
vector is x = [38.096 0 36.544 3.456 − 3.096] . Thus the
plant will operate with the CHP and boiler units and will sell
power to the utility. The operation cost is 1,286.2 USD/h. J. R. Vega Galaz (B. Eng. 1985, M. Sc. 1988, Ph. D.
Details on the modeling process can be obtained from the 1993, B. A. 1997) received his B. Eng. in
author M. Sc. thesis [6]. electromechanical engineering and his M. Sc. in
electrical engineering at ITESM. He received the Ph.
D. in electrical engineering at UANL. He was
awarded with the annual research prize of the UANL
V. CONCLUSIONS in 1994 with the doctoral thesis Methodology to
evaluate the economical an electrical feasibility of
The algorithm proposed in this paper to solve the ED cogeneration plants. He received the Bachelor in
problem shows a more effectively performance than the Philosophy in the Pontifical University of the Holy Cross in Rome, Italy. The
6