Professional Documents
Culture Documents
Joergen T. Haahr
Technical University of Denmark
Tinkle Chugh
University of Jyvaskyla, Finland
Viktor Slednev
Karlsruhe Institute of Technology, Germany
Problem definition
To supply power from various units at each hour so that demand can
be meet
-In least cost
-In maximum reliability
-In maximum smoothness
Criteria:
Variables:
Cost
Reliability
Smoothness
Y (i, h)
Re liability Y (i, h)
i
Smoothness Y (i, h)
i
P(i, h) d (h)
R(i, h) d (h) * SR
Payoff matrix
Cost
1162830
1817475
1687815
Reliability Smoothness
83
10
166
8
90
4
Cost
Reliability
Smoothness
1162830
83
10
1355045
166
1236925
96
MCDM approaches
Weighted sum method:
Minimize
w1*Cost + w2*Reliability + w3*Smoothness
Subject to
wi 1
i
() Constraint method:
Minimize
Cost
Subject to
Reliability 1
Contd
Weighted sum method:
Minimize
w1*Cost + w2*Reliability + w3*Smoothness
Subject to
wi 1
i
() Constraint method:
Minimize
Cost
Subject to
Reliability 2
3 D weighted sum
3 D epsilon constraint
13579-
equally important
something more important
clearly more important
much more important
exactly more important
Society weights
Comparison of weights
Compromise programming
1 , =
=1
, = max
()
=1.
()
Cost
Reliability Smoothness
1162830
83
10
1355045
166
1236925
96
min
.
()
( = 1, . , )
w1 = 0.151007
w2 = 0.184564
w3 = 0.66443
Compromise Programming
Goal programming
Goal Type
Significance
Minimise
pi
ni
ni+pi
=
=1
+ =
wi (1 / 3) i
Cost
Subject to:
= 1, ,
= 1, ,
*
i
Reliability Smoothness
1162830
83
10
1355045
166
1236925
96
Goal programming
= 1
=1
+d
+ = = 1, ,
,
= 1, ,
( = 1, . , )
( = 1, . , )
Concluding Remarks
Model formulation
Basic MCDM approaches: weighted sum and constraint
method
Payoff Matrix
Role of decision maker
Group decision making
Interactive approach: reference point method
Compromise programming
Goal programming
Heuristic approaches
Metaheuristic approaches
Thank You