OPTIMAL POINT TARIFFS IN TRANSMISSION AND DISTRIBUTION USING - - PowerPoint PPT Presentation

optimal point tariffs in transmission and distribution
SMART_READER_LITE
LIVE PREVIEW

OPTIMAL POINT TARIFFS IN TRANSMISSION AND DISTRIBUTION USING - - PowerPoint PPT Presentation

The Ninth IASTED European Conference on Power and Energy Systems ~EuroPES 2009~ September 7 9, 2009, Palma de Mallorca, Spain OPTIMAL POINT TARIFFS IN TRANSMISSION AND DISTRIBUTION USING NONNEGATIVE LEAST SQUARES ESTIMATES by Egill


slide-1
SLIDE 1

1

OPTIMAL POINT TARIFFS IN TRANSMISSION AND DISTRIBUTION USING NONNEGATIVE LEAST SQUARES ESTIMATES

by Egill Benedikt Hreinsson Department of Electrical and Computer Engineering, University of Iceland, Hjardarhagi 6, Reykjavik, (Iceland) Email: egill@hi.is

The Ninth IASTED European Conference on Power and Energy Systems ~EuroPES 2009~ September 7 – 9, 2009, Palma de Mallorca, Spain

slide-2
SLIDE 2

Presentation overview

  • Introduction
  • Model for optimal point tariffs

–Least squares deviations from nodal prices

  • Simple computational examples
  • Discussion and conclusion
slide-3
SLIDE 3

Introduction

  • Assume a power system with many nodes
  • Assume at each node we have Lagrange

multipliers reflecting the nodal energy price at each note ?

–These prices are the multipliers to real power

constraints for each node in an OPF formulation.

  • The transmission cost between nodes is given by

the difference in nodal prices ?

  • How should we set up point tariffs to reflect as

accurately as possible these transmission prices?

slide-4
SLIDE 4

4

Transmission costs

The marginal cost difference between an injection node i and extraction node j is

ij i j

λ λ λ = −

  • Assume the injection and extraction involves quantity

ij

u

  • Marginal transmission cost (congestion rent) is skew

symmetric, or

ij ji

λ λ = −

  • The cost matrix:

12 1 12 2 1 2 N N N N

λ λ λ λ λ λ − −

  • =
  • total transmission charges

TXMCOST 1 1 N N ij ij i j

C u λ

= =

=

slide-5
SLIDE 5

5

An over-determined set of linear equations

The problem involves an over-determined set of linear equations with nonnegative constraints:

( ) , 0 ; ,

ij i j ij ij i i

u r s u i j r s i j λ + = ∀ ≥ ≥ ∀

This set can be rewritten:

= ≥ Ax b x

slide-6
SLIDE 6

The least squares problem

Minimize subject to where: is a known coefficient matrix, , is the element vector with known constants, and is the element unknown solution vector. m n m n m n − ≥ × ≥ Ax b x A b x

slide-7
SLIDE 7

A simple (trivial) 2 node system

1 2 λ1 r1 s1 r2 s2 λ2 3 1 2 2 1 1

1 1 1 2 2 1 2 2

2 2 4 2 r s r s r s r s + = + = + = − + =

1 1

0.8889 , 0 , r s = =

2 2

0 , 0.8889 r s = =

slide-8
SLIDE 8

A simple 3 node system

1 2

λ

1

λ

2

3

λ

3

Assume that

1 2 3

1 ; 2 ; 3 λ λ λ = = =

and all contracts are for simplicity sake equal or

1

ij

u =

unit from one node i to node j . Then we have the following set of equations:

1 1 1 2 1 3 2 2 1 2 2 3 1 3 2 3 3 3

1 2 1 1 2 1 r s r s r s r s s r r s s r s r r s + = + = − + = − + = + = + = − + = + = + =

slide-9
SLIDE 9

Matlab formulation and results

A=[1 1 0 0 0 0;1 0 0 1 0 0;1 0 0 0 0 1; 0 0 1 1 0 0;0 1 1 0 0 0;0 0 1 0 0 1; 0 1 0 0 1 0;0 0 0 1 1 0;0 0 0 0 1 1] b=[0;-1;-2;0;1;-1;2; 1; 0] x= lsqnonneg(A,b) A = 1 1 0 0 0 0 1 0 0 1 0 0 1 0 0 0 0 1 0 0 1 1 0 0 0 1 1 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 0 0 1 1 0 0 0 0 0 1 1 x = 0.7500 0.7500 b =

  • 1
  • 2

1

  • 1

2 1

slide-10
SLIDE 10

Non zero diagonal line of A

If we for instance relax the requirement of the diagonal line in

ij

λ by setting a price for the input/output at the same bus

in the first, 4th and the last equation of the previous eq., for instance 0.2, 0.4 and 0.6 units respectively, we get (rearranged for simplicity and compactness):

b = 0.2000

  • 1.0000
  • 2.0000

0.4000 1.0000

  • 1.0000

2.0000 1.0000 0.6000 x = 0.7500 0.9500

This means that:

3

0.75 r = while

1

0.95 s = and other charges are zero so it does not alter basically the structure

  • f the least squares solution.
slide-11
SLIDE 11

Discussions and conclusions

  • Optimal instantaneous marginal costs.
  • Snapshot of operating conditions.
  • Economic efficiency.
  • Fixed cost recovery
  • Wider range spatial equalization of charges.
slide-12
SLIDE 12

Suggestions for further research

  • Define a system of realistic size with tens, hundreds or thousands of buses

and define an appropriate time period with time steps.

  • Define the basic operating conditions such as a basic load and basic

bilateral contracts on top of that basic load as injections and extractions of specified MWh’s in each time step (on top of that basic load).

  • Run an OPF for all time steps and obtain Lagrange

multipliers for each node and each time step as nodal marginal prices.

  • Consider other requirements such as recovering fixed cost for

each transmission link or for the system as a whole and how this condition is merged with the problem definition and model formulation.

  • Run the least squares calculation considering the zonal partitioning in the

system, if any, and adaptation to covering the fixed costs recovery during the time frame selected.

  • Interpret the results by calculating the total charges and how these total

charges compare for instance with marginal prices and total transmission costs accumulated for all transaction.

slide-13
SLIDE 13

Thank you