A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.11.

Slides:



Advertisements
Similar presentations
The Production Possibilities Frontier
Advertisements

Traveling Salesperson Problem
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.10.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.24.
Introduction to multi-objective optimization We often have more than one objective This means that design points are no longer arranged in strict hierarchy.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.13.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.3.
Multi-objective optimization multi-criteria decision-making.
CS112: Course Overview George Mason University. Today’s topics Go over the syllabus Go over resources – Marmoset – Blackboard – Piazza – Textbook Highlight.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.16.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.2.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.27.
Multi-objective Approach to Portfolio Optimization 童培俊 张帆.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.16.
Multiobjective Optimization Chapter 7 Luke, Essentials of Metaheuristics, 2011 Byung-Hyun Ha R1.
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Pareto Multiobjective Optimization Patrick N. Ngatchou, Anahita Zarei, Warren.
Prénom Nom Document Analysis: Linear Discrimination Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Bicycle Energy Measurement System
Objectives: The students will be able to:
Section 6.4 Another Application of Integration. Definition: Work Work generally refers to the amount of effort required to perform a task.
Tier I: Mathematical Methods of Optimization
Add to syllabus chat…teaching how to think, not memorize. Regardless of whether it’s a physics course, employers will want some who can think and process.
Units of Measurement Section 2.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.8.
Water Resources Development and Management Optimization (Linear Programming) CVEN 5393 Feb 25, 2013.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.28.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.15.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.31.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.4.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.21.
WORD SPLASH Isaac Newton Motion Frame of reference speed velocity
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.15.
1 BIEN425 – Lecture 11 By the end of the lecture, you should be able to: –Design and implement FIR filters using frequency-sampling method –Compare the.
Regents Strategies: ELIMINATION Ruling out answers that we know are incorrect.
Introduction to multi-objective optimization We often have more than one objective This means that design points are no longer arranged in strict hierarchy.
OPPORTUNITY COSTS This section is all about how we make our decisions. All decisions involve a trade- offs. –Trade offs are all the alternatives we give.
New approaches to Materials Education - a course authored by Mike Ashby and David Cebon, Cambridge, UK, 2007 © MFA and DC 2007 UNIT 6. Objectives in conflict:
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.12.
1 Mutli-Attribute Decision Making Scott Matthews Courses: / /
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.19.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.14.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.8.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.32.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.30.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.25.
Unit 1: Foundations of Economics What is Economics? “A science that deals with the allocation, or use, of scarce resources for the purpose of fulfilling.
Motion Notes. Measurement A measurement is a quantity with a unit that tells what time the quantity means. For example: –3 seconds is a measurement of.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.12.
Fill a number from 1-9 only once so that the three numbers are identical _ + _ - _ = _ + _ - _ = _ + _ - _ Where should 1, 2, 3, 4, 5, 6, 7, 8, 9 be placed?
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.10.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.9.
Evolutionary Computing Chapter 12. / 26 Chapter 12: Multiobjective Evolutionary Algorithms Multiobjective optimisation problems (MOP) -Pareto optimality.
Oneone SK-19 Objective: To calculate the total amount of energy of a falling object in order to determine when the amount of energy is the greatest. Core.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.2.
#13 Speed and Momentum. Speed Depends on Distance and Time speed – the rate at which an object moves speed depends on the distance traveled and the time.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 S.29.
Notes 16 ECE Microwave Engineering Fall 2015 Impedance Matching Prof. David R. Jackson Dept. of ECE 1.
Assessing Student Thinking. I.Why assess student thinking?
Chapter 6. When objects collide their motion changes and this is the result of a concept called momentum. Momentum = mass x velocity p = mv kgm/s or Ns.
A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.4.
The Production Possibilities Frontier
Assignment I TSP with Simulated Annealing
The AP Language Exam Multiple Choice
Heuristic Optimization Methods Pareto Multiobjective Optimization
A core Course on Modeling
The AP Language Exam Multiple Choice
Newton’s Second Law “ Forces do not cause motion. Forces cause accelerations”
A core Course on Modeling
The Production Possibilities Frontier
Multiobjective Optimization
Presentation transcript:

A core Course on Modeling Introduction to Modeling 0LAB0 0LBB0 0LCB0 0LDB0 P.11

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. The bicycle trip 2: minimize W, minimize t, vary s and v. Model 1: trade-off between W and s Model 2: no trade-off between W and t Implement trade-off in Model 1 in two ways: a.Lumping b.Pareto-genetic

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. a.Lumping: q= w w *W+w s *s -1 Arbitrary values for w w and w s : w w =1 m -1, w s =1 kg m 2 /s 2 w w =1000m -1, w s =1 kg m 2 /s 2 w w =1 m -1, w s =1000kg m 2 /s 2  low effort is more important  long distance is more important

W=fW*s; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,0.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s s=vMPS*tSec; m tH=slider(1.0,0.0,5.0); h tSec=tH*secPH; s rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km wW=1;1/m wS=1;kg.m2/s2 q=wW*W+wS/s qMin1=paretoMin(paretoHor(q)) qMin2=paretoMin(paretoVer(q)) Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. a.Lumping: qMin1 qMin2 = qMin1

W=fW*s; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,0.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s s=vMPS*tSec; m tH=slider(1.0,0.0,5.0); h tSec=tH*secPH; s rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km wW=1;1/m wS=1;kg.m2/s2 q=wW*W+wS/s qMin1=paretoMin(paretoHor(q)) qMin2=paretoMin(paretoVer(q)) Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. a.Lumping: qMin1 qMin2 = qMin1

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. a.Lumping: qMin1 qMin2 = qMin1 In case of lumping we combine the criteria low W and large s with arbitrarily chosen weight factors w w and w s. There is 1 non-dominated point with some v and t. With another choice for w w and w s, another v and t would have resulted.

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. a.Lumping:

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. b. Pareto-genetic: Deal with both criteria (minimize W and maximize s) separately

W=fW*s; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,1.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s s=vMPS*tSec; m tH=slider(1.0,0.0,5.0); h tSec=tH*secPH; s rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km WMin=paretoMin(paretoHor(W)) sMax=paretoMax(paretoVer(s)) Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. b. Pareto-genetic: WMin sMax

W=fW*s; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,1.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s s=vMPS*tSec; m tH=slider(1.0,0.0,5.0); h tSec=tH*secPH; s rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km WMin=paretoMin(paretoHor(W)) sMax=paretoMax(paretoVer(s)) Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. b. Pareto-genetic: WMin sMax

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. b. Pareto-genetic: WMin sMax In case of NO lumping we keep the criteria low W and large s separate; no weight factors required. There are multiple non-dominated points (the red dots), each with their v and t. Each of these points could be a reasonable choice – in the sense that no better (=dominating) choices exist.

Applying SPEA: the bicycle trip The bicycle trip 1: minimize W, maximize s, vary v and t. b. Pareto-genetic:

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s. b. Pareto-genetic: There is no actual trade-off. We therefore don’t expect multiple non-dominated solutions.

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s. b. Pareto-Genetic: W=fW*sM; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,0.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s sKM=slider(5.0,0.0,120.0); km sM=sKM*mPKM; m tSec=sM/vMPS; s tH=tSec/secPH; h rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km WMin=paretoMin(paretoHor(W)); kg.m2/s2 tMin=paretoMin(paretoVer(tH)); h WMin tMin

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s. b. Pareto-Genetic: W=fW*sM; kg.m2/s2 fW=c*rho*A*vMPS*vMPS; kg.m/s2 vKMPH=slider(15.0,0.0,40.0); km/h vMPS=vKMPH*mPKM/secPH; m/s sKM=slider(5.0,0.0,120.0); km sM=sKM*mPKM; m tSec=sM/vMPS; s tH=tSec/secPH; h rho=1; kg/m3 A=0.6; m2 c=0.5 secPH=3600; s/h mPKM=1000; m/km WMin=paretoMin(paretoHor(W)); kg.m2/s2 tMin=paretoMin(paretoVer(tH)); h WMin tMin

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s. b. Pareto-Genetic: WMin tMin In case there is no trade off, the Pareto front collapses into a single non-dominated point: v=0 and s=0

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s. b. Pareto-Genetic:

Applying SPEA: the bicycle trip The bicycle trip 2: minimize W, minimize t, vary v and s; The bicycle trip 1: minimize W, maximize s, vary v and t: one modeled system two (or more) models some with trade-offs, others without trade-offs choose whether you use lumping or Pareto-genetic Always ask: which strategy is adequate for current purpose?