1 S ystems Analysis Laboratory Helsinki University of Technology Goal intervals in dynamic multicriteria problems The case of MOHO Juha Mäntysaari.

Slides:



Advertisements
Similar presentations
Anna Küller, Josefin Thoresson, Department of thematic studie, technology and social change, Linköping University Linn Liu, Division of energy systems,
Advertisements

Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Management and Control of Domestic Smart Grid Technology IEEE Transactions on Smart Grid, Sep Albert Molderink, Vincent Bakker Yong Zhou
Solving LP Problems in a Spreadsheet
Adopt Algorithm for Distributed Constraint Optimization
Understanding optimum solution
Automated Demand Response Pilot 2005/2004 Load Impact Results and Recommendations Final Report © 2005 Rocky Mountain Institute (RMI) Research & Consulting.
1 Q: Why is the tangent point special?. 2 A: It gives us a short cut.
SENSITIVITY ANALYSIS.
S ystems Analysis Laboratory Helsinki University of Technology Near-Optimal Missile Avoidance Trajectories via Receding Horizon Control Janne Karelahti,
Multi-objective optimization multi-criteria decision-making.
P1.3 Electrical Energy. Power Power (watts) = Energy Transferred (joules) Time (seconds) This means the more powerful something is, the more energy is.
LP EXAMPLES.
GIA Tariff Changes GIA Billing Workshop May 24, 2005 For Discussion and Informational Purposes Only.
Introduction to Linear and Integer Programming
1 Spreadsheet Modeling & Decision Analysis: A Practical Introduction to Management Science 3d edition by Cliff Ragsdale.
IEOR 180 Senior Project Toni Geralde Mona Gohil Nicolas Gomez Lily Surya Patrick Tam Optimizing Electricity Procurement for the City of Palo Alto.
Dealing with NP-Complete Problems
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Maximum and Minimum Values (Section 3.1)
1 Least Cost System Operation: Economic Dispatch 2 Smith College, EGR 325 March 10, 2006.
Integer programming Branch & bound algorithm ( B&B )
S ystems Analysis Laboratory Helsinki University of Technology Using Intervals for Global Sensitivity and Worst Case Analyses in Multiattribute Value Trees.
Managerial Decision Making and Problem Solving
CHAPTER 8: POST OPTIMALITY ANALYSIS. What is Post Optimality Analysis?  Post Optimality Analysis –Sensitivity Analysis –What-If Analysis  what happens.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
5-1 Wyndor (Before What-If Analysis). 5-2 Using the Spreadsheet to do Sensitivity Analysis The profit per door has been revised from $300 to $200. No.
19.2 Potential difference (d) define potential difference and the volt. (e) recall and solve problems using:. f) recall and solve problems using: (d) define.
Professor: Chu, Ta Chung Student: Nguyen Quang Tung Student’s ID: M977Z235 Fuzzy multiobjective linear model for supplier selection in a supply chain.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
A Dynamic Interval Goal Programming Approach to the Regulation of a Lake-River System Raimo P. Hämäläinen Juha Mäntysaari S ystems Analysis Laboratory.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
DTM and Reliability High temperature greatly degrades reliability
Power. Definition: The amount of energy converted to heat, light, sound or motion per unit of time Unit: Power is measured in watts (W) Naming: Named.
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Integer LP In-class Prob
Multi-objective Optimization
1 Optimal operation of energy storage in buildings: The use of hot water system Emma Johansson Supervisors: Sigurd Skogestad and Vinicius de Oliveira.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Energy Consumption Energy consumption is measured in kilowatt. hours. A kilowatt hour is the amount of energy being consumed per hour. –Energy (kwh) =
Section VI Capital Rationing. Section Highlights F Capital rationing F Linear programming F Shadow prices and the cost of capital F Integer programming.
Christos G. Cassandras CODES Lab. - Boston University ELEVATOR DISPATCHING PASSENGER QUEUES COMPLEXITY: Huge state space, Movement constraints, non-stationary.
Buying electricity. Calculating the units of electricity The amount of electrical energy (i.e. the amount of electricity) used by an appliance depends.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Energy Management and Planning MSJ0210
Do Now from 1.2a Find the domain of the function algebraically and support your answer graphically. Find the range of the function.
CEDAR Detector Ventilation System Review
System Control based Renewable Energy Resources in Smart Grid Consumer
Graphical Analysis – the Feasible Region
Constrained Optimization
Raimo P. Hämäläinen Juha Mäntysaari
Linear Programming.
If we increase b2 from 10 to 20 will the optimal basis change?
Constrained Optimization
Constrained Optimization – Part 1
SOLAR PANELS SAVING IN YOUR HOME!
7.5 – Constrained Optimization: The Method of Lagrange Multipliers
Power Consumption & Cost
Y11 INTERVENTION : Energy, efficiency and kWh
Constrained Optimization – Part 1
SnapChat Mini-Project
Constrained Optimization
Investigation 3: Using Samples to Draw Conclusions
Presentation transcript:

1 S ystems Analysis Laboratory Helsinki University of Technology Goal intervals in dynamic multicriteria problems The case of MOHO Juha Mäntysaari

2 S ystems Analysis Laboratory Helsinki University of Technology Decision problem of space heating consumers Under time varying electricity tariff space heating consumers can save in heating costs by –Storing heat in to the house during low tariff hours –Trading living comfort to costs savings A dynamic decision problem

3 S ystems Analysis Laboratory Helsinki University of Technology Space heating problem Space heating consumers try to –MIN “Heating costs” –MAX “Living comfort” subject to Dynamic price of the electricity Dynamics of house Other (physical) constraints

4 S ystems Analysis Laboratory Helsinki University of Technology Dynamics of the house Q(t)=Q(t-1)+  tq(t-1)-d(t-1) where d(t) =  t(T(t) - T out (t)) Q(t) = T(t)/C, (  = 1/C)  T(t) = T(t-1) +  tq(t-1) -  t  T(t-1) - T out (t-1)) Units: [Q] = kWh, [  ] = kW/  C, [C] = kWh/  C T Q T out q d

5 S ystems Analysis Laboratory Helsinki University of Technology Example houses House 1 House 2

6 S ystems Analysis Laboratory Helsinki University of Technology Information summary Q d T ref  q  q max T out p T min  T  T max 

7 S ystems Analysis Laboratory Helsinki University of Technology Goal models 1. Hard constraint (pipe is hard) 3. Hard constraint with a goal inside (pipe with a goal) 2. Soft constraints (pipe is soft) “Interval goal programming”

8 S ystems Analysis Laboratory Helsinki University of Technology Hard constraints

9 S ystems Analysis Laboratory Helsinki University of Technology Soft constraints

10 S ystems Analysis Laboratory Helsinki University of Technology Hard constraints with a goal

11 S ystems Analysis Laboratory Helsinki University of Technology Goal models (summary) 3. Hard constraints with a goal 1. Hard constraints 2. Soft constraints

12 S ystems Analysis Laboratory Helsinki University of Technology MultiObjective Household heating Optimization (MOHO)

13 S ystems Analysis Laboratory Helsinki University of Technology Idea of MOHO Minimize heating costs using hard lower and upper bounds for indoor temperature –The case of hard constraints Ask: “How many percents would you like to decrease the heating costs from the current level?” Solve again trying to achieve the desired decrease in cost by relaxing the indoor temperature upper bound –The  -constraints method (upper bound must be active in order to succeed)

14 S ystems Analysis Laboratory Helsinki University of Technology Example: House 2 (1/4) Minimized heating costs:

15 S ystems Analysis Laboratory Helsinki University of Technology Example: House 2 (2/4) Decreased costs by 5 %

16 S ystems Analysis Laboratory Helsinki University of Technology Example: House 2 (3/4) Decreased again by 5 %

17 S ystems Analysis Laboratory Helsinki University of Technology Example: House 2 (4/4) And again by 5 %

18 S ystems Analysis Laboratory Helsinki University of Technology Summary Model and parameters of the house identified Depending on the definition of the “living comfort” different multicriteria models can be used Benefits of the simplified approach: –Only bounds of the indoor temperature asked –Comparison and tradeoff only with heating costs