Multiobjective Optimization (I) : Multidisciplinary System Design Optimization (MSDO)
Multiobjective Optimization (I) : Multidisciplinary System Design Optimization (MSDO)
Where in Framework ?
Objective Vector
x1
x2
Discipline A
Discipline B
Discipline C
xn
Coupling
Jz
Multiobjective
Optimization
Approximation
Methods
Optimization Algorithms
Tradespace
Exploration
(DOE)
2
Numerical Techniques
(direct and penalty methods)
Heuristic Techniques
(SA,GA, Tabu Search)
J1
J2
Sensitivity
Analysis
Coupling
Isoperformance
Lecture Content
min J x, p
where J
s.t. g(x, p) 0
h(x, p)=0
xi , LB
xi
xi ,UB (i
x
g
1, ..., n )
h
4
J1 x
x1
g1 ( x )
h1 (x )
Jz x
xi
g m1 ( x )
hm2 (x )
xn
T
Multiple Objectives
The objective can be a vector J of z system responses
or characteristics we are trying to maximize or minimize
J1
J2
J3
cost [$]
- range [km]
weight [kg]
Ji
Jz
5
- ROI [%]
J(x)
Design
Decisions
Aspect Ratio
Dihedral Angle
Vertical Tail Area
Engine Thrust
Skin Thickness
# of Engines
Fuselage Splices
Suspension Points
Location of Mission
Computer
Access Door
Locations
Objectives
Example:
F/A-18 Aircraft
Speed
Range
Payload Capability
Radar Cross Section
Stall Speed
Stowed Volume
Acquisition cost
Cost/Flight hour
MTBF
Engine swap time
Assembly hours
Avionics growth
Potential
Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox
Engineering Systems Division and Dept. of Aeronautics and Astronautics
Multiobjective Examples
Design
Optimization
Operations
Research
Aircraft Design
max {range}
max {passenger volume}
max {payload mass}
min {specific fuel consumption}
max {cruise speed}
min {lifecycle cost}
Production Planning
max {total net revenue}
max {min net revenue in any time period}
min {backorders}
min {overtime}
min {finished goods inventory}
Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox
Engineering Systems Division and Dept. of Aeronautics and Astronautics
J1
J2
Jz
Multiobjective Optimization
single objective
l
Minimize displacement
s.t. mass and loading constraint
multiple obj.
single discipline
10
vo
multiple disciplines
support bracket
F
Minimize stamping
multiple disciplines
airfoil V
fuel
(x,y)
vo
commercial aircraft
Minimize SFC and maximize cruise
speed s.t. fixed range and payload
J1
11
3e
x12 ( x2 1)2
3 1 x1 e
x
10 1
5
3
1
( x1 2)2 x22
(demo)
J2
5
2
x12 x22
10
3 1 x2
x2
5
x23
e x2
( x1 1) 2
x15 e x2
x12
3e
0.5 2 x
(2 x2 )2 x12
x1*
=
0.0532
1.5973
J1* = 8.9280
J1(x2*)= -6.4858
J2(x1*)= -4.8202
J2* = 8.1118
Result:
Xtot* =
0.8731
0.5664
tradeoff
solution
max(J1+J2)
Jtot* = 6.1439
J(xtot*)
=
3.0173 J1
=
3.1267 J2
13
max(J2)
14
While working in Florence as a Civil Engineer from 18701893, Pareto takes up the study of philosophy and politics
and is one of the first to analyze economic problems
with mathematical tools.
In 1893, Pareto becomes the Chair of Political Economy at
the University of Lausanne in Switzerland, where he
creates his two most famous theories:
Circulation of the Elites
The Pareto Optimum
15
max J
f x
s.t. x S
f x
S
J objective function
feasible region
17
Range
J(xtot*)
Xtot*
, Jz
s.t. J i
1 i
x S
19
fi x
Pareto
Approaches
J i1
z
J i2
and J i1
i
J i2 for
at least one i
Preferences
Preferences
includedupfront
included a posteriori
Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox
Engineering Systems Division and Dept. of Aeronautics and Astronautics
S
x1*
x2
c1
max J1
cx
max J 2
c2 x
s.t.
constraints
x S
c2
x2*
Optimal solution
if only J2 considered
x1
20
Weighted-Sum Approach
Each objective i is multiplied by a strictly positive scalar
Rz
x2
k
i
0,
i 1
x1
S
c3
c1
x3*
1
2
c
+
c
1
2
c3
constraints
21
criterion
cone
Solve the
composite or
WSLP:
max TCx x S
c2
x2
x1
Strictly convex
combination
of objectives
Objective Vector:
J1: Turning Radius [m]
J2: Acceleration [0-60mph]
J3: Cargo Space [m3]
J4: Fuel Efficiency [mpg]
J5: Styling [Rating 0-10]
J6: Range [km]
J7: Crash Rating [poor-excellent]
J8: Passenger Space [m3]
J9: Mean Time to Failure [km]
Assignment: Determine
, i =19
9
i
1000
i 1
22
J1=range [sm]
J2=fuel efficiency [mpg]
sf1=573.5 [sm]
sf2=36 [mpg]
Suzuki Swift
23
J1
J 2 where
[0,1]
=0.05
Demo:
24
=0
Weighted sum
finds interesting,
solutions but misses
many solutions of
interest.
=1
25
Min(J2 /sf2)
J MO
miss this
concave region
i 1
J*i+1
sfi
Ji
1> 2
scale
factor
S and for x
J x
(maximization)
x*
J1 , J 2
Rz
J1
More
precisely:
J 2 and J1
Ji
J2
Jz
J i1
J i2
and J i1
J1
J2
J i1
J i2
Set Theory
J
J*
D
Set Theory:
x S
J, J* Z
ND
Z , ND
ND Z
ND
J* x *
29
ND
30
Dominance - Exercise
max{range}
min{cost}
max{passengers}
max{speed}
#1
#2
7587
321
112
950
6695
211
345
820
[km]
[$/km]
[-]
[km/h]
#3
#4
Multiobjective
Aircraft Design
#5
#6
#7
6777 5812
355 401
90
185
901 788
#8
7432
208
208
790
Dominance - Exercise
Algorithm for extracting non-dominated solutions:
Pairwise comparison
#1
7587
321
112
950
>
>
<
>
#2
Score
#1
Score
#2
#1
6695
211
345
820
1
0
0
1
0
1
1
0
7587
321
112
950
2
Neither #1 nor #2
dominate each other
vs
>
<
>
>
#6
Score
#1
Score
#6
6777
355
90
901
1
1
1
1
0
0
0
0
vs
Solution #1 dominates
solution #6
Domination Matrix
Shows which solution dominates which other
solution (horizontal rows) and (vertical columns)
Row
1
2
3
4
Solution 2 dominates
Solution 5
5
6
7
Column
0 0 0 0 1 1 2 0
1
2
0
0
0
0
0
1
j-th row
indicates
how many
solutions
j-th solution
dominates
Solution 7 is dominated
by Solutions 2 and 8
Filtered the
Full Factorial
Set: 3721
Non-dominated
set approximates
Pareto frontier:
79 points (2.1%)
34
10
Iridium actual
Iridium simulated
Globalstar actual
10
10
Global
35
Pareto
Front
Globalstar simulated
10
10
10
10
Pareto-Optimal vs ND
min(J2)
True
Pareto
Front
Obtain
different
points for
different weights
Approximated
Pareto Front
D
ND
max (J1)
All pareto optimal points are non-dominated
Not all non-dominated points are pareto-optimal
Its easier to show dominatedness than non-dominatedness !!!
36
PO
Lecture Summary
A multiobjective problem has more than one optimal solution
All points on Pareto Front are non-dominated
Methods:
Weighted Sum Approach (Caution: Scaling !)
Pareto-Filter Approach
Methods for direct Pareto Frontier calculation next time:
AWS (Adaptive Weighted Sum)
NBI (Normal Boundary Intersection)
Remember .
Pareto Optimal means ..
38
MIT OpenCourseWare
http://ocw.mit.edu
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.