5 unit commitment

Upload: prima-d-andri

Post on 01-Mar-2018

221 views

Category:

Documents


1 download

TRANSCRIPT

  • 7/25/2019 5 Unit Commitment

    1/17

    Unit Commitment:A MCDM case study

    Joergen T. HaahrTechnical University of Denmark

    Tinkle ChughUniversity of Jyvaskyla, Finland

    Viktor SlednevKarlsruhe Institute of Technology, Germany

  • 7/25/2019 5 Unit Commitment

    2/17

    Problem definition

    Parameters:hourly demand: d(h), Maximum Power, Minimum Power, UpRamp, Down Ramp, Linear Cost, Fix_Cost, Starting Cost, Stopping Cost

    Criteria: Cost Reliability Smoothness

    To supply power from various units at each hour so that demand can

    be meet-In least cost

    -In maximum reliability

    -In maximum smoothness

    if unit i is used to produce power

    else

    0

    1),( hiY

    Variables: Power production (MWh): P(i,h)

    ),(

    ),(

    hiY

    hiY

    1 If unit i is started in hour h

    1 If unit is stopped in hour h

  • 7/25/2019 5 Unit Commitment

    3/17

    Model and optimization formulation

    Re liability ( , )i h

    Y i h

    i h

    hiY ),(Smoothness

    hihiYhiY

    hihiYhiY

    hiiURhiRhiPhiP

    hihiYiURhiR

    hSRhdhiR

    hihiYhiYhiYhiY

    hiiURhiPhiPiDR

    hiiMaxPowerhiYhiPiMinPowerhiY

    hhdhiP

    i

    i

    ,)1,(1),(

    ,),(),(

    ,)(),()1,(),(

    ,),()(),(

    *)(),(

    ,),()1,(),(),(

    ,)()1,(),()(

    ,)(),(),()(),(

    )(),(

    i

    ),(),(),(),(Cost

    h

    stopCosthiYstartCosthiYFChiYLChiP

  • 7/25/2019 5 Unit Commitment

    4/17

    Payoff matrix

    Cost Reliability Smoothness

    1162830 83 10

    1817475 166 8

    1687815 90 4

    Cost Reliability Smoothness

    1162830 83 10

    1355045 166 8

    1236925 96 4

  • 7/25/2019 5 Unit Commitment

    5/17

    MCDM approaches

    Weighted sum method:

    Minimize w1*Cost + w2*Reliability + w3*SmoothnessSubject to i

    iw 1

    () Constraint method:

    Minimize Cost

    Subject to Reliability 1

  • 7/25/2019 5 Unit Commitment

    6/17

    ContdWeighted sum method:

    Minimizew

    1*Cost +w

    2*Reliability +w

    3*SmoothnessSubject to i

    iw 1

    () Constraint method:

    Minimize Cost

    Subject to Reliability 2

  • 7/25/2019 5 Unit Commitment

    7/17

    3 D weighted sum

  • 7/25/2019 5 Unit Commitment

    8/17

    3 D epsilon constraint

  • 7/25/2019 5 Unit Commitment

    9/17

    Decision maker preferences

    1- equally important

    3- something more important

    5- clearly more important7- much more important

    9- exactly more important

  • 7/25/2019 5 Unit Commitment

    10/17

    Society weights

    w1= 0.151007, w2= 0.184564, w3= 0.66443

  • 7/25/2019 5 Unit Commitment

    11/17

    Comparison of weights

  • 7/25/2019 5 Unit Commitment

    12/17

    Compromise programming

    , ()

    =

    , max=.

    ()

    min .

    ()

    ( 1 , . , )

    Cost Reliability Smoothness

    1162830 83 10

    1355045 166 8

    1236925 96 4

    w1= 0.151007

    w2= 0.184564

    w3= 0.66443

  • 7/25/2019 5 Unit Commitment

    13/17

    Compromise Programming

  • 7/25/2019 5 Unit Commitment

    14/17

    Goal programmingGoal Type Significance Minimise

    1 Achieve at most the target level pi

    2 Achieve at least the tartget level ni

    3 Achieve the target level exactly ni+pi

    ||1.0 ***

    iii zzzGoals

    iwi

    )3/1(

    Cost Reliability Smoothness

    1162830 83 10

    1355045 166 8

    1236925 96 4

    +

    =

    + 1 , , , 1 , ,

    Subject to:

  • 7/25/2019 5 Unit Commitment

    15/17

    Goal programming

    + 1 , , , 1 , ,

    1

    +

    =+

    d

    ( 1 , . , )

    ( 1, . , )

  • 7/25/2019 5 Unit Commitment

    16/17

    Concluding Remarks

    Model formulation

    Basic MCDM approaches: weighted sum and constraintmethod

    Payoff Matrix

    Role of decision maker

    Group decision making

    Interactive approach: reference point method

    Compromise programming

    Goal programming

    Heuristic approaches

    Metaheuristic approaches

  • 7/25/2019 5 Unit Commitment

    17/17

    Thank You