SlideShare a Scribd company logo
1 of 38
Download to read offline
Optimization Methods
in Engineering Design
Day-7
Course Materials
• Arora, Introduction to Optimum Design, 3e, Elsevier,
(https://www.researchgate.net/publication/273120102_Introductio
n_to_Optimum_design)
• Parkinson, Optimization Methods for Engineering Design, Brigham
Young University
(http://apmonitor.com/me575/index.php/Main/BookChapters)
• Iqbal, Fundamental Engineering Optimization Methods, BookBoon
(https://bookboon.com/en/fundamental-engineering-optimization-
methods-ebook)
MATLAB Global Optimization Toolbox
• Solvers
– Genetic algorithm
– Simulated annealing
– Pattern search
– Particle swarm optimization
Robust Design
• Real-world designs are subject to variations
• Variation may arise from manufacturing processes, material
properties, changing operating conditions, etc.
• Variation lead to poor performance, product failure, and customer
dissatisfaction.
• In optimal design problems, variations invariably reduce the feasible
region. Since optimal designs are normally defined by binding
constraints, variation may cause optimal designs to become
infeasible.
• A robust design is a design that can withstand variation.
• Feasibility robustness means the constraints will remain feasible
when subjected to variation.
Tolerance Box Approach
• Consider the design optimization problem:
min
𝒙
𝑓 𝒙 , subject to 𝑔𝑖 𝒙 ≤ 𝑏𝑖, 𝑖 = 1, … , 𝑚
• Using worst case tolerances in design variables, we may define a
tolerance box, where a robust design will have the entire box in the
feasible region
Transmitted Variation Approach
• Consider the design optimization problem:
min
𝒙
𝑓 𝒙, 𝒑 , subject to 𝑔𝑖 𝒙, 𝒑 ≤ 𝑏𝑖, 𝑖 = 1, … , 𝑚
where 𝒙 is a vector of design variables, and 𝒑 is a parameter vector
• Let Δ𝒙, Δ𝒑, Δ𝒃 denote the variation in 𝒙, 𝒑, 𝑎𝑛𝑑 𝒃 about nominal
values; then variation in the constraint functions is computed as:
Δ𝑔𝑖 =
𝜕𝑔𝑖
𝜕𝑥𝑗
Δ𝑥𝑗
𝑛
𝑗=1 +
𝜕𝑔𝑖
𝜕𝑝𝑗
Δ𝑝𝑗
𝑚
𝑗=1
• The total variation is given as: Δ𝑖 = Δ𝑔𝑖 + Δ𝑏𝑖
• A robust design solves the following optimization problem:
min
𝒙
𝑓 𝒙, 𝒑 , subject to 𝑔𝑖 𝒙, 𝒑 ≤ 𝑏𝑖 − Δ𝑖, 𝑖 = 1, … , 𝑚
i.e., the feasible region is reduced by the total variation in constraints
Transmitted Variation Approach
• Assuming the robust optimum is close to the nominal optimum, it
may be solved as:
– Compute the nominal optimum point
– Reduce the rhs by the transmitted variation
– Re-compute the optimum
Design Example: Symmetric Two-Bar Truss
Problem: design a symmetrical two-bar truss of minimum mass to
support a fixed load 𝑃. The truss has height 𝐻, and span 𝐵.
Design variables: diameter 𝑑 , thickness (𝑡), height 𝐻
𝑙 = (𝐵/2)2+𝐻2, 𝐴 = 𝜋𝑑𝑡
Total weight: 𝑊 = 2𝜌𝑙𝐴,
Constraints:
Axial stress: 𝜎 =
𝑃𝑙
2𝜋𝑑𝑡𝐻
≤ 𝜎𝑎
Buckling stress: 𝜎𝑏 =
𝜋2 𝑑2+𝑡2 𝐸
8𝑙2 ≤ 𝜎𝑎
Deflection: 𝜀 =
𝑃𝑙3
2𝜋𝑑𝑡𝐻2𝐸
≤ 𝜀𝑚𝑎𝑥
Design Example: Symmetric Two-Bar Truss
The design optimization problem is defined as:
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to:
𝜎𝑏
𝜎
− 1 ≤ 0,
𝜎
𝜎𝑎
− 1 ≤ 0,
𝜀
𝜀𝑚𝑎𝑥
− 1 ≤ 0,
For a particular problem, let:
𝑃 = 66 𝑘𝑖𝑝𝑠; 𝐵 = 60 𝑖𝑛; 𝑡 = 0.15; 𝜌 = 0.3
𝑙𝑏
𝑖𝑛3
; 𝐸 = 30 × 106
𝑙𝑏
𝑖𝑛2
;
𝜎𝑎 = 1 × 105 𝑝𝑠𝑖; 𝜀𝑚𝑎𝑥 = 0.25 𝑖𝑛
The optimum design, obtained via SA, is given as:
𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.8801 lbs
The stress and elongation at the optimum point are:
𝜎 = 99.96 𝑘𝑖𝑝𝑠, 𝜎𝑏 = 71.74 𝑘𝑖𝑝𝑠, 𝜀 = 0.2 𝑖𝑛
Design Example: Symmetric Two-bar Truss
• Consider the following variations in design parameters
Load: Δ𝑃 = 2 𝑘𝑖𝑝𝑠
Span: Δ𝐵 = 1.0 𝑖𝑛
• The transmitted variations to the constraints are computed as:
Δ𝜎 =
𝜕𝜎
𝜕𝑃
Δ𝑃 +
𝜕𝜎
𝜕𝑙
𝜕𝑙
𝜕𝐵
Δ𝐵
Δ𝜎𝑏
=
𝜕𝜎𝑏
𝜕𝑃
Δ𝑃 +
𝜕𝜎𝑏
𝜕𝑙
𝜕𝑙
𝜕𝐵
Δ𝐵
Δ𝜀 =
𝜕𝜀
𝜕𝑃
Δ𝑃 +
𝜕𝜀
𝜕𝑙
𝜕𝑙
𝜕𝐵
Δ𝐵
Then Δ𝜎 = 3.865 𝑘𝑖𝑝𝑠; Δ𝜎𝑏
= −1.196 𝑘𝑖𝑝𝑠; Δ𝜀 = 0.011 𝑖𝑛
Design Example: Symmetric Two-bar Truss
• The robust design optimization problem is defined as:
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to: 𝜎 + Δ𝜎 − 𝜎𝑎 ≤ 0,
𝜎𝑏 + Δ𝜎 + Δ𝜎𝑏 − 𝜎 ≤ 0,
𝜀 + Δ𝜀 − 𝜀𝑚𝑎𝑥 ≤ 0,
• The robust optimum design obtained via SA is given as:
𝐻 =30.537 in, 𝑑 =1.931 in, 𝑡 =0.0792 in; 𝑓 =12.34 lbs
Compare with nominal optimum design:
𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.88 lbs
Design Example: Symmetric Two-bar Truss
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to:
𝜎𝑏
𝜎
− 1 ≤ 0,
𝜎
𝜎𝑎
− 1 ≤ 0,
𝜀
𝜀𝑚𝑎𝑥
− 1 ≤ 0,
• Parameter variations
Load: Δ𝑃 = 2 𝑘𝑖𝑝𝑠
Span: Δ𝐵 = 1.0 𝑖𝑛
• Optimum design
𝐻 =27.5703 in
𝐷 =2.0112 in
𝑇 =0.0800 in
𝑊 =12.357 lbs
Design Example: Symmetric Two-bar Truss
• MATLAB code
% (Ref: Parkinson, Optimization Methods for Engineering Design)
% Transmitted variation
P=66e3; %load [lbs]
t=0.08; %thickness [in]
rho=0.3; %density [lb/in2]
E=30e6; %elastic modulus [lb/in2]
Smax=1e5; %allowable stress [lb/in2]
Emax=.25; %allowable deflection [in]
d=1.1:.1:3;
h=11:30;
[H,D]=meshgrid(h,d);
A=pi*D.*t;
L=sqrt(H.^2+(b/2)^2);
W=2*rho*A.*L;
S=P*L./(2*H.*A);
SB=pi^2*E*(D.^2+t.^2)./(8*L.^2);
Eps=P*L.^3./(2*E*H.^2.*A);
Design Example: Symmetric Two-bar Truss
db=1; %variation (width)
dP=2e3; %variation (load)
dS= (abs(dP/P)+abs(b^2./L.^2/4*db/b)).*S;
dSb= abs(-b^2./L.^2/2*db/b).*SB;
dEps= (abs(dP/P)+abs(3*b^2./L.^2/4*db/b)).*Eps;
C1=S/Smax-1;
C2=SB./S-1;
C3=Eps/Emax-1;
C4=(S+dS)/Smax-1;
C5=(SB+dS+dSb)./S-1;
C6=(Eps+dEps)/Emax-1;
figure, hold
xlabel('H'), ylabel('D')
contour(h,d,C1,[0 0]),
contour(h,d,C2,[0 0]),
contour(h,d,C3,[0 0]),
contour(h,d,C4,[0 0],'Color','red'),
contour(h,d,C5,[0 0],'Color','red'),
contour(h,d,C6,[0 0],'Color','red'),
contour(h,d,W,'ShowText','on');
Statistical Variation
• Assume that design variables and parameters are independent
random variables, normally distributed about the mean, i.e.,
𝑋𝑖~𝑁(𝜇𝑖, 𝜎𝑖)
• Then the transmitted variation is computed as:
𝜎𝑔𝑖
2
=
𝜕𝑔𝑖
𝜕𝑥𝑗
𝜎𝑥𝑗
2
𝑛
𝑗=1 +
𝜕𝑔𝑖
𝜕𝑝𝑗
𝜎𝑝𝑗
𝑚
𝑗=1
2
• The total constraint variance (including rhs variability) is:
𝜎𝑖
2
= 𝜎𝑔𝑖
2
+ 𝜎𝑏𝑖
2
• For robust design, constraints are modified as:
𝑔𝑖 ≤ 𝑏𝑖 − 𝑘𝜎𝑖
2
where a value of 𝑘 = 3 results in 99.865% feasibility
Design Example: Symmetrical Three-bar Truss
• Consider the optimum design problem for three-bar truss
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to:
𝜎𝑏
𝜎
− 1 ≤ 0,
𝜎
𝜎𝑎
− 1 ≤ 0,
𝜀
𝜀𝑚𝑎𝑥
− 1 ≤ 0,
• The nominal design is given as:
𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.88 lbs
• Assume the following distribution for load 𝑃 and span 𝐵
𝑃~𝑁 66,0.667 𝑘𝑖𝑝𝑠, 𝐵~𝑁 60,0.333 𝑖𝑛
Design Example: Symmetrical Three-bar Truss
• The robust design optimization problem is defined as:
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to: 𝜎 + 3𝜎𝑆 − 𝜎𝑎 ≤ 0,
𝜎𝑏 + 3𝜎𝑆𝑏
− 𝜎 ≤ 0,
𝜀 + 3𝜎𝜀 − 𝜀𝑚𝑎𝑥 ≤ 0,
where the transmitted variances are computed as:
𝜎𝑆
2
=
𝜕𝜎
𝜕𝑃
𝜎𝑃
2
+
𝜕𝜎
𝜕𝑙
𝜕𝑙
𝜕𝐵
𝜎𝐵
2
𝜎𝑆𝑏
2
=
𝜕𝜎𝑏
𝜕𝑃
𝜎𝑃
2
+
𝜕𝜎𝑏
𝜕𝑙
𝜕𝑙
𝜕𝐵
𝜎𝐵
2
𝜎𝜀
2 =
𝜕𝜀
𝜕𝑃
𝜎𝑃
2
+
𝜕𝜀
𝜕𝑙
𝜕𝑙
𝜕𝐵
𝜎𝐵
2
Then 𝜎𝑆 = 1.048 𝑘𝑖𝑝𝑠; 𝜎𝑆𝑏
= −0.399 𝑘𝑖𝑝𝑠; 𝜎𝜀 = 0.003 𝑖𝑛
Design Example: Symmetric Two-bar Truss
Objective: min
d,H
2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2
Subject to:
𝜎𝑏
𝜎
− 1 ≤ 0,
𝜎
𝜎𝑎
− 1 ≤ 0,
𝜀
𝜀𝑚𝑎𝑥
− 1 ≤ 0,
• Parameter variations
Load:
𝑃~𝑁 66,0.667 𝑘𝑖𝑝𝑠
Span:
𝐵~𝑁 60,0.333 𝑖𝑛
• Optimum design
𝐻 =26.6509 in
𝐷 =2.0389 in
𝑇 =0.0800 in
𝑊 =12.338 lbs
Design Example: Symmetric Two-bar Truss
• A comparison of robust design methods
• Notes
– These results were obtained via simulated annealing
– Worst case design using transmitted variation is quite conservative
– The statistical variation design is less conservative, however
guarantees 99.865% feasibility
Parameter Nominal
design
Transmitted
variation
Statistical
variation
H (in) 29.9 30.54 29.68
D (in) 1.86 1.93 1.93
T (in) 0.08 0.079 0.08
W (lbs) 11.88 12.34 12.25
Multi-Objective Optimization
• Practical optimization problems possess multiple objectives:
– For example, we want to minimize production and maintenance
costs, maximize safety, aesthetic appeal, space usage, etc.
– Suppose we desire to minimize weight as well as deflection at a
particular location. These two objectives are competing.
Multi-Objective Optimization
• A multi-objective optimization problem is defined in terms of a
vector of objectives 𝐹(𝑥) that is the subject to inequality and/or
equality constraints and/or bounds on design variables.
Objectives: 𝐹 𝑥 = 𝐹1 𝑥 , 𝐹2 𝑥 , … , 𝐹𝑀 𝑥
Subject to: 𝐺𝑖 𝑥 ≤ 0, 𝑖 = 1, … , 𝑘; 𝐺𝑖 𝑥 = 0, 𝑖 = 𝑘 + 1, … , 𝑚;
𝑥𝑗
𝐿
≤ 𝑥𝑗 < 𝑥𝑗
𝑈
, 𝑗 = 1, … , 𝑛.
• As there is no unique solution, the concept of Pareto optimality is
used to characterize the objectives.
At the optimal point an improvement in one of the objectives is
accompanied by an equivalent degradation in another.
Multi-Objective Optimization
• A general goal in multi-objective optimization is construction of
Pareto optima, i.e., a series of non-dominated solutions.
Multi-Objective Optimization Methods
• Weighted sum and weighted metric approaches
• Multi-objective linear programming
• Multi-objective combinatorial optimization
• Goal programming approaches (minimize deviation from goal)
• Evolutionary algorithms (EA are naturally suited to MOOPs)
– Multi-objective genetic algorithm
– Multi-objective ant colony optimization
– Multi-objective particle swarm optimization
• Archived simulated annealing
– Non-dominated solutions found during SA are archived
• Game theoretic approaches (multi-player competing games)
Design Example: Symmetric Two-Bar Truss
Problem: design a symmetrical two-bar truss of minimum mass to
support a fixed load 𝑃. The truss has height 𝐻, and span 𝐵.
Design variables: diameter 𝑑 , height 𝐻
Total weight: 𝑊 = 2𝜌𝑙𝐴, where 𝑙 = (𝐵/2)2+𝐻2, 𝐴 = 𝜋𝑑𝑡
Dual Objective: Minimize weight and end deflection
Constraints:
Axial stress: 𝜎 =
𝑃𝑙
2𝜋𝑑𝑡𝐻
≤ 𝜎𝑎
Buckling stress: 𝜎𝑏 =
𝜋2 𝑑2+𝑡2 𝐸
8𝑙2 ≤ 𝜎𝑎
Deflection: 𝜀 =
𝑃𝑙3
2𝜋𝑑𝑡𝐻2𝐸
≤ 𝜀𝑚𝑎𝑥
MOOP Example: Two-bar Truss
%Symmetric two-bar truss
%variables: diameter(d), height(h); x=[d,h]
t=.15; %thickness
b=60; %span [in]
P=66e3; %load [lbs]
E=30e6; %elastic modulus [lb/in2]
rho=0.3; %density [lb/in3]
Smax=100e3; %maximum stress [lb/in2]
l=@(x) sqrt((b/2)^2+x(2)^2); %length [in]
W=@(x) 2*pi*x(1)*t*l(x)*rho; %weight [lbs]
Sa=@(x) P*l(x)/(2*pi*x(1)*t*x(2)); %stress [lb/in2]
Sb=@(x) pi^2*E*(x(1)^2+t^2)/(8*l(x)^2); %buckling [lb/in2]
del=@(x) P*l(x)^3/(2*pi*x(1)*t*x(2)^2*E); %deflection [in]
f=@(x) [W(x)/30;del(x)]; %dual objective
g=@(x) [Sa(x)/Smax-1; Sb(x)/Sa(x)-1]; %constraints
MOOP Example: Two-bar Truss
• Define problem structure in MATLAB
Opt = struct with fields:
solver: 'gamultiobj'
fitnessfcn: @(x)[W(x)/30;del(x)]
nvars: 2
x0: [1 0.1500]
Aineq: []
bineq: []
lb: [0.5000 10]
ub: [2.5000 40]
options: [1×1 optim.options.GamultiobjOptions]
objective: []
nonlcon: @(x)deal(g(x),[])
>> [x,fval]=gamultiobj(Opt)
Optimization terminated: average change in the spread of Pareto solutions less
than options.FunctionTolerance.
MOOP Example: Two-bar Truss
x =
1.7930 39.1909
0.9656 31.6035
1.0951 33.1630
1.7930 39.1909
1.3503 32.1439
1.7298 38.5558
1.3875 35.1076
1.6268 32.7486
0.9656 31.6035
1.3039 31.4507
1.2092 32.1774
1.7254 35.7853
1.5912 25.2049
1.3275 35.2242
0.9914 32.8852
1.0816 31.8717
1.0283 33.4329
1.6686 34.2041
MOOP Example: CNC Lathe Cutting Process
• Problem: Find the Pareto front for CNC lathed cutting, where the
objectives are: 1) minimize process time; 2) maximize tool life
Design variables: cutting speed 𝑣
𝑚
𝑚𝑖𝑛
, feed 𝑓
𝑚𝑚
𝑟𝑒𝑣
, depth 𝑎 [𝑚𝑚]
Process time is given as: 𝜏 = 𝜏𝑠 +
𝑉
𝑀
1 +
𝜏𝑇𝐶
𝑇
+ 𝜏0
where 𝜏𝑠 is setup time, 𝑉 is material removed, 𝑀 is removal rate, 𝑇 is
tool life, and 𝜏0 is inactive time
Material removal rate is: 𝑀 = 1000𝑣𝑓𝑎
Used tool life is: 𝜉 =
𝑉
𝑀𝑇
× 100%
• Empirical models for tool life and cutting force are obtained as:
𝑇 =
5.48×109
𝑣3.46𝑓0.696𝑎0.46 ; 𝐹𝑐 = 6.56 × 103 𝑓0.917𝑎1.1
𝑣0.286
MOOP Example: CNC Lathe Cutting Process
• The multi-objective optimization problem is formulated as:
Objective 𝐹1: min
𝑣,𝑓,𝑎
𝜏
Objective 𝐹2: max
𝑣,𝑓,𝑎
𝜉
Subject to: 𝑔1:
100𝑃
𝜂𝑃𝑚𝑜𝑡
− 1 ≤ 0
𝑔2:
𝐹𝑐
𝐹𝑐𝑚𝑎𝑥
− 1 ≤ 0
𝑔3:
𝑅
𝑅𝑚𝑎𝑥
− 1 ≤ 0
where 𝑅 =
125𝑓2
𝑟𝐸
, 𝑃 =
𝐹𝑐𝑣
60,000
, 𝑃𝑚𝑜𝑡 is motor power, 𝜂 is efficiency
Let 𝑃𝑚𝑜𝑡 = 10𝑘𝑊, 𝜂 = 0.75, 𝑟𝐸 = 0.8 𝑚𝑚, 𝑅𝑚𝑎𝑥 = 50𝜇𝑚, 𝐹𝑐𝑚𝑎𝑥
= 5𝑘𝑁
Let 200 ≤ 𝑣 ≤ 400, 0.15 ≤ 𝑓 ≤ 0.55, 1.5 ≤ 𝑎 ≤ 6
MOOP Example: CNC Lathe Cutting Process
%cnc lathe cutting example (Ref: Deb, Optimization for Engineering Design)
%objectives: 1. minimize operation time; 2. max tool life
%variables: cutting speed(v), feed(f), depth of cut(a)
xl=[200,.15,2]; xu=[400,.55,6]; %variable bounds
x0=(xl+xu)/2; %trial design [v,f,a]
Pmax=10e3; %[W]
Fcmax=5000; %[N] max force
Rmax=50; %[mu-m] roughness
rn=0.8; %[mm] tool radius
eta=.75; %efficiency
V=219912; %[mm3] material removed
ts=.15; %[min] setup time
tc=.20; %[min] tool change time
ti=.05; %[min] inactive time
T=@(x) 5.48e9/prod(x.^[3.46,.696,.46]); %tool life
Fc=@(x) 6560*prod(x.^[-.286,.917,1.1]); %cutting force
P=@(x) Fc(x)*x(1)/60e3; %power used
M=@(x) 1000*prod(x); %material removal rate
Tp=@(x) ts+ti+V*(1+tc/T(x))/M(x); %process time
TL=@(x) 100*V/(M(x)*T(x)); %used tool life
R=@(x) 125*x(2)^2/rn; %surface roughness
fmo=@(x) [Tp(x);TL(x)]; %objective
g=@(x) [100*P(x)/(eta*Pmax)-1; Fc(x)/Fcmax-1; R(x)/Rmax-1]; %constraints
MOOP Example: CNC Lathe Cutting Process
• Use MATLAB multi-objective GA solver
Opt.solver='gamultiobj';
Opt.nvars=3;
Opt.fitnessfcn=fmo;
Opt.options =
optimoptions('gamultiobj','PlotFcn',@gaplotpareto);
Opt.nonlcon=@(x) deal(g(x),[]);
Opt.x0=x0;
Opt.lb=xl;
Opt.ub=xu;
[x,fval]=gamultiobj(Opt)
MOOP Example: CNC Lathe Cutting Process
• x =
212.1862 0.4981 5.6282
348.0556 0.5437 5.9297
212.1862 0.4981 5.6282
223.5515 0.4978 5.6358
356.8773 0.5494 5.9329
365.9745 0.5498 5.9338
333.6399 0.5358 5.9026
289.9982 0.5253 5.7896
277.3094 0.5187 5.7633
355.1101 0.5447 5.9365
298.0616 0.5203 5.8584
261.7574 0.4992 5.8926
283.0370 0.5201 5.7842
329.4771 0.5415 5.8495
232.1757 0.4983 5.6782
319.4215 0.5340 5.8887
367.3509 0.5500 5.9427
340.9502 0.5417 5.8431
MOOP Example: CNC Lathe Cutting Process
• fval =
0.5718 1.0328
0.4026 3.3032
0.5718 1.0328
0.5530 1.1736
0.3961 3.5009
0.3916 3.7233
0.4144 2.9975
0.4537 2.1584
0.4692 1.9456
0.3984 3.4662
0.4467 2.3011
0.4890 1.6875
0.4624 2.0404
0.4165 2.9111
0.5373 1.2825
0.4243 2.6990
0.3907 3.7545
0.4101 3.1685
MOOP Example: Minimum Thrust Design
• Problem: minimize engine thrust requirement for a business jet
• Background: engine thrust requirements are dictated by the
minimum thrust required during:
– Take off
– Climb
– Cruise
– Sustained turn
– Service ceiling
MOOP Example: Minimum Thrust Design
• Thrust requirement during cruise and constant velocity turn:
𝑇 = 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘
𝑛𝑊
𝑞𝑆
2
+
Δ𝑃
𝑉
where
– 𝑞 = dynamic pressure
– 𝑆 = surface area
– 𝐶𝐷𝑚𝑖𝑛 = minimum drag coefficient
– 𝑛 = load factor
– 𝑘 = lift induced drag coefficient
– Δ𝑃 = excess power
MOOP Example: Minimum Thrust Design
• Thrust requirement during TO run: 𝑆𝐺 =
𝑉𝐿𝑂𝐹
2𝑎
where 𝑎 =
𝑇−𝑞𝑆𝐶𝐷𝑇𝑂
𝑊
− 𝜇 1 −
𝑞𝑆𝐶𝐿𝑇𝑂
𝑊
𝑔
• Thrust requirement during climb:
𝑇 =
𝑉𝑉
𝑉
𝑊 + 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘
𝑊
𝑞𝑆
2
• Thrust requirement at service ceiling:
𝑇 =
1.667
𝑉
𝑊 + 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘
𝑊
𝑞𝑆
2
where 𝑞 =
𝑊
𝑆
𝑘
3𝐶𝐷𝑚𝑖𝑛
MOOP Example: Minimum Thrust Design
• Multi-objective formulation:
Objective 1: minimize thrust requirement during climb
Objective 2: minimize thrust requirement during sustained turn
Design Example: Engine Thrust
• fval =
0.2348 0.1231
0.2348 0.1232
0.2348 0.1231
0.2348 0.1231
0.2348 0.1232
0.2348 0.1232
0.2348 0.1232
0.2348 0.1231
0.2348 0.1232
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
0.2348 0.1231
View publication stats
View publication stats

More Related Content

Similar to OptimumEngineeringDesign-Day7.pdf

Creative Journey
Creative JourneyCreative Journey
Creative JourneyAshley Kent
 
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01Hemant Jha
 
Paper study: Attention, learn to solve routing problems!
Paper study: Attention, learn to solve routing problems!Paper study: Attention, learn to solve routing problems!
Paper study: Attention, learn to solve routing problems!ChenYiHuang5
 
Vehicle Routing Problem using PSO (Particle Swarm Optimization)
Vehicle Routing Problem using PSO (Particle Swarm Optimization)Vehicle Routing Problem using PSO (Particle Swarm Optimization)
Vehicle Routing Problem using PSO (Particle Swarm Optimization)Niharika Varshney
 
10_support_vector_machines (1).pptx
10_support_vector_machines (1).pptx10_support_vector_machines (1).pptx
10_support_vector_machines (1).pptxshyedshahriar
 
Optimum engineering design - Day 5. Clasical optimization methods
Optimum engineering design - Day 5. Clasical optimization methodsOptimum engineering design - Day 5. Clasical optimization methods
Optimum engineering design - Day 5. Clasical optimization methodsSantiagoGarridoBulln
 
Chapter 5.pptx
Chapter 5.pptxChapter 5.pptx
Chapter 5.pptxTekle12
 
Least Square Optimization and Sparse-Linear Solver
Least Square Optimization and Sparse-Linear SolverLeast Square Optimization and Sparse-Linear Solver
Least Square Optimization and Sparse-Linear SolverJi-yong Kwon
 
AAC ch 3 Advance strategies (Dynamic Programming).pptx
AAC ch 3 Advance strategies (Dynamic Programming).pptxAAC ch 3 Advance strategies (Dynamic Programming).pptx
AAC ch 3 Advance strategies (Dynamic Programming).pptxHarshitSingh334328
 
Optimum engineering design - Day 6. Classical optimization methods
Optimum engineering design - Day 6. Classical optimization methodsOptimum engineering design - Day 6. Classical optimization methods
Optimum engineering design - Day 6. Classical optimization methodsSantiagoGarridoBulln
 
Aplicaciones de la derivada en la carrera de ingeniería mecánica
Aplicaciones de la derivada en la carrera de ingeniería mecánicaAplicaciones de la derivada en la carrera de ingeniería mecánica
Aplicaciones de la derivada en la carrera de ingeniería mecánicaPeterParreo
 
Introduction of Quantum Annealing and D-Wave Machines
Introduction of Quantum Annealing and D-Wave MachinesIntroduction of Quantum Annealing and D-Wave Machines
Introduction of Quantum Annealing and D-Wave MachinesArithmer Inc.
 
Presentation on Design of DT.pptx
Presentation on Design of DT.pptxPresentation on Design of DT.pptx
Presentation on Design of DT.pptxssuserb14ebc
 
Personalized list recommendation based on multi armed bandit algorithms
Personalized list recommendation based on multi armed bandit algorithmsPersonalized list recommendation based on multi armed bandit algorithms
Personalized list recommendation based on multi armed bandit algorithmsWeiwen Liu
 
DL_lecture3_regularization_I.pdf
DL_lecture3_regularization_I.pdfDL_lecture3_regularization_I.pdf
DL_lecture3_regularization_I.pdfsagayalavanya2
 
Support vector machines
Support vector machinesSupport vector machines
Support vector machinesJinho Lee
 
unit-4-dynamic programming
unit-4-dynamic programmingunit-4-dynamic programming
unit-4-dynamic programminghodcsencet
 
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...Atsushi Nitanda
 

Similar to OptimumEngineeringDesign-Day7.pdf (20)

Creative Journey
Creative JourneyCreative Journey
Creative Journey
 
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01
Vlsiphysicaldesignautomationonpartitioning 120219012744-phpapp01
 
Paper study: Attention, learn to solve routing problems!
Paper study: Attention, learn to solve routing problems!Paper study: Attention, learn to solve routing problems!
Paper study: Attention, learn to solve routing problems!
 
Vehicle Routing Problem using PSO (Particle Swarm Optimization)
Vehicle Routing Problem using PSO (Particle Swarm Optimization)Vehicle Routing Problem using PSO (Particle Swarm Optimization)
Vehicle Routing Problem using PSO (Particle Swarm Optimization)
 
10_support_vector_machines (1).pptx
10_support_vector_machines (1).pptx10_support_vector_machines (1).pptx
10_support_vector_machines (1).pptx
 
Optimum engineering design - Day 5. Clasical optimization methods
Optimum engineering design - Day 5. Clasical optimization methodsOptimum engineering design - Day 5. Clasical optimization methods
Optimum engineering design - Day 5. Clasical optimization methods
 
1
11
1
 
Chapter 5.pptx
Chapter 5.pptxChapter 5.pptx
Chapter 5.pptx
 
Selaidechou
SelaidechouSelaidechou
Selaidechou
 
Least Square Optimization and Sparse-Linear Solver
Least Square Optimization and Sparse-Linear SolverLeast Square Optimization and Sparse-Linear Solver
Least Square Optimization and Sparse-Linear Solver
 
AAC ch 3 Advance strategies (Dynamic Programming).pptx
AAC ch 3 Advance strategies (Dynamic Programming).pptxAAC ch 3 Advance strategies (Dynamic Programming).pptx
AAC ch 3 Advance strategies (Dynamic Programming).pptx
 
Optimum engineering design - Day 6. Classical optimization methods
Optimum engineering design - Day 6. Classical optimization methodsOptimum engineering design - Day 6. Classical optimization methods
Optimum engineering design - Day 6. Classical optimization methods
 
Aplicaciones de la derivada en la carrera de ingeniería mecánica
Aplicaciones de la derivada en la carrera de ingeniería mecánicaAplicaciones de la derivada en la carrera de ingeniería mecánica
Aplicaciones de la derivada en la carrera de ingeniería mecánica
 
Introduction of Quantum Annealing and D-Wave Machines
Introduction of Quantum Annealing and D-Wave MachinesIntroduction of Quantum Annealing and D-Wave Machines
Introduction of Quantum Annealing and D-Wave Machines
 
Presentation on Design of DT.pptx
Presentation on Design of DT.pptxPresentation on Design of DT.pptx
Presentation on Design of DT.pptx
 
Personalized list recommendation based on multi armed bandit algorithms
Personalized list recommendation based on multi armed bandit algorithmsPersonalized list recommendation based on multi armed bandit algorithms
Personalized list recommendation based on multi armed bandit algorithms
 
DL_lecture3_regularization_I.pdf
DL_lecture3_regularization_I.pdfDL_lecture3_regularization_I.pdf
DL_lecture3_regularization_I.pdf
 
Support vector machines
Support vector machinesSupport vector machines
Support vector machines
 
unit-4-dynamic programming
unit-4-dynamic programmingunit-4-dynamic programming
unit-4-dynamic programming
 
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...
Stochastic Gradient Descent with Exponential Convergence Rates of Expected Cl...
 

More from SantiagoGarridoBulln

Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.
Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.
Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.SantiagoGarridoBulln
 
Optimum Engineering Design - Day 2b. Classical Optimization methods
Optimum Engineering Design - Day 2b. Classical Optimization methodsOptimum Engineering Design - Day 2b. Classical Optimization methods
Optimum Engineering Design - Day 2b. Classical Optimization methodsSantiagoGarridoBulln
 
Lecture_Slides_Mathematics_06_Optimization.pdf
Lecture_Slides_Mathematics_06_Optimization.pdfLecture_Slides_Mathematics_06_Optimization.pdf
Lecture_Slides_Mathematics_06_Optimization.pdfSantiagoGarridoBulln
 
CI L11 Optimization 3 GlobalOptimization.pdf
CI L11 Optimization 3 GlobalOptimization.pdfCI L11 Optimization 3 GlobalOptimization.pdf
CI L11 Optimization 3 GlobalOptimization.pdfSantiagoGarridoBulln
 
complete-manual-of-multivariable-optimization.pdf
complete-manual-of-multivariable-optimization.pdfcomplete-manual-of-multivariable-optimization.pdf
complete-manual-of-multivariable-optimization.pdfSantiagoGarridoBulln
 
slides-linear-programming-introduction.pdf
slides-linear-programming-introduction.pdfslides-linear-programming-introduction.pdf
slides-linear-programming-introduction.pdfSantiagoGarridoBulln
 

More from SantiagoGarridoBulln (12)

Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.
Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.
Genetic Algorithms. Algoritmos Genéticos y cómo funcionan.
 
Optimum Engineering Design - Day 2b. Classical Optimization methods
Optimum Engineering Design - Day 2b. Classical Optimization methodsOptimum Engineering Design - Day 2b. Classical Optimization methods
Optimum Engineering Design - Day 2b. Classical Optimization methods
 
CI_L01_Optimization.pdf
CI_L01_Optimization.pdfCI_L01_Optimization.pdf
CI_L01_Optimization.pdf
 
CI_L02_Optimization_ag2_eng.pdf
CI_L02_Optimization_ag2_eng.pdfCI_L02_Optimization_ag2_eng.pdf
CI_L02_Optimization_ag2_eng.pdf
 
Lecture_Slides_Mathematics_06_Optimization.pdf
Lecture_Slides_Mathematics_06_Optimization.pdfLecture_Slides_Mathematics_06_Optimization.pdf
Lecture_Slides_Mathematics_06_Optimization.pdf
 
CI_L11_Optimization_ag2_eng.pptx
CI_L11_Optimization_ag2_eng.pptxCI_L11_Optimization_ag2_eng.pptx
CI_L11_Optimization_ag2_eng.pptx
 
CI L11 Optimization 3 GlobalOptimization.pdf
CI L11 Optimization 3 GlobalOptimization.pdfCI L11 Optimization 3 GlobalOptimization.pdf
CI L11 Optimization 3 GlobalOptimization.pdf
 
optmizationtechniques.pdf
optmizationtechniques.pdfoptmizationtechniques.pdf
optmizationtechniques.pdf
 
complete-manual-of-multivariable-optimization.pdf
complete-manual-of-multivariable-optimization.pdfcomplete-manual-of-multivariable-optimization.pdf
complete-manual-of-multivariable-optimization.pdf
 
slides-linear-programming-introduction.pdf
slides-linear-programming-introduction.pdfslides-linear-programming-introduction.pdf
slides-linear-programming-introduction.pdf
 
bv_cvxslides (1).pdf
bv_cvxslides (1).pdfbv_cvxslides (1).pdf
bv_cvxslides (1).pdf
 
Optim_methods.pdf
Optim_methods.pdfOptim_methods.pdf
Optim_methods.pdf
 

Recently uploaded

Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Dr.Costas Sachpazis
 
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Dr.Costas Sachpazis
 
UNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular ConduitsUNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular Conduitsrknatarajan
 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordAsst.prof M.Gokilavani
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINESIVASHANKAR N
 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Christo Ananth
 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
 
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
Online banking management system project.pdf
Online banking management system project.pdfOnline banking management system project.pdf
Online banking management system project.pdfKamal Acharya
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...ranjana rawat
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxupamatechverse
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Call Girls in Nagpur High Profile
 
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxupamatechverse
 
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCollege Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCall Girls in Nagpur High Profile
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escortsranjana rawat
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college projectTonystark477637
 
UNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its PerformanceUNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its Performancesivaprakash250
 

Recently uploaded (20)

Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
 
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
 
UNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular ConduitsUNIT-II FMM-Flow Through Circular Conduits
UNIT-II FMM-Flow Through Circular Conduits
 
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete RecordCCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
CCS335 _ Neural Networks and Deep Learning Laboratory_Lab Complete Record
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
 
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
 
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
(INDIRA) Call Girl Aurangabad Call Now 8617697112 Aurangabad Escorts 24x7
 
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Meera Call 7001035870 Meet With Nagpur Escorts
 
Online banking management system project.pdf
Online banking management system project.pdfOnline banking management system project.pdf
Online banking management system project.pdf
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
 
Introduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptxIntroduction and different types of Ethernet.pptx
Introduction and different types of Ethernet.pptx
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
 
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANVI) Koregaon Park Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
 
Introduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptxIntroduction to IEEE STANDARDS and its different types.pptx
Introduction to IEEE STANDARDS and its different types.pptx
 
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service NashikCollege Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
College Call Girls Nashik Nehal 7001305949 Independent Escort Service Nashik
 
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur EscortsHigh Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
High Profile Call Girls Nagpur Isha Call 7001035870 Meet With Nagpur Escorts
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college project
 
UNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its PerformanceUNIT - IV - Air Compressors and its Performance
UNIT - IV - Air Compressors and its Performance
 

OptimumEngineeringDesign-Day7.pdf

  • 2. Course Materials • Arora, Introduction to Optimum Design, 3e, Elsevier, (https://www.researchgate.net/publication/273120102_Introductio n_to_Optimum_design) • Parkinson, Optimization Methods for Engineering Design, Brigham Young University (http://apmonitor.com/me575/index.php/Main/BookChapters) • Iqbal, Fundamental Engineering Optimization Methods, BookBoon (https://bookboon.com/en/fundamental-engineering-optimization- methods-ebook)
  • 3. MATLAB Global Optimization Toolbox • Solvers – Genetic algorithm – Simulated annealing – Pattern search – Particle swarm optimization
  • 4. Robust Design • Real-world designs are subject to variations • Variation may arise from manufacturing processes, material properties, changing operating conditions, etc. • Variation lead to poor performance, product failure, and customer dissatisfaction. • In optimal design problems, variations invariably reduce the feasible region. Since optimal designs are normally defined by binding constraints, variation may cause optimal designs to become infeasible. • A robust design is a design that can withstand variation. • Feasibility robustness means the constraints will remain feasible when subjected to variation.
  • 5. Tolerance Box Approach • Consider the design optimization problem: min 𝒙 𝑓 𝒙 , subject to 𝑔𝑖 𝒙 ≤ 𝑏𝑖, 𝑖 = 1, … , 𝑚 • Using worst case tolerances in design variables, we may define a tolerance box, where a robust design will have the entire box in the feasible region
  • 6. Transmitted Variation Approach • Consider the design optimization problem: min 𝒙 𝑓 𝒙, 𝒑 , subject to 𝑔𝑖 𝒙, 𝒑 ≤ 𝑏𝑖, 𝑖 = 1, … , 𝑚 where 𝒙 is a vector of design variables, and 𝒑 is a parameter vector • Let Δ𝒙, Δ𝒑, Δ𝒃 denote the variation in 𝒙, 𝒑, 𝑎𝑛𝑑 𝒃 about nominal values; then variation in the constraint functions is computed as: Δ𝑔𝑖 = 𝜕𝑔𝑖 𝜕𝑥𝑗 Δ𝑥𝑗 𝑛 𝑗=1 + 𝜕𝑔𝑖 𝜕𝑝𝑗 Δ𝑝𝑗 𝑚 𝑗=1 • The total variation is given as: Δ𝑖 = Δ𝑔𝑖 + Δ𝑏𝑖 • A robust design solves the following optimization problem: min 𝒙 𝑓 𝒙, 𝒑 , subject to 𝑔𝑖 𝒙, 𝒑 ≤ 𝑏𝑖 − Δ𝑖, 𝑖 = 1, … , 𝑚 i.e., the feasible region is reduced by the total variation in constraints
  • 7. Transmitted Variation Approach • Assuming the robust optimum is close to the nominal optimum, it may be solved as: – Compute the nominal optimum point – Reduce the rhs by the transmitted variation – Re-compute the optimum
  • 8. Design Example: Symmetric Two-Bar Truss Problem: design a symmetrical two-bar truss of minimum mass to support a fixed load 𝑃. The truss has height 𝐻, and span 𝐵. Design variables: diameter 𝑑 , thickness (𝑡), height 𝐻 𝑙 = (𝐵/2)2+𝐻2, 𝐴 = 𝜋𝑑𝑡 Total weight: 𝑊 = 2𝜌𝑙𝐴, Constraints: Axial stress: 𝜎 = 𝑃𝑙 2𝜋𝑑𝑡𝐻 ≤ 𝜎𝑎 Buckling stress: 𝜎𝑏 = 𝜋2 𝑑2+𝑡2 𝐸 8𝑙2 ≤ 𝜎𝑎 Deflection: 𝜀 = 𝑃𝑙3 2𝜋𝑑𝑡𝐻2𝐸 ≤ 𝜀𝑚𝑎𝑥
  • 9. Design Example: Symmetric Two-Bar Truss The design optimization problem is defined as: Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎𝑏 𝜎 − 1 ≤ 0, 𝜎 𝜎𝑎 − 1 ≤ 0, 𝜀 𝜀𝑚𝑎𝑥 − 1 ≤ 0, For a particular problem, let: 𝑃 = 66 𝑘𝑖𝑝𝑠; 𝐵 = 60 𝑖𝑛; 𝑡 = 0.15; 𝜌 = 0.3 𝑙𝑏 𝑖𝑛3 ; 𝐸 = 30 × 106 𝑙𝑏 𝑖𝑛2 ; 𝜎𝑎 = 1 × 105 𝑝𝑠𝑖; 𝜀𝑚𝑎𝑥 = 0.25 𝑖𝑛 The optimum design, obtained via SA, is given as: 𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.8801 lbs The stress and elongation at the optimum point are: 𝜎 = 99.96 𝑘𝑖𝑝𝑠, 𝜎𝑏 = 71.74 𝑘𝑖𝑝𝑠, 𝜀 = 0.2 𝑖𝑛
  • 10. Design Example: Symmetric Two-bar Truss • Consider the following variations in design parameters Load: Δ𝑃 = 2 𝑘𝑖𝑝𝑠 Span: Δ𝐵 = 1.0 𝑖𝑛 • The transmitted variations to the constraints are computed as: Δ𝜎 = 𝜕𝜎 𝜕𝑃 Δ𝑃 + 𝜕𝜎 𝜕𝑙 𝜕𝑙 𝜕𝐵 Δ𝐵 Δ𝜎𝑏 = 𝜕𝜎𝑏 𝜕𝑃 Δ𝑃 + 𝜕𝜎𝑏 𝜕𝑙 𝜕𝑙 𝜕𝐵 Δ𝐵 Δ𝜀 = 𝜕𝜀 𝜕𝑃 Δ𝑃 + 𝜕𝜀 𝜕𝑙 𝜕𝑙 𝜕𝐵 Δ𝐵 Then Δ𝜎 = 3.865 𝑘𝑖𝑝𝑠; Δ𝜎𝑏 = −1.196 𝑘𝑖𝑝𝑠; Δ𝜀 = 0.011 𝑖𝑛
  • 11. Design Example: Symmetric Two-bar Truss • The robust design optimization problem is defined as: Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎 + Δ𝜎 − 𝜎𝑎 ≤ 0, 𝜎𝑏 + Δ𝜎 + Δ𝜎𝑏 − 𝜎 ≤ 0, 𝜀 + Δ𝜀 − 𝜀𝑚𝑎𝑥 ≤ 0, • The robust optimum design obtained via SA is given as: 𝐻 =30.537 in, 𝑑 =1.931 in, 𝑡 =0.0792 in; 𝑓 =12.34 lbs Compare with nominal optimum design: 𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.88 lbs
  • 12. Design Example: Symmetric Two-bar Truss Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎𝑏 𝜎 − 1 ≤ 0, 𝜎 𝜎𝑎 − 1 ≤ 0, 𝜀 𝜀𝑚𝑎𝑥 − 1 ≤ 0, • Parameter variations Load: Δ𝑃 = 2 𝑘𝑖𝑝𝑠 Span: Δ𝐵 = 1.0 𝑖𝑛 • Optimum design 𝐻 =27.5703 in 𝐷 =2.0112 in 𝑇 =0.0800 in 𝑊 =12.357 lbs
  • 13. Design Example: Symmetric Two-bar Truss • MATLAB code % (Ref: Parkinson, Optimization Methods for Engineering Design) % Transmitted variation P=66e3; %load [lbs] t=0.08; %thickness [in] rho=0.3; %density [lb/in2] E=30e6; %elastic modulus [lb/in2] Smax=1e5; %allowable stress [lb/in2] Emax=.25; %allowable deflection [in] d=1.1:.1:3; h=11:30; [H,D]=meshgrid(h,d); A=pi*D.*t; L=sqrt(H.^2+(b/2)^2); W=2*rho*A.*L; S=P*L./(2*H.*A); SB=pi^2*E*(D.^2+t.^2)./(8*L.^2); Eps=P*L.^3./(2*E*H.^2.*A);
  • 14. Design Example: Symmetric Two-bar Truss db=1; %variation (width) dP=2e3; %variation (load) dS= (abs(dP/P)+abs(b^2./L.^2/4*db/b)).*S; dSb= abs(-b^2./L.^2/2*db/b).*SB; dEps= (abs(dP/P)+abs(3*b^2./L.^2/4*db/b)).*Eps; C1=S/Smax-1; C2=SB./S-1; C3=Eps/Emax-1; C4=(S+dS)/Smax-1; C5=(SB+dS+dSb)./S-1; C6=(Eps+dEps)/Emax-1; figure, hold xlabel('H'), ylabel('D') contour(h,d,C1,[0 0]), contour(h,d,C2,[0 0]), contour(h,d,C3,[0 0]), contour(h,d,C4,[0 0],'Color','red'), contour(h,d,C5,[0 0],'Color','red'), contour(h,d,C6,[0 0],'Color','red'), contour(h,d,W,'ShowText','on');
  • 15. Statistical Variation • Assume that design variables and parameters are independent random variables, normally distributed about the mean, i.e., 𝑋𝑖~𝑁(𝜇𝑖, 𝜎𝑖) • Then the transmitted variation is computed as: 𝜎𝑔𝑖 2 = 𝜕𝑔𝑖 𝜕𝑥𝑗 𝜎𝑥𝑗 2 𝑛 𝑗=1 + 𝜕𝑔𝑖 𝜕𝑝𝑗 𝜎𝑝𝑗 𝑚 𝑗=1 2 • The total constraint variance (including rhs variability) is: 𝜎𝑖 2 = 𝜎𝑔𝑖 2 + 𝜎𝑏𝑖 2 • For robust design, constraints are modified as: 𝑔𝑖 ≤ 𝑏𝑖 − 𝑘𝜎𝑖 2 where a value of 𝑘 = 3 results in 99.865% feasibility
  • 16. Design Example: Symmetrical Three-bar Truss • Consider the optimum design problem for three-bar truss Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎𝑏 𝜎 − 1 ≤ 0, 𝜎 𝜎𝑎 − 1 ≤ 0, 𝜀 𝜀𝑚𝑎𝑥 − 1 ≤ 0, • The nominal design is given as: 𝐻 =29.9010 in, 𝑑 =1.8631 in, 𝑡 =0.0799 in; 𝑓 =11.88 lbs • Assume the following distribution for load 𝑃 and span 𝐵 𝑃~𝑁 66,0.667 𝑘𝑖𝑝𝑠, 𝐵~𝑁 60,0.333 𝑖𝑛
  • 17. Design Example: Symmetrical Three-bar Truss • The robust design optimization problem is defined as: Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎 + 3𝜎𝑆 − 𝜎𝑎 ≤ 0, 𝜎𝑏 + 3𝜎𝑆𝑏 − 𝜎 ≤ 0, 𝜀 + 3𝜎𝜀 − 𝜀𝑚𝑎𝑥 ≤ 0, where the transmitted variances are computed as: 𝜎𝑆 2 = 𝜕𝜎 𝜕𝑃 𝜎𝑃 2 + 𝜕𝜎 𝜕𝑙 𝜕𝑙 𝜕𝐵 𝜎𝐵 2 𝜎𝑆𝑏 2 = 𝜕𝜎𝑏 𝜕𝑃 𝜎𝑃 2 + 𝜕𝜎𝑏 𝜕𝑙 𝜕𝑙 𝜕𝐵 𝜎𝐵 2 𝜎𝜀 2 = 𝜕𝜀 𝜕𝑃 𝜎𝑃 2 + 𝜕𝜀 𝜕𝑙 𝜕𝑙 𝜕𝐵 𝜎𝐵 2 Then 𝜎𝑆 = 1.048 𝑘𝑖𝑝𝑠; 𝜎𝑆𝑏 = −0.399 𝑘𝑖𝑝𝑠; 𝜎𝜀 = 0.003 𝑖𝑛
  • 18. Design Example: Symmetric Two-bar Truss Objective: min d,H 2𝜋𝑑𝑡𝜌 (𝐵/2)2+𝐻2 Subject to: 𝜎𝑏 𝜎 − 1 ≤ 0, 𝜎 𝜎𝑎 − 1 ≤ 0, 𝜀 𝜀𝑚𝑎𝑥 − 1 ≤ 0, • Parameter variations Load: 𝑃~𝑁 66,0.667 𝑘𝑖𝑝𝑠 Span: 𝐵~𝑁 60,0.333 𝑖𝑛 • Optimum design 𝐻 =26.6509 in 𝐷 =2.0389 in 𝑇 =0.0800 in 𝑊 =12.338 lbs
  • 19. Design Example: Symmetric Two-bar Truss • A comparison of robust design methods • Notes – These results were obtained via simulated annealing – Worst case design using transmitted variation is quite conservative – The statistical variation design is less conservative, however guarantees 99.865% feasibility Parameter Nominal design Transmitted variation Statistical variation H (in) 29.9 30.54 29.68 D (in) 1.86 1.93 1.93 T (in) 0.08 0.079 0.08 W (lbs) 11.88 12.34 12.25
  • 20. Multi-Objective Optimization • Practical optimization problems possess multiple objectives: – For example, we want to minimize production and maintenance costs, maximize safety, aesthetic appeal, space usage, etc. – Suppose we desire to minimize weight as well as deflection at a particular location. These two objectives are competing.
  • 21. Multi-Objective Optimization • A multi-objective optimization problem is defined in terms of a vector of objectives 𝐹(𝑥) that is the subject to inequality and/or equality constraints and/or bounds on design variables. Objectives: 𝐹 𝑥 = 𝐹1 𝑥 , 𝐹2 𝑥 , … , 𝐹𝑀 𝑥 Subject to: 𝐺𝑖 𝑥 ≤ 0, 𝑖 = 1, … , 𝑘; 𝐺𝑖 𝑥 = 0, 𝑖 = 𝑘 + 1, … , 𝑚; 𝑥𝑗 𝐿 ≤ 𝑥𝑗 < 𝑥𝑗 𝑈 , 𝑗 = 1, … , 𝑛. • As there is no unique solution, the concept of Pareto optimality is used to characterize the objectives. At the optimal point an improvement in one of the objectives is accompanied by an equivalent degradation in another.
  • 22. Multi-Objective Optimization • A general goal in multi-objective optimization is construction of Pareto optima, i.e., a series of non-dominated solutions.
  • 23. Multi-Objective Optimization Methods • Weighted sum and weighted metric approaches • Multi-objective linear programming • Multi-objective combinatorial optimization • Goal programming approaches (minimize deviation from goal) • Evolutionary algorithms (EA are naturally suited to MOOPs) – Multi-objective genetic algorithm – Multi-objective ant colony optimization – Multi-objective particle swarm optimization • Archived simulated annealing – Non-dominated solutions found during SA are archived • Game theoretic approaches (multi-player competing games)
  • 24. Design Example: Symmetric Two-Bar Truss Problem: design a symmetrical two-bar truss of minimum mass to support a fixed load 𝑃. The truss has height 𝐻, and span 𝐵. Design variables: diameter 𝑑 , height 𝐻 Total weight: 𝑊 = 2𝜌𝑙𝐴, where 𝑙 = (𝐵/2)2+𝐻2, 𝐴 = 𝜋𝑑𝑡 Dual Objective: Minimize weight and end deflection Constraints: Axial stress: 𝜎 = 𝑃𝑙 2𝜋𝑑𝑡𝐻 ≤ 𝜎𝑎 Buckling stress: 𝜎𝑏 = 𝜋2 𝑑2+𝑡2 𝐸 8𝑙2 ≤ 𝜎𝑎 Deflection: 𝜀 = 𝑃𝑙3 2𝜋𝑑𝑡𝐻2𝐸 ≤ 𝜀𝑚𝑎𝑥
  • 25. MOOP Example: Two-bar Truss %Symmetric two-bar truss %variables: diameter(d), height(h); x=[d,h] t=.15; %thickness b=60; %span [in] P=66e3; %load [lbs] E=30e6; %elastic modulus [lb/in2] rho=0.3; %density [lb/in3] Smax=100e3; %maximum stress [lb/in2] l=@(x) sqrt((b/2)^2+x(2)^2); %length [in] W=@(x) 2*pi*x(1)*t*l(x)*rho; %weight [lbs] Sa=@(x) P*l(x)/(2*pi*x(1)*t*x(2)); %stress [lb/in2] Sb=@(x) pi^2*E*(x(1)^2+t^2)/(8*l(x)^2); %buckling [lb/in2] del=@(x) P*l(x)^3/(2*pi*x(1)*t*x(2)^2*E); %deflection [in] f=@(x) [W(x)/30;del(x)]; %dual objective g=@(x) [Sa(x)/Smax-1; Sb(x)/Sa(x)-1]; %constraints
  • 26. MOOP Example: Two-bar Truss • Define problem structure in MATLAB Opt = struct with fields: solver: 'gamultiobj' fitnessfcn: @(x)[W(x)/30;del(x)] nvars: 2 x0: [1 0.1500] Aineq: [] bineq: [] lb: [0.5000 10] ub: [2.5000 40] options: [1×1 optim.options.GamultiobjOptions] objective: [] nonlcon: @(x)deal(g(x),[]) >> [x,fval]=gamultiobj(Opt) Optimization terminated: average change in the spread of Pareto solutions less than options.FunctionTolerance.
  • 27. MOOP Example: Two-bar Truss x = 1.7930 39.1909 0.9656 31.6035 1.0951 33.1630 1.7930 39.1909 1.3503 32.1439 1.7298 38.5558 1.3875 35.1076 1.6268 32.7486 0.9656 31.6035 1.3039 31.4507 1.2092 32.1774 1.7254 35.7853 1.5912 25.2049 1.3275 35.2242 0.9914 32.8852 1.0816 31.8717 1.0283 33.4329 1.6686 34.2041
  • 28. MOOP Example: CNC Lathe Cutting Process • Problem: Find the Pareto front for CNC lathed cutting, where the objectives are: 1) minimize process time; 2) maximize tool life Design variables: cutting speed 𝑣 𝑚 𝑚𝑖𝑛 , feed 𝑓 𝑚𝑚 𝑟𝑒𝑣 , depth 𝑎 [𝑚𝑚] Process time is given as: 𝜏 = 𝜏𝑠 + 𝑉 𝑀 1 + 𝜏𝑇𝐶 𝑇 + 𝜏0 where 𝜏𝑠 is setup time, 𝑉 is material removed, 𝑀 is removal rate, 𝑇 is tool life, and 𝜏0 is inactive time Material removal rate is: 𝑀 = 1000𝑣𝑓𝑎 Used tool life is: 𝜉 = 𝑉 𝑀𝑇 × 100% • Empirical models for tool life and cutting force are obtained as: 𝑇 = 5.48×109 𝑣3.46𝑓0.696𝑎0.46 ; 𝐹𝑐 = 6.56 × 103 𝑓0.917𝑎1.1 𝑣0.286
  • 29. MOOP Example: CNC Lathe Cutting Process • The multi-objective optimization problem is formulated as: Objective 𝐹1: min 𝑣,𝑓,𝑎 𝜏 Objective 𝐹2: max 𝑣,𝑓,𝑎 𝜉 Subject to: 𝑔1: 100𝑃 𝜂𝑃𝑚𝑜𝑡 − 1 ≤ 0 𝑔2: 𝐹𝑐 𝐹𝑐𝑚𝑎𝑥 − 1 ≤ 0 𝑔3: 𝑅 𝑅𝑚𝑎𝑥 − 1 ≤ 0 where 𝑅 = 125𝑓2 𝑟𝐸 , 𝑃 = 𝐹𝑐𝑣 60,000 , 𝑃𝑚𝑜𝑡 is motor power, 𝜂 is efficiency Let 𝑃𝑚𝑜𝑡 = 10𝑘𝑊, 𝜂 = 0.75, 𝑟𝐸 = 0.8 𝑚𝑚, 𝑅𝑚𝑎𝑥 = 50𝜇𝑚, 𝐹𝑐𝑚𝑎𝑥 = 5𝑘𝑁 Let 200 ≤ 𝑣 ≤ 400, 0.15 ≤ 𝑓 ≤ 0.55, 1.5 ≤ 𝑎 ≤ 6
  • 30. MOOP Example: CNC Lathe Cutting Process %cnc lathe cutting example (Ref: Deb, Optimization for Engineering Design) %objectives: 1. minimize operation time; 2. max tool life %variables: cutting speed(v), feed(f), depth of cut(a) xl=[200,.15,2]; xu=[400,.55,6]; %variable bounds x0=(xl+xu)/2; %trial design [v,f,a] Pmax=10e3; %[W] Fcmax=5000; %[N] max force Rmax=50; %[mu-m] roughness rn=0.8; %[mm] tool radius eta=.75; %efficiency V=219912; %[mm3] material removed ts=.15; %[min] setup time tc=.20; %[min] tool change time ti=.05; %[min] inactive time T=@(x) 5.48e9/prod(x.^[3.46,.696,.46]); %tool life Fc=@(x) 6560*prod(x.^[-.286,.917,1.1]); %cutting force P=@(x) Fc(x)*x(1)/60e3; %power used M=@(x) 1000*prod(x); %material removal rate Tp=@(x) ts+ti+V*(1+tc/T(x))/M(x); %process time TL=@(x) 100*V/(M(x)*T(x)); %used tool life R=@(x) 125*x(2)^2/rn; %surface roughness fmo=@(x) [Tp(x);TL(x)]; %objective g=@(x) [100*P(x)/(eta*Pmax)-1; Fc(x)/Fcmax-1; R(x)/Rmax-1]; %constraints
  • 31. MOOP Example: CNC Lathe Cutting Process • Use MATLAB multi-objective GA solver Opt.solver='gamultiobj'; Opt.nvars=3; Opt.fitnessfcn=fmo; Opt.options = optimoptions('gamultiobj','PlotFcn',@gaplotpareto); Opt.nonlcon=@(x) deal(g(x),[]); Opt.x0=x0; Opt.lb=xl; Opt.ub=xu; [x,fval]=gamultiobj(Opt)
  • 32. MOOP Example: CNC Lathe Cutting Process • x = 212.1862 0.4981 5.6282 348.0556 0.5437 5.9297 212.1862 0.4981 5.6282 223.5515 0.4978 5.6358 356.8773 0.5494 5.9329 365.9745 0.5498 5.9338 333.6399 0.5358 5.9026 289.9982 0.5253 5.7896 277.3094 0.5187 5.7633 355.1101 0.5447 5.9365 298.0616 0.5203 5.8584 261.7574 0.4992 5.8926 283.0370 0.5201 5.7842 329.4771 0.5415 5.8495 232.1757 0.4983 5.6782 319.4215 0.5340 5.8887 367.3509 0.5500 5.9427 340.9502 0.5417 5.8431
  • 33. MOOP Example: CNC Lathe Cutting Process • fval = 0.5718 1.0328 0.4026 3.3032 0.5718 1.0328 0.5530 1.1736 0.3961 3.5009 0.3916 3.7233 0.4144 2.9975 0.4537 2.1584 0.4692 1.9456 0.3984 3.4662 0.4467 2.3011 0.4890 1.6875 0.4624 2.0404 0.4165 2.9111 0.5373 1.2825 0.4243 2.6990 0.3907 3.7545 0.4101 3.1685
  • 34. MOOP Example: Minimum Thrust Design • Problem: minimize engine thrust requirement for a business jet • Background: engine thrust requirements are dictated by the minimum thrust required during: – Take off – Climb – Cruise – Sustained turn – Service ceiling
  • 35. MOOP Example: Minimum Thrust Design • Thrust requirement during cruise and constant velocity turn: 𝑇 = 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘 𝑛𝑊 𝑞𝑆 2 + Δ𝑃 𝑉 where – 𝑞 = dynamic pressure – 𝑆 = surface area – 𝐶𝐷𝑚𝑖𝑛 = minimum drag coefficient – 𝑛 = load factor – 𝑘 = lift induced drag coefficient – Δ𝑃 = excess power
  • 36. MOOP Example: Minimum Thrust Design • Thrust requirement during TO run: 𝑆𝐺 = 𝑉𝐿𝑂𝐹 2𝑎 where 𝑎 = 𝑇−𝑞𝑆𝐶𝐷𝑇𝑂 𝑊 − 𝜇 1 − 𝑞𝑆𝐶𝐿𝑇𝑂 𝑊 𝑔 • Thrust requirement during climb: 𝑇 = 𝑉𝑉 𝑉 𝑊 + 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘 𝑊 𝑞𝑆 2 • Thrust requirement at service ceiling: 𝑇 = 1.667 𝑉 𝑊 + 𝑞𝑆 𝐶𝐷𝑚𝑖𝑛 + 𝑘 𝑊 𝑞𝑆 2 where 𝑞 = 𝑊 𝑆 𝑘 3𝐶𝐷𝑚𝑖𝑛
  • 37. MOOP Example: Minimum Thrust Design • Multi-objective formulation: Objective 1: minimize thrust requirement during climb Objective 2: minimize thrust requirement during sustained turn
  • 38. Design Example: Engine Thrust • fval = 0.2348 0.1231 0.2348 0.1232 0.2348 0.1231 0.2348 0.1231 0.2348 0.1232 0.2348 0.1232 0.2348 0.1232 0.2348 0.1231 0.2348 0.1232 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 0.2348 0.1231 View publication stats View publication stats