24

A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

  • Upload
    others

  • View
    3

  • Download
    0

Embed Size (px)

Citation preview

Page 1: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

A deterministic approach for the non-smoothmulti-objective dispatch problem

Code: 02.038

Elis Gonçalves1, Antonio Roberto Balbo2, Diego Nunes da Silva3

1Graduate program in electrical engineering, FEB-UNESP, Bauru-SP, Brazil (e-mail:[email protected]).2Mathematics department, FC-UNESP, Bauru-SP, Brazil (e-mail:[email protected]).3Graduate program in electrical engineering, EESC-USP, São Carlos - SP, Brazil (e-mail:[email protected]).

14/11/2017 1

Page 2: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Table of contents

1. Introduction

2. Objectives

3. Problem formulation

4. Methodology

5. Results

6. Conclusions

7. References

14/11/2017 2

Page 3: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Introduction

I The fossil fuel �red power plant operation releases large amounts of pollutantsinto the atmosphere, which is why operating at the lowest cost is no longerthe only objective during this generation process;

I The dispatch problems great importance in the area of electric power systemsand contribute in thermoelectric generation in order to reduce costs and/oremission of pollutants;

I To invest in e�cient strategies that minimize the costs and the emission ofpollutants in these plants, modeling the problem in a way that is closer tothe real situation.

14/11/2017 3

Page 4: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Introduction

I EEDP-VPL: multi-objective economic and environmental dispatch problemwith valve-point loading e�ect and losses.

I When valve-point loading e�ects are introduced in the generation cost func-tion, this problem is characterized as a multi-objective, nonlinear, non-convexand non-di�erentiable;

I Due to the di�culties, the great majority of solution techniques for solvingthe EEDP-VPL involve heuristic or meta-heuristic methods.

14/11/2017 4

Page 5: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Objectives

I The objective of this work is to present a composition of methods to solvethe problem EEDP-VPL:

I Multi-objective problem solution methods: transform the multi-objective prob-

lem into a set of single-objective subproblems;

I Function smoothing procedure: it is necessary due to the non-di�erentiable

characteristics;

I Deterministic optimization method: nonlinear rescaling method based on the

modi�ed logarithmic barrier function, inertia correction strategy and predictor-

corrector procedures.

I The results will be compared with a heuristic optimization methods availablein the literature.

14/11/2017 5

Page 6: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Problem formulation

I The EEDP-VPL is formulated as:

Min. {C (p),E (p)}

S. to:n∑

i=1

pi − Pd − PL = 0

Pmini 6 pi 6 Pmax

i ;∀i = 1, · · · , n.

(1)

I The objectives of the problem are con�icting: when the cost has minimumvalue, the emission has maximum value and when the emission is minimum,the cost is maximum.

14/11/2017 6

Page 7: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Problem formulation

I The objective functions of the economic and environmental dispatch

C (p) =k∑

i=1

Ci (pi ) =k∑

i=1

aip2i + bipi + ci+

k∑i=1

∣∣ei sin(fi (Pmini − pi ))

∣∣ (2)

E (p) =k∑

i=1

E (pi ) =k∑

i=1

αip2i + βipi + γi (3)

14/11/2017 7

Page 8: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

PBC method

I The ideal solution that minimizes both functions is known in the literatureas utopic;

I In order to determine the set of e�cient solutions (Pareto-optimal curve),multiple single-objective subproblems are solved through the deterministicmethod.

I In this work, the Progressive Bounded Constraint method (PBC) was devel-oped to generate the subproblems.

I One of the objective functions is selected to be optimized while the other is

converted into constraint by setting upper and lower bounds to it.

14/11/2017 8

Page 9: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

PBC method

Min. C (p)

S. to:n∑

i=1

pi − Pd − PL = 0

ε−n < E (p) ≤ ε+n ,Pmini 6 pi 6 Pmax

i ;∀i = 1, · · · , n.(4)

14/11/2017 9

Page 10: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Hyperbolic smoothing

I To handle the non-di�erentiability, we adopt a smoothing approach. In theHyperbolic smoothing method, the modular terms is replaced by an approxi-mate function.

Minimize z = |f (x)|Subject to: x ∈ φ

(5)

Minimize w(f (x), η) =

√(f (x))2 + η2

Subject to: x ∈ φ(6)

where η > 0 is the smoothing parameter, which progressively approaches to zero.

14/11/2017 10

Page 11: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling

I Consider the NLP problem with the slack variables:

Minimize f (x)

Subject to: g(x) = 0

h(x) + s = 0

s > 0

(7)

I The transformed problem based on the MLBF is de�ned in:

Minimize f (x)− µp∑

j=1

δj ln(µ−1sj + 1)

Subject to: g(x) = 0

h(x) + s = 0

(8)

14/11/2017 11

Page 12: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling

Lµ(x , s,λ,ν) = f (x)− µp∑

j=1

δj ln(µ−1sj + 1) +m∑i=1

λigi (x) +

p∑j=1

νj [hj(x) + sj ].

(9)

I First order optimality conditions are applied and the nonlinear system is ob-tained:

∇xLµ(x , s, λ, ν) = ∇f (x) + Jg(x)tλ+ Jh(x)tν = 0 (10a)

∇sLµ(x , s, λ, ν) = −µS̄−1δ + ν = 0 (10b)

∇λLµ(x , s, λ, ν) = g(x) = 0 (10c)

∇νLµ(x , s, λ, ν) = h(x) + s = 0 (10d)

14/11/2017 12

Page 13: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling: inertia correction

I In non-convex problems, the system solution may not be a local minimum;

I If the matrix does not have the desired inertia, modi�cations can be made toobtain an adequate inertia and descent search directions.

14/11/2017 13

Page 14: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling: directions

I The search directions of predictor and corrector procedure are calculated;

I The choice between directions of the predictor and corrector procedures isdone based on the complementarity value;

I The barrier parameter is updated by the rule:

µk+1 = τ1µk (11)

I Two solutions are calculated: one using the predictor direction and otherusing the corrector direction.

14/11/2017 14

Page 15: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling: step

αkP,pred = σmin

{1,−

(skj + τ1µk)

∆̃skj: ∆̃skj < 0

}, (12)

αkP,cor = σmin

{1,−

(skj + τ1µk)

∆skj: ∆skj < 0

}. (13)

αkD,pred = σmin

{1,−

νkj

∆̃νkj: ∆̃νkj < 0

}, (14)

αkD,cor = σmin

{1,−

νkj

∆νkj: ∆νkj < 0

}. (15)

14/11/2017 15

Page 16: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Nonlinear rescaling: stopping rule

The stopping rule is de�ned by:

∥∥∥∇L(xk , sk ,λk ,νk)∥∥∥∞

6 ε. (16)

14/11/2017 16

Page 17: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Results

I The composition of methods proposed in this work were implemented inMatlab 2011a language;

I Tests were performed on the systems of 6 and 10 generators;

I The results obtained by the proposed method was compared with the multi-objective di�erential evolution algorithm (MODE), obtained in [Basu, 2011].

14/11/2017 17

Page 18: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Results

Case with 6 generating units

Table 1: Cost and emission for the 6-generators test case.

MODE PBC-HS-NRIC

Cost ($) 64083.00 64099.27Emission (lb) 1240.70 1236.63

14/11/2017 18

Page 19: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Results

Case with 6 generating units

14/11/2017 19

Page 20: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Results

Case with 10 generating units

Table 2: Cost and emission for the 10-generators test case.

MODE PBC-HS-NRIC

Cost ($) 111500.0 111493.73Emissão (lb) 3923.40 3915.35

14/11/2017 20

Page 21: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Results

Case with 10 generating units

14/11/2017 21

Page 22: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Conclusions

I A composition of methods was developed in this work, involving:

I Progressive bounded constraint method;I Hyperbolic smoothing;I Nonlinear rescaling method based on modi�ed logarithmic barrier function,

with predictor-corrector procedure and inertia correction strategy.

I Some highlights:

I EEDP-VPL objective function: non-convex and non-di�erentiable;I Hyperbolic smoothing proved to be a good strategy for dealing with non-

smooth functions;I The progressive bounded constraint method supported the deterministic

method to obtain e�cient solutions.

14/11/2017 22

Page 23: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

Acknowledgments

14/11/2017 23

Page 24: A deterministic approach for the non-smooth multi ... · A deterministic approach for the non-smooth multi-objective dispatch problem Code: 02.038 Elis Gonçalves 1, Antonio Roberto

References

Basu, M. (2011).Economic environmental dispatch using multi-objective di�erential evolution.

Applied Soft Computing, 11(2):2845 � 2853.

Chen, X. (2012).Smoothing methods for nonsmooth, nonconvex minimization.Mathematical Programming, 134(1):71�99.

Polyak, R. A. (1992).Modi�ed barrier functions.Mathematical Programming, 54.

14/11/2017 24