Top Banner
Resource constrained shortest path algorithm for EDF short-term thermal production planning problem Pascal Benchimol 1 Markus Kruber 2 Axel Parmentier 3 1 EDF 2 Chair of Operations Research, RWTH Aachen University 3 CERMICS, ´ Ecole des Ponts Paristech November 14, 2017
35

Resource constrained shortest path algorithm for EDF short ...

Oct 15, 2021

Download

Documents

dariahiddleston
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm forEDF short-term thermal production planning

problem

Pascal Benchimol1 Markus Kruber2 Axel Parmentier3

1EDF

2Chair of Operations Research, RWTH Aachen University

3CERMICS, Ecole des Ponts Paristech

November 14, 2017

Page 2: Resource constrained shortest path algorithm for EDF short ...

[...] EDF short-term thermal production planning problem

.Generation units

I ∼ 60 nuclear

I ∼ 100 thermal

I ∼ 500 hydraulic

Technically feasibleproduction schedules

Min operating cost

Horizon: 24h + 24h

Time limit: 15min

1 / 21

Page 3: Resource constrained shortest path algorithm for EDF short ...

[...] EDF short-term thermal production planning problem

.Generation units

I ∼ 60 nuclear

I ∼ 100 thermal

I ∼ 500 hydraulic

Technically feasibleproduction schedules

Min operating cost

Horizon: 24h + 24h

Time limit: 15min

1 / 21

Page 4: Resource constrained shortest path algorithm for EDF short ...

[...] EDF short-term thermal production planning problem

.Generation units

I ∼ 60 nuclear

I ∼ 100 thermal

I ∼ 500 hydraulic

Technically feasibleproduction schedules

Min operating cost

Horizon: 24h + 24h

Time limit: 15min

1 / 21

Page 5: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups · min duration production levelmin duration power state · #modulations · shutdownmin/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 6: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups

· min duration production levelmin duration power state · #modulations · shutdownmin/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 7: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups · min duration production level

min duration power state · #modulations · shutdownmin/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 8: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups · min duration production levelmin duration power state · #modulations

· shutdownmin/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 9: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups · min duration production levelmin duration power state · #modulations · shutdown

min/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 10: Resource constrained shortest path algorithm for EDF short ...

Resource constrained shortest path algorithm [...]

off

state 0

state 1

.time

startup · #startups · min duration production levelmin duration power state · #modulations · shutdownmin/max power state · min/max increase/decrease#deep decreases

2 / 21

Page 11: Resource constrained shortest path algorithm for EDF short ...

Table of Content

1. The Unit Commitment Problem

2. Resource Constraint Shortest Path Problem

3. Enumeration Algorithms

4. Computational Results

3 / 21

Page 12: Resource constrained shortest path algorithm for EDF short ...

Introduction of the Unit Commitment Problem

Part of lagrangian relaxation approach:

Input:

I discretization of the time horizon (96 steps)

I operation cost of the plants depending on power level

I electricity prices for each time step

I technical constraints

Output:

I production plan

I such that: technical constraints are respected

I which: maximizes profit - operating cost

4 / 21

Page 13: Resource constrained shortest path algorithm for EDF short ...

Model & Scope

Assume we can generate all technically feasible production plansPi for each plant i ∈ V .

minimize∑p∈P

cpxp

subject to∑p∈Pi

xp = 1 ∀i ∈ V

xp ∈ {0, 1} ∀p ∈ P

Scope of this talk

I assume problems areindependent

I solve each subproblemseparately

Problem faced in reality

I linked by shared gasstock

I column generationapproach

I pricing is still RCSPP

5 / 21

Page 14: Resource constrained shortest path algorithm for EDF short ...

Model & Scope

Assume we can generate all technically feasible production plansPi for each plant i ∈ V .

minimize∑p∈P

cpxp

subject to∑p∈Pi

xp = 1 ∀i ∈ V

xp ∈ {0, 1} ∀p ∈ P

Scope of this talk

I assume problems areindependent

I solve each subproblemseparately

Problem faced in reality

I linked by shared gasstock

I column generationapproach

I pricing is still RCSPP

5 / 21

Page 15: Resource constrained shortest path algorithm for EDF short ...

Model & Scope

Assume we can generate all technically feasible production plansPi for each plant i ∈ V .

minimize∑p∈P

cpxp

subject to∑p∈Pi

xp = 1 ∀i ∈ V

xp ∈ {0, 1} ∀p ∈ P

Scope of this talk

I assume problems areindependent

I solve each subproblemseparately

Problem faced in reality

I linked by shared gasstock

I column generationapproach

I pricing is still RCSPP

5 / 21

Page 16: Resource constrained shortest path algorithm for EDF short ...

Table of Content

1. The Unit Commitment Problem

2. Resource Constraint Shortest Path Problem

3. Enumeration Algorithms

4. Computational Results

6 / 21

Page 17: Resource constrained shortest path algorithm for EDF short ...

Shortest Path in an Ordered Monoid

For each arc a a resource qa ∈ RI Associative binary operator ⊕: path resources

I Neutral element 0: empty path

q1 q2 q3 qP = q1 ⊕ q2 ⊕ q3

(R,⊕) is a monoid.

I An order � compatible with ⊕ : q � q ⇒{r ⊕ q � r ⊕ qq ⊕ r � q ⊕ r

(R,⊕,�) is an ordered monoid.

I Non-decreasing cost c andconstraint ρ functions.

7 / 21

Page 18: Resource constrained shortest path algorithm for EDF short ...

Shortest Path with Resources in an Ordered Monoid

Given an ordered monoid (R,⊕,�)Input:

I Digraph D = (V,A)

I Two vertices o, d ∈ VI Resources qa ∈ RI Two non-decreasing

oracles c : R → Rρ : R → {0, 1}

Output:

I An o-d path P such that

ρ(⊕

a∈P qa)= 0

which minimizes

c(⊕

a∈P qa)

Cost and constraint(s):

I non-linear(s)qP = q1 ⊕ q2 ρ(qP ) = 0

o dq1 q2

8 / 21

Page 19: Resource constrained shortest path algorithm for EDF short ...

Example 1: Usual Resource Constrained Shortest Path

Input:

I Digraph D = (V,A)

I Origin o, Destination d

I Costs ca ∈ RI Weights wia ∈ R for i ∈ [n]

I Thresholds W i ∈ R fori ∈ [n]

Output:

I An o-d path P such that∑a∈P

wia ≤W i ∀i ∈ [n]

which minimizes∑a∈P

ca

Model:

I R = Rn+1

I qa = (ca, w1a, . . . , w

na )

I c : ((q0, . . . , qn)) 7→ q0

I ρ : ((q0, . . . , qn)) 7→ maxi∈{1,...,n}

1qi>W i

9 / 21

Page 20: Resource constrained shortest path algorithm for EDF short ...

Example 1: Usual Resource Constrained Shortest Path

Input:

I Digraph D = (V,A)

I Origin o, Destination d

I Costs ca ∈ RI Weights wia ∈ R for i ∈ [n]

I Thresholds W i ∈ R fori ∈ [n]

Output:

I An o-d path P such that∑a∈P

wia ≤W i ∀i ∈ [n]

which minimizes∑a∈P

ca

Model:

I R = Rn+1

I qa = (ca, w1a, . . . , w

na )

I c : ((q0, . . . , qn)) 7→ q0

I ρ : ((q0, . . . , qn)) 7→ maxi∈{1,...,n}

1qi>W i

9 / 21

Page 21: Resource constrained shortest path algorithm for EDF short ...

Example 2: Restricting Startups

Input:

I Digraph D = (V,A)

I Origin o, destination d

I wa =

{1, if startup arc,0, otherwise.

I Max startups W start

Output:

I An o-d path P ofminimum cost such thatthe number of startupsper plant is not greaterthan W start.

Model:

I R = R2

I qa = (ca, wa)

I c : ((q0, q1)) 7→ q0

I ρ : ((q0, q1) 7→ 1q1>W start

10 / 21

Page 22: Resource constrained shortest path algorithm for EDF short ...

Example 2: Restricting Startups

Input:

I Digraph D = (V,A)

I Origin o, destination d

I wa =

{1, if startup arc,0, otherwise.

I Max startups W start

Output:

I An o-d path P ofminimum cost such thatthe number of startupsper plant is not greaterthan W start.

Model:

I R = R2

I qa = (ca, wa)

I c : ((q0, q1)) 7→ q0

I ρ : ((q0, q1) 7→ 1q1>W start

10 / 21

Page 23: Resource constrained shortest path algorithm for EDF short ...

Example 3: Minimum Duration in Online State

off

state 0

state 1

.

Stay in online state for at least W on.

(ca, w1a)⊕ (ca′ , w

1a′) =

∞ , if w1

a < 0 ∧ w1a′ < 0,

w1a′ , if w1

a ≥ 0 ∧ w1a′ < 0,

w1a + w1

a′ , otherwise

11 / 21

Page 24: Resource constrained shortest path algorithm for EDF short ...

Example 3: Minimum Duration in Online State

off

state 0

state 1

−W on−W on

0

t tt

.

Stay in online state for at least W on.

(ca, w1a)⊕ (ca′ , w

1a′) =

∞ , if w1

a < 0 ∧ w1a′ < 0,

w1a′ , if w1

a ≥ 0 ∧ w1a′ < 0,

w1a + w1

a′ , otherwise

11 / 21

Page 25: Resource constrained shortest path algorithm for EDF short ...

Example 3: Minimum Duration in Online State

off

state 0

state 1

−W on−W on

0

t tt

.

Stay in online state for at least W on.

(ca, w1a)⊕ (ca′ , w

1a′) =

∞ , if w1

a < 0 ∧ w1a′ < 0,

w1a′ , if w1

a ≥ 0 ∧ w1a′ < 0,

w1a + w1

a′ , otherwise

11 / 21

Page 26: Resource constrained shortest path algorithm for EDF short ...

Table of Content

1. The Unit Commitment Problem

2. Resource Constraint Shortest Path Problem

3. Enumeration Algorithms

4. Computational Results

12 / 21

Page 27: Resource constrained shortest path algorithm for EDF short ...

Usual A∗ algorithm

o

v

d

P ≤ bv≥ CUBod

PI qP ∈ R

I CUBod ≥ minP∈Po,d

qP

I bv ≤ qP , ∀P ∈ Pvd

A path P ∈ Pov satisfying qP + bv > CUBod is not the subpath of anoptimal path.

A* algorithm: a Branch & Bound

I Generate all the paths satisfying

qP + bv ≤ CUBodI Update CUBod

D

o dA∗

Dijkstra

13 / 21

Page 28: Resource constrained shortest path algorithm for EDF short ...

Generalized A∗ algorithm

o

v

d

P � bv≥ CUBod

PI qP ∈ R

I CUBod ≥ minP |ρ(P )=0

c(qP )

I bv � qP , ∀P ∈ Pvd

A path P ∈ Pov satisfying c(qP ⊕ bv) > CUBod or ρ(qP ⊕ bv) = 1 isnot the subpath of an optimal path.

Generalized A∗ Algorithm: a Branch & Bound

I Generate all the paths satisfying

c(qP ⊕ bv) ≤ CUBod and ρ(qP ⊕ bv) = 0 (Low)

I Update CUBod

14 / 21

Page 29: Resource constrained shortest path algorithm for EDF short ...

Generic enumeration algorithm

Preprocessing.L← empty path in ocUBod ← +∞.While L is not empty:

I Extract from L a path P ofminimum key.

I If v = d and ρ(P ) = 0,cUBod ← min(cUBod , c(P )).

I Test if P must be extended. If yes:I for each a ∈ δ+(v), add P + a to L.

L: cand. paths list.cUBod : Upper bound onoptimal path cost.v: destination of P .

Add. structures

bv: lower bound on v-dpaths qPMv: list of nondominated o-v paths

Algorithm Test Key

Generalized A∗ (Low) c(qP ⊕ bv)Label dominance (Dom) c(qP )Label correcting (Dom), (Low) c(qP ⊕ bv)

15 / 21

Page 30: Resource constrained shortest path algorithm for EDF short ...

Table of Content

1. The Unit Commitment Problem

2. Resource Constraint Shortest Path Problem

3. Enumeration Algorithms

4. Computational Results

16 / 21

Page 31: Resource constrained shortest path algorithm for EDF short ...

Some Numbers

I PlantsI 8 gas plants (3, 3, 2)I 97 non-gas plants

I Size of graph (depends on the model)I ∼ 2.000 nodesI ∼ 10.000 arcs

17 / 21

Page 32: Resource constrained shortest path algorithm for EDF short ...

Solving Non-Gas Subproblem

EDF V1 V2 V30

50

100

56.3 52.1

3.6

117.1so

lvin

gti

me

(ms)

selection

key

#iter

#dis dom

#dis bound

#od paths

speedup

node

early date

2.100

190k

0

327

1.00x

node

early date

1.914

137k

79k

14

0.93x

path

qp ⊕ bv3.596

9k

9k

1

0.06x

pathqp

230.763

201k

1.029k

899

2.08x18 / 21

Page 33: Resource constrained shortest path algorithm for EDF short ...

Arcs touched by previous algorithm

19 / 21

Page 34: Resource constrained shortest path algorithm for EDF short ...

Arcs touched by our algorithm

20 / 21

Page 35: Resource constrained shortest path algorithm for EDF short ...

Summary

I Redesign of the graph

I Modeling unit commitment problem as RCSPP in latticeordered monoid

I (Conditional) bound computation

I Using a Generalized A∗ algorithm

I Solving of nongas / gas pricing problems

I Column generation - Multi Unit Commitment Problem

I Pareto Frontier

21 / 21