Oleh :

Lilla yuniar s 115020201111022

Lilis suindrawati 115020201111056

Transport Decisions
Transportasi
Keputusan dalam
aktivitas logistik
Pemilihan alat transportasi
Rute pengangkutan
Penjadwalan kendaraan
Gabungan pengiriman
Transport Service Selection
Basic Cost Trade-Offs


Example Finished goods are to be shipped from a plant
inventory to a warehouse inventory some distance away. The
expected volume to be shipped in a year is 1,200,000 unit.
The product is worth $25 per unit. and the plant and carrying
costs are 30% per year.
Other data are:


Transport
choice


Rate,
$/ unit.

Transit
time,
days


Shipment
size, unit.

Rail

0.11

25

100,000

Truck

0.20

13

40,000

Air

0.88

1 16,000

Basick Cost Trade-Offs (Contd)
Cost
type
Computation

Rail Truck Air
Trans-
portation
RD .11(1,200,000)
= $132,000
.20(1,200,000)
= $240,000
.88(1,200,000)
= $1,056,000
In-transit
inventory
ICDT
365
[.30(25)

1,200,000(25)]/365
= $616,438
[.30(25)

1,200,000(13)]/365
= $320,548
[.30(25)

1,200,000(1)]/365
= $24,658
Plant
inventory
ICQ
2
[.30(25)

100,000]/2
= $375,000
[.30(25)

40,000]/2
= $150,000
[.30(25)

16,000]/2
= $60,000
Field
inventory
IC ' Q
2
[.30(25.11)

100,000]/2
= $376,650
[.30(25.20)

40,000]/2
= $151,200
[.30(25.88)

16,000]/2
= $62,112




Totals
$1,500,088 $ 861,748 $1,706,770
Improved service
Competitive Considerations
Example An appliance manufactured located in pittsburgh
purcahases 3,000 cases of plastic part valued at $100 per case from
two suppiers. Purcahases are currently divided equally between the
suppliers. Suppliers A would like to consider whether it would be
beneficial to switch from rail to air or truck modes.





Supplier As choice can simply be made based on the potential profits to be
received.

Transport mode Transport rate Delivery time
Rail $2.50/case 7 days
Truck $6.00/case 4 days
Air $10.35/case 2 days
Transport
mode
Cases sold Gross profit - Transport cost = Net profit
Rail 1.500 $ 30.000 - $ 3.750 = $. 26.250
Truck 1.950 $ 39.000 - $ 11.700 = $ 27.300
Air 2.250 $ 45.000 - $ 23.287,50 = $ 21.712,50
Origin
Amarillo
Oklahoma
City
Destination
Fort Worth
A
B
E
I
C
D
G
F
H
J
90 minutes
84 84
138
348
156
48
132
150
126
132
120
66
126
48
60
Note : All link times are in minutes
90
Vehicle Routing
Separate and Single Origin and Destination Points

S
h
o
r
t
e
s
t

R
o
u
t
e

M
e
t
h
o
d





Step
Solved
Nodes
Directly
Connected
to Unsolved
Nodes


Its Closest
Connected
Unsolved
Node




Total Cost
Involved



nth
Nearest
Node



Its
Minimu
m Cost




Its Last
Connection
a

1 A B 90 B 90 AB
*

2 A C 138 C 138 AC
B C 90+66=156
3 A D 348
B E 90+84=174 E 174 BE
*

C F 138+90=228
4 A D 348
C F 138+90=228 F 228 CF
E I 174+84=258
5 A D 348
C D 138+156=294
E I 174+84=258 I 258 EI
*

F H 228+60=288
6 A D 348
C D 138+156=294
F H 228+60= 288 H 288 FH
I J 258+126=384
7 A D 348
C D 138+156=294 D 294 CD
F G 288+132=360
H G 288+48=336
I J 258+126=384
8 H J 288+126=414
I J 258+126=384 J 384 IJ
*


Tabulation of computational steps for the shortest route method
TRANLP problem setup
Solution
Multiple Origin and Destination Points
Plant 1
Requirements = 600
Plant 2
Requirements = 500
Plant 3
Requirements = 300
Supplier A
Supply 400
Supplier C
Supply 500
Supplier B
Supply 700
4
a
7
6
5
5
5
9
5
8
a

The transportation rate in $ per ton for an optimal routing between supplier A and plant 1
.
Total biaya minimum adalah

Pabrik 1 (4x400) + (5x200) = 2.600
Pabrik 1 (5x200) + (5x300) = 2.500
Pabrik 1 (5x300) = 1.500
$ 6.600
.
Points are Spatially Related
D D
Depot Depot
(a) Poor routing--
paths cross
(b) Good routing--
no paths cross




Good routes can be found by forming a route pattern
where the paths do not cross

However, Mathematically, a complex problem to solve
efficiently.


0 1 2 3 4 5 6 7 8
8
7
6
5
4
3
2
1
0
X coordinates
1
2
3
19
11
12
13
14
15
16
17
18
4
5
6
7
8
9
10
20
D
Y coordinates
0 1 2 3 4 5 6 7 8
8
7
6
5
4
3
2
1
0
X coordinates
1
2
3
19
11
12
13
14
15
16
17
18
4
5
6
7
8
9
10
20
D
Y coordinates
(a) Location of beverage accounts
and distribution center (D) with
grid overlay
(b) Suggested routing pattern
Points are Spatially Related (Contd)
Points Are Not Spatially Related
The total time to make the round-trip is 156 minutes
Sweep Method for VRP
Example A trucking company has
10,000-unit vans for merchandise
pickup to be consolidated into larger
loads for moving over long distances. A
days pickups are shown in the figure
below. How should the routes be
designed for minimal total travel
distance?
7-14
Geographical
region
Depot
1,000
2,000
3,000
2,000
4,000
2,000
3,000
3,000
1,000
2,000
2,000
2,000
Pickup
points
Stop Volume and Location
7-15
Sweep direction
is arbitrary
Depot
1,000
2,000
3,000
2,000
4,000
2,000
3,000
3,000
1,000
2,000
2,000
2,000
Route #1
10,000 units
Route #2
9,000 units
Route #3
8,000 units

Sweep Method Solution
CR (2004) Prentice Hall, Inc.
The Savings Method for VRP
Depot Depot
(a) Initial routing
Route distance = d
0,A
+d
A,0
+d
0,B
+ d
B,0
(b) Combining two stops on a route
Route distance = d
0,A
+d
A,B
+d
B,0
A
B
d
A,0
d
0,A
d
0,B
d
B,0
A
B d
B,0
d
0,A
d
A,B
Stop
Stop
0
0
Savings is better than Sweep
methodhas lower average error
7-17
Savings Method Observation
The points that offer the greatest
savings when combined on the
same route are those that are
farthest from the depot and that are
closest to each other.
This is a good principle
for constructing multiple-stop
routes
CR (2004) Prentice Hall, Inc.
Route Sequencing in VRP
8 9 10 11 12 1 2 3 4 5 6
Route #1 Route #10
AM PM
Route #6
Route #9 Route #4
Route #5 Route #8
Route #2 Route #7
Route #3
Truck #1
Truck #2
Truck #3
Truck #4
Truck #5
Minimize number of trucks
by maximizing number of routes
handled by a single truck
CR (2004) Prentice Hall, Inc.
7-27
7-19
Freight Consolidation
Combine small shipments into larger
ones
A problem of balancing cost savings
against customer service reductions
An important area for cost reduction in
many firms
Based on the rate-shipment size
relationship for for-hire carriers
CR (2004) Prentice Hall, Inc.
7-20
Freight Consolidation Analysis
CR (2004) Prentice Hall, Inc.
Suppose we have the following orders for the
next three days.
Consider shipping these orders each day or
consolidating them into one shipment. Suppose that
we know the transport rates.

Note: Rates from an interstate tariff
From:
Ft Worth Day 1 Day 2 Day 3
To: Topeka 5,000 lb. 25,000 lb. 18,000 lb.
Kansas City 7,000 12,000 21,000
Wichita 42,000 38,000 61,000
Freight Consolidation Analysis (Contd)
Day 1 Day 2
Rate x volume = cost Rate x volume = cost
Topeka 3.42 x 50 = $171.00 1.14 x 250 = $285.00
Kansas City 3.60 x 70 = 252.00 1.44 x 120 = 172.80
Wichita 0.68 x 420 = 285.60 0.68 x 400
a
= 272.00
Total $708.60 Total $729.80
a
Ship 380 cwt., as if full truckload of 400 cwt.

Day 3
Totals

Rate x volume = cost
Topeka 1.36 x 180 = $244.80 $700.80
Kansas City 1.20 x 210 = 252.00 676.80
Wichita 0.68 x 610 =
414.80
972.40
Total $911.60 $2,350.00
Separate shipments
CR (2004) Prentice Hall, Inc.
7-30
Freight Consolidation Analysis (Contd)
a
480 = 50 + 250 + 180

Computing transport cost for one combined, three-day
shipment
Cheaper, but what about
the service effects of holding
early orders for a longer time
to accumulate larger shipment
sizes?
Consolidated shipment
Day 3
Rate x volume = cost
Topeka 0.82 x 480
a
= $393.60
Kansas City 0.86 x 400 = 344.00
Wichita 0.68 x 1410 = 958.80
Total $1,696.40
CR (2004) Prentice Hall, Inc. 7-31