Академический Документы
Профессиональный Документы
Культура Документы
Definisi Model
1. Representasi sistem
nyata
t
2. Dari sudut pandang
tertentu
3. Atribut terbatas
Atribut terbatas
4. Sesuai keperluan
5/5/2009 Model.2005 1
Model dalam teori
keilmuan
Real worlds
Models
Principles
Laws
5/5/2009 Model.2005 2
Engineering system modelling
g g y g
M d l
Models
Verbal
V b l Mathematical
M th ti l Computer
C t
Models Models Models
5/5/2009 Model.2005 3
Model dalam Perancangan
Model dalam Perancangan
• Memperjelas
Memperjelas
permasalahan
• Menentukan atribut
perancangan
• Menggabungkan aspek
teknis dan aspek lainnya
sebagai tujuan
• Mendapatkan hasil
optimal
5/5/2009 Model.2005 4
Perancangan sebagai
Proses Perbaikan sistem
Kondisi Model
awal schematic Mathematical
Models
Model awal
Manipulasi matematik
Optimal models
Optimal models
Kondisi akhir Model
Perbaikan schematik
5/5/2009 Model.2005 5
Basic Principles
p
Determinant, Structure
Real system
Deterministic ‐ Stokastic
Static – Dinamic
Static
Proporsional – non proporsional
Descriptive – prescriptive‐ predivtive
Micro – macro
Behavioral
Simulation etc..
Reference
Models
system
y
5/5/2009 Model.2005 6
Process of Modelling a problem
g p
Proses analogi S2 dari S1
Input mapping
Reference
Reference Model of
Model of
Analogi
Modelled behaviour
System S1
Modelling sistem S2
Y1
O t t
Output mapping
i
Y2
5/5/2009 Model.2005 7
Process of Modelling a problem
g p
Problem dam formula mathematic
Formal Model
Algebraic statement
Of problem
Input of problem Validated
V lid t d
Data for validation model
Input of problem
Data for problem Operational
solution Model in use
5/5/2009 Model.2005 8
Model Simulasi
Model Simulasi
Problem Mapping to Problem System behavior
System behavior and situation concept
Statistical concept
p
Formal Model
System simulator
Of problem
Input of problem
Data for validation Validated
V lid t d
model
Input of problem
Input of problem
Data for problem
solution Operational
Model in use
5/5/2009 Model.2005 9
Solusi optimal dari model
l ld d l
Untuk penyelesaian
Programa linier
Programa non linier
Programa dinamik
Programa dinamik
Algoritma penyelesaian
Algoritma penyelesaian
1. Matematik diferential
2. Iterasi matrik
3
3. Simplek
4. Simulasi dsb
5/5/2009 Model.2005 10
Optimasi sederhana:
d h
minimum biaya total
Bi
Biaya Biaya total : Tc = Ci + Co
Biaya total : Tc = Ci + Co
dTc / dQ = 0
dTc / dQ 0
Biaya simpan = Ci = f ( Q)
Biaya pesan = Co = f (Q)
Q opt Jumlah pemesanan
5/5/2009 Model.2005 11
Optimasi sederhana:
Linear programming
Z = 1,2 x + 1,4 y Fungsi objective
40 x + 25 y = 1000
35 x + 28 y = 980 Fungsi pembatas
25 x + 35 y = 875
y opt.
X t
X opt.
X
5/5/2009 Model.2005 12
Algoritma sederhana : Johnson
Input Job i Output job i
m-1 m-2
Al ith
Algorithma Johnson
J h
• Job set U = {j;tj1<tj2} = {2,3,6} dan V = {j; tj1>=tj2 } = {1,4,5,7,8}
• Sort jobs in U as follows : Job i : 3 2 6,
ti1 : 1 2 3
ti1 : 1 2 3
• Sort jobs in V as follows : Job I : 5 4 7 1 8
ti2 : 6 5 2 2 1
• An optimal sequence is : 3,2,6,5,4,7,1,8, dengan min makespan = 37
An optimal sequence is : 3,2,6,5,4,7,1,8, dengan min makespan 37
M1 Job i 1 2 3 4 5 6 7 8
M2
ti1 5 2 1 7 6 3 7 5
ti2 2 6 2 5 6 7 2 1
M1 j3 j2 j6 j5 j4 j7 j1 j8
M2 j3 j2 j6 j5 j4 j7 j1 j8
5/5/2009 Model.2005 13
Konsep algoritma Simulasi
Konsep algoritma Simulasi
• Set simulation clock = 0
Initialisation • Initialize System state
Routine and statistical counters
• Initialize event list
Timing routine
• Call the timing routine • Determine the next event
Main Program • Call event routine I
Call event routine I • Advance the simulation clock
Advance the simulation clock
• Update system state
Is
• Update statistical counters
Event routine i simulation over ? no
• Generate future events and
add to the event list
add to t e e e t st
Yes
• Compute estimates of interest
Compute estimates of interest
Report generator • Print report
5/5/2009 Model.2005 14
Algoritma untuk optimasi
metoda konvensional
Initial single point
Improvement
Problem‐specific
Terminal ?
Terminal ?
No
Yes
End
5/5/2009 Model.2005 15
Algoritma untuk optimasi
algoritma genetik
Initial population
Improvement
Problem‐ independent
Terminal ?
Terminal ?
No
Yes
End
5/5/2009 Model.2005 16
Algoritma genetika
Algoritma genetika
Solutions
encoding New population
New population
Chromosomes
Selection
Evaluation
Crossover Mutation
Offspring
decoding
5/5/2009 Model.2005 17