Anak Agung Ngurah Perwira Redi Ph.

D
Nur Layli Rachmawati, M.T.

LG3102 – 3 sks
Optimasi Logistik
Teknik Logistik
https://www.google.co.id/maps/search/rumah+sakit/@-6.2706941,106.7028021,11.17z
COURSE OUTCOMES
• Mahasiswa mampu menjelaskan
konsep pentingnya lokasi fasilitas
REFERENCES
dalam sistem distribusi dan
transportasi. Daskin, Mark S. 2013. Network
• Mahasiswa mampu
mengklasifikasikan jenis-jenis and Discrete Location:
permasalahan penentuan lokasi Models, Algorithms, and
fasilitas dalam jaringan distribusi
dan transportasi.
Applications. 2nd edition.
• Mahasiswa mampu menghitung Wiley.
jarak antar lokasi fasilitas.

Optimasi Logistik - Teknik Logistik 2

 TOPIK BAHASAN
• Pengantar distribusi dan transportasi
• Linear programming review(LP)
• Covering problem dalam distribusi dan
transportasi PENILAIAN*
• Center problem dalam distribusi dan
transportasi
• Tugas = 15%
• Median problem dalam distribusi dan
transportasi • Kuis = 20%
• Shortest path problem review • Tugas Besar = 15%
• Algoritma Djikstra
• UTS = 25%
• Traveling salesman roblem (TSP)
• Vehicle routing problem (VRP) • UAS = 25%
• Transportasi dalam Supply Chain

Optimasi Logistik - Teknik Logistik 3

 PENGANTAR TEORI LOKASI DAN MODEL

• Apa itu Sistem Distribusi dan Transportasi (SDT)?

• Mengapa SDT terkait dengan lokasi fasilitas? location?
• Tren saat ini:
̵ Ledakan jumlah layanan daring dan retailer
̵ Fasilitas yang andal dan tangguh
̵ Integrasi model lokasi operasional dan strategis

Optimasi Logistik - Teknik Logistik 4

 INTRODUCTION

APA YANG ANDA

CARI KETIKA
MEMBELI
FASILITAS? LOCATION
https://www.spybunker.com/location-tracker/

Optimasi Logistik - Teknik Logistik 5

 https://www.iconfinder.com/

Optimasi Logistik - Teknik Logistik 6

 THE SUCCESS OR FAILURE OF BOTH PRIVATE
AND PUBLIC SECTOR FACILITIES DEPENDS
IN PART ON THE LOCATIONS CHOSEN FOR THOSE
FACILITIES.

Optimasi Logistik - Teknik Logistik 7

 PENGANTAR SDT

• Mempelajari medote untuk menentukan lokasi

fasilitas yang diinginkan atau optimal.
• Mendefinisikan tujuan yang terukur
• Mengidentifikasi dan menggunakan
algoritma untuk mencari lokasi yang
optimal atau mendekati optimal.

Optimasi Logistik - Teknik Logistik 8

 Model matematis untuk
permasalahan lokasi harus mampu
PERTANYAAN menjawab:
1)Berapa banyak fasilitas yang harus
KUNCI YANG dibangun?
DITUJUKAN 2)Dimana lokasi setiap fasilitas?
UNTUK MODEL 3)Berapa besar ukuran setiap
fasilitas?
LOKASI 4)Berapa kapasitas fasilitas?

Optimasi Logistik - Teknik Logistik 9

 KEY DIMENSIONS OF LOCATION PROBLEMS AND MODELS
NATURE OF THE
1 TOPOGRAPHY 2 INPUTS
3 OTHERS

a) Planar problems vs. a) Static vs. dynamic a) Number of facilities to locate

discrete location models location problem b) Single vs. multiple product models
b) Tree problems vs. b) Deterministic vs. c) Private vs. public sector problems
general graph problems probabilistic model d) Single vs. multiple objective
c) Distance metrics problems and models
e) Elastic vs. inelastic demand
f) Capacitated vs. uncapacitated
facilities
g) Nearest facilities vs. general
demand allocation models
h) Hierarchical vs. single level
models
i) Desirable vs. undesirable facilities

Optimasi Logistik - Teknik Logistik 10

 PLANAR VS. NETWORK VS. DISCRETE LOCATION MODELS
PLANAR LOCATION NETWORK LOCATION DISCRETE LOCATION
MODELS MODELS MODELS

• Demands occur anywhere • Demands and travel between • Allow of the use of arbitrary
on a plane demand sites and facilities distance between nodes
• Demands represented by are assumed to occur only on
spatially distributed a network or graph composed
probability distribution of nodes and links
(demands arising at any • Often, demands assumed
given (X,Y) coordinate occur only at nodes of the
network.

Optimasi Logistik - Teknik Logistik 11

 TREE PROBLEMS VS. GENERAL GRAPH PROBLEMS
TREE
• A network in which there is at
most one path from any node
to any other node
A spanning tree Two trees or forest • A graph with no cycles
• A tree has N nodes, it will
have N-1 links

GRAPH
• Fully connected tree
• Another word for a network
A connected general A complete graph or a
network clique

Optimasi Logistik - Teknik Logistik 12

 DISTANCE METRICS
In planar location problem , typically employed:

MANHATTAN OR RIGHT-ANGLE DISTANCE METRIC

CHARACTERIZED 𝑑 𝑥𝑖 , 𝑦𝑖 ; 𝑥𝑗 , 𝑦𝑗 = 𝑥𝑖 − 𝑥𝑗 + 𝑦𝑖 − 𝑦𝑗

BY THE METHOD EUCLIDEAN OR STRAIGHT LINE DISTANCE METRIC

OF MEASURING 2 2

DISTANCES 𝑑 𝑥𝑖 , 𝑦𝑖 ; 𝑥𝑗 , 𝑦𝑗 = 𝑥𝑖 − 𝑥𝑗 + 𝑦𝑖 − 𝑦𝑗

𝒍𝒑 DISTANCE
1ൗ
𝑝 𝑝 𝑝
𝑑 𝑥𝑖 , 𝑦𝑖 ; 𝑥𝑗 , 𝑦𝑗 = 𝑥𝑖 − 𝑥𝑗 + 𝑦𝑖 − 𝑦𝑗

Where 𝑑 𝑥𝑖 , 𝑦𝑖 ; 𝑥𝑗 , 𝑦𝑗 is the distance between the i th and j th points

Optimasi Logistik - Teknik Logistik 13

 STATIC VS. DYNAMIC LOCATION PROBLEMS
STATIC PROBLEMS DYNAMIC PROBLEMS

• The inputs do not depend on time • The model must explicitly include multiple periods of
• Use a single representative set of inputs time
and solve the problem for a single • Concerned on where to locate facilities and when to
representative period invest new facilities or close existing facilities

DETERMINISTIC VS. PROBABILISTIC MODELS

DETERMINISTIC MODELS PROBABLISTIC MODELS
But we focus on
DETERMINISTIC models
• The inputs certain • The inputs subject to uncertainty
• Example future calls for ambulance services

Optimasi Logistik - Teknik Logistik 14

 NUMBER OF FACILITIES TO LOCATE
EXOGENOUS ENDOGENOUS

• Example: p-median, p-center, and • Example: set covering problem and fixed charge
maximum covering problems facility location problem

SINGLE VS. MULTIPLE-PRODUCT MODELS

SINGLE PRODUCT MODELS MULTIPLE PRODUCT MODELS

• A single homogenous product or service • Different products or services are served y the same
• All demands are identical set of facilities
• Example: critical and noncritical calls

Optimasi Logistik - Teknik Logistik 15

 PRIVATE VS. PUBLIC SECTOR PROBLEMS
PRIVATE SECTOR PROBLEMS PUBLIC SECTOR PROBLEMS

• The investment costs and benefits are
typically measured in monetary units
• The costs and benefits are generally incident
on the same actors: the firm, its management,
and its investors
• Many nonmonetary costs and benefits must also be
considered
• The costs of public sector projects ay be borne by the
public at large
• The benefits are often concentrated on fewer people

SINGLE VS. MULTIPLE-OBJECTIVE PROBLEMS & MODELS

• Most models capture a single objective, however most problems are inherently multi-objective in nature

Optimasi Logistik - Teknik Logistik 16

 ELASTIC VS. INELASTIC DEMAND
ELASTIC DEMAND INELASTIC DEMAND

• Demand is treated depends on the level of • Demand is treated as given and independent
service provided

CAPACITATED VS. UNCAPACITATED FACILITIES

CAPACITATED FACILITIES UNCAPACITATED FACILITIES

• Facilities having limited capacity • Facilities having unlimited capacity

• Examples: standard set covering, maximum covering,
P-median, P-center models

Optimasi Logistik - Teknik Logistik 17

 NEAREST FACILITY VS. GENERAL DEMAND ALLOCATION MODELS
• The allocation of demand to facilities is a critical issue in location modeling
• Often, demands are assigned to the nearest facility provided that facility has the capacity to serve the
demand

HIERARCHICAL VS. SINGLE-LEVEL MODELS

• In many systems, a hierarchy of facilities exists with flows between the facilities that are being located
• the locations of the different facilities interact significantly through the flows between the facilities
• Facility interactions also arise in many facility layout problems

Optimasi Logistik - Teknik Logistik 18

 DESIRABLE VS. UNDESIRABLE FACILITIES
• In most location problems, we are interested in locating desirable facilities. In other words, value increases,
in some sense, the closer the facilities are to the people or goods being served.
• Some facilities, however, are considered undesirable in the sense that most people want them located as far
away as possible.

Optimasi Logistik - Teknik Logistik 23

 A TAXONOMY OF LOCATION MODELS
LOCATION MODELS

Continuous
Analytic Models Network Models Discrete Models
Models

• Strong spatial • Discrete • Demands and • Discrete

assumptions demand sites facilities on a demand and
about demand • Facilities network candidate site
and facility anywhere in locations
locations space • Arbitrary
• Continuous distance metric
optimization & • Integer
numerical • Specialized programming
• Calculus procedures algorithm methods
Optimasi Logistik - Teknik Logistik 20
 Anak Agung Ngurah Perwira Redi Ph.D
Nur Layli Rachmawati, M.T.

LG3102 – 3 sks
Optimasi Logistik
Teknik Logistik
https://www.google.co.id/maps/search/rumah+sakit/@-6.2706941,106.7028021,11.17z
COURSE OUTCOMES

• Mampu memformulasikan permasalahan transportasi

sederhana ke dalam bentuk matematis
• Mampu menyelesaikan model matematis

Optimasi Logistik - Teknik Logistik 22

 FIVE KEY QUESTIONS CONSIDERES IN OPTIMIZATION PROBLEMS

• What do we know?
• What do we need to decide?
• What do we want to achieve?
• What inhibits us from achieving the objective?
• What we are trying to learn?

Optimasi Logistik - Teknik Logistik 23

 THE NOTATION OF LP FORMULA
Sets I,J ( I can be thought of as a set of activities that have to be performed and J as a
set of resources that are required to engage in those activities)
Inputs cj, aij, bi (These are constants that are given in the problem definition and
statement. For example, cj might be the cost of one unit of resource j ∊ J, bi might
be the minimum required level of activity for activity i ∊ I and aij might be the
amount of resource j ∊ J that is required to generate one unit of activity i ∊ I.)
Decision variables Xj (These are the quantities that we are trying to find. In the example above, Xj
would be the amount of resource j ∊ J that we need to consume.)
Surplus variables Si (These variables are used to convert inequality constraints into equality
constraints in one of the forms of the problem that we will discuss. In example
above, Si would represent the extent to which we over-engage in activity i ∊ I.)

Optimasi Logistik - Teknik Logistik 24

 GENERAL TRANSPORTATION MODEL
Inputs
𝑆𝑖 = 𝑡ℎ𝑒 𝑠𝑢𝑝𝑝𝑙𝑦 𝑎𝑡 𝑛𝑜𝑑𝑒 𝑖 ∈ 𝐼
𝐷𝑖 = 𝑡ℎ𝑒 𝑑𝑒𝑚𝑎𝑛𝑑 𝑎𝑡 𝑛𝑜𝑑𝑒 𝑗 ∈ 𝐽
𝑐𝑖𝑗 = 𝑡ℎ𝑒 𝑢𝑛𝑖𝑡 𝑐𝑜𝑠𝑡 𝑜𝑓 𝑠ℎ𝑖𝑝𝑝𝑖𝑛𝑔 𝑓𝑟𝑜𝑚 𝑠𝑢𝑝𝑝𝑙𝑦 𝑛𝑜𝑑𝑒 𝑖
∈ 𝐼 𝑡𝑜 𝑑𝑒𝑚𝑎𝑛𝑑 𝑛𝑜𝑑𝑒𝑗 ∈ 𝐽
Decision Variable
𝑋𝑖𝑗 = 𝑡ℎ𝑒 𝑎𝑚𝑚𝑜𝑢𝑛𝑡 𝑠ℎ𝑖𝑝𝑝𝑒𝑑 𝑓𝑟𝑜𝑚 𝑠𝑢𝑝𝑝𝑙𝑦 𝑛𝑜𝑑𝑒 𝑖
∈ 𝐼 𝑡𝑜 𝑑𝑒𝑚𝑎𝑛𝑑 𝑛𝑜𝑑𝑒 𝑗 ∈ 𝐽

Optimasi Logistik - Teknik Logistik 25

 GENERAL TRANSPORTATION MODEL
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 ෍ ෍ 𝑐𝑖𝑗 𝑋𝑖𝑗
𝑖∈𝐼 𝑗∈𝐽
Subject to
෍ 𝑋𝑖𝑗 ≤ 𝑆𝑖 ∀𝑖 ∈ 𝐼
𝑗∈𝐽

෍ 𝑋𝑖𝑗 ≥ 𝐷𝑗 ∀𝑗 ∈ 𝐽
𝑖∈𝐼
𝑋𝑖𝑗 ≥ 0 ∀𝑖 ∈ 𝐼 ∀𝑗 ∈ 𝐽

Optimasi Logistik - Teknik Logistik 26

FINDING A BFS
• Northwest Corner
• Minimum-Cost Method
• Vogel’s Method

Optimasi Logistik - Teknik Logistik 27

 LATIHAN SOAL

https://www.iconfinder.com/

Optimasi Logistik - Teknik Logistik 28

THE OPTIMALITY
A basic feasible solution is optimal if and only if 𝑐𝑖𝑗 − 𝑢𝑖 − 𝑣𝑗 ≥ 0 for every 𝑖, 𝑗 such that 𝑥𝑖𝑗 is
nonbasic.

Since 𝑐𝑖𝑗 − 𝑢𝑖 − 𝑣𝑗 is required to be zero if 𝑥𝑖𝑗 is basic variable, 𝑢𝑖 and 𝑣𝑗 satisfy the set of
equation:
𝑐𝑖𝑗 = 𝑢𝑖 + 𝑣𝑗

Theorem
In balanced transportation problem with m supply points and n demand points, the cell
corresponding to a set of m+n-1 variables contaion no loop if and only if the m+n-1
variables yield a basic solution.
 How to Pivot in Transporatation
Problem (2)

• Calculate 𝑢𝑖 and 𝑣𝑗
• Calculate 𝑐𝑖𝑗
ҧ = 𝑢𝑖 + 𝑣𝑗 − 𝑐𝑖𝑗
• If 𝑐𝑖𝑗
ҧ ≥ 0, then choose the largest 𝑐𝑖𝑗
ҧ as entering basic variable.
Then, choose the largest 𝑐𝑖𝑗 as entering basic variable.
Find the loop.
Counting the cells on the loop
• else, current basic feasible solution is optimal.

30