Harun al-Rasyid LUBIS

Fakultas Teknik Sipil dan Lingkungan ITB
SI- 5141 Perencanaan & Pemodelan Transportasi
SJ-5122 Perencanaan Transportasi & Pengembangan
Pemilihan rute-2
„ Pengantar
„ Kriteria Pemilihan Rute
„ Teknik / Metoda
„ Prinsip Perutean
„ Penggolongan
„ Furmulasi
„ Komponen Pemodelan
2
3
Proses Pembebanan
MATRIX ASAL
TUJUAN AWAL
BANGKITAN /
TARIKAN
UPDATE
MATRIKS ASAL
TUJUAN
JARINGAN
ASSIGNMENT
(PEMBEBANAN)
VOLUME ;
BIAYA TRANSPORT
PEMILIHAN RUTE
4
Penggolongan Trip Assignment
Apakah efek kesalahpahaman disertakan ?

Tidak ya
Tidak 1. All-or-Nothing 2. Stochastic Murni (SM)
Apakah Kemacetan
disertakan ? ya
3. Wardrop Equilibrium /
Deterministic User
Equilibrium (DUE)
2. Stochastic User
Equilibrium (SUE)

5
UE ROUTING FORMULATION
(1.1 a)
subject to
(1.1b)
(1.1c)
where:
T
ij
= trip demand from origin i to destination j.
T
pij
= trip assigned to path p of origin i and destination j.
c
a
(v) = cost-flow curve on link a
g
ij
-1
= inverse demand function for origin i to destination j.
V
a
= volume or flow assigned to link a.
The relationship between link flow, V
a
, and path flow, T
pij
, is expressed as:
(1.1d)
where
¯¯
í
¯
í
÷
÷ ÷
i j
T
0
1
ij
a
V
0
a pij
ij a
dy ) y ( g dv ) v ( c } T { Z Min
T
pij
> 0
T T
pij
pij
ij ¯
=
V T
a pij
a
pij
pij
=
¯
o
o
pij
a
if link a is on path p from i to j
otherwise
=
¦
´
¹
1
0
6
SO ROUTING FORMULATION
The system optimal, in which the total transportation cost is a
minimum, can be stated as follows.
(2.1)
subject to eqs. (1.1b) and (1.1c). This may also be formulated by
replacing the link cost function c
a
(v) with a marginal cost function:
(2.2)
where c'
a
(v) is the first derivative of the link cost function with
respect to the flow on that link.
Min Z T v c v
pij a a
a
{ } ( ) ÷
¯
C v c v v c v
a a a a
' ( ) ( ) ' ( ) = +
7
Solving for Equilibrium
(AoN, Capacity Restraint, Iterative Assignment, F-W)
i/j 1 2 3
1 - 10 5
2 10 - 7
3 5 7 -
Trip matrix (Demand)
Hubungan biaya ± arus (link cost function) :
AB, BC, AC : c = 5 + v
AD, BD, CD : c = 4 + 2v
2
1 3
B
A C
D
D
¯
¯
÷
=
ij
ij ij
pij
ij pij pij
C T
C C T
*
*
.
) ( .
o
Tingkat
Konvergensi
(equilibrium)
j ke i dari terpendek rute di biaya C
ij
=
*
8
(a) All- or - Nothing (a-o-n) :
Rute (terpendek) terpilih A-B A-C B-C
„ Ruas AB AC BC AD BD CD
Asumsi 5 5 5 4 4 4
Ongkos
Volume 10 5 7 0 0 0
Ongkos Akhir 15 10 12 4 4 4
Rute min akhir : A-D-B : 8
A-D-C : 8
B-D-C : 8
% 61
8 * 7 8 * 5 8 * 10
) 8 12 ( * 7 ) 8 10 ( * 5 ) 8 15 ( * 10
=
+ +
÷ + ÷ + ÷
= o
61% tidak melalui rute terpendek
atau 61% menyimpang dari equilibrium
2
1 3
B
A C
D
D
10
5
7
KONVERGENSI:
9
Modifikasi A-o-n = A-o-n dengan capacity restraint
(b) Dengan perubahan "kasar"
Biaya yang dipakai:Ongkos akhir pd pembebanan A-o-N (a)
RUAS: AB AC BC AD BD CD
Asumsi Ongkos 15 10 12 4 4 4
Volume 0 0 0 15 17 12
Ongkos Akhir 5 5 5 34 38 28
Rute akhir terpendek
AB : 5
AC : 5
BC : 5
( ) ( ) ( )
% 1269
5 * 7 5 * 5 5 * 10
5 63 * 7 5 62 * 5 5 72 * 10
=
+ +
÷ + ÷ + ÷
= o Konvergensi :
2
1 3
B
A C
D
D
15 12
17
10
(c) Dengan perubahan halus :
Biaya yang dipakai : rata-rata ongkos awal (asumsi) dan ongkos akhir
pada A-o-n
AB AC BC AD BD CD
Asumsi ongkos 10 7.5 8.5 4 4 4
Volume 0 5 0 10 17 7
Ongkos akhir 5 10 5 24 38 18
Rute akhir terpendek AB : 5
AC : 10 atau AB-BC
BC : 5
( ) ( ) ( )
% 687
5 . 7 10 . 5 5 . 10
5 56 7 5 62 10 10 10 5
=
+ +
÷ + ÷ + ÷
= o
2
1 3
B
A C
D
D
10 7
17
5
0 0
11
(d) Interasi Sederhana
(Metoda Rata2 Berulang /Method of Successive Averages)
Kombinasikan A-O-N pada pembebanan (n) dan (b) secara merata
diperoleh : ì = 0.5
Rute minimum akhir :
AB: 10
AC: 7.5
BC: 8.5
AB AC BC AD BD CD
ì x V
(a)
5.0 2.5 3.5 0 0 0
(1-ì) x V
(b)
0 0 0 7.5 8.5 6.0
E 5 2.5 3.5 7.5 8.5 6.0
Ongkos Akhir 10 7.5 8.5 19 21 16

% 162
5 . 8 * 7 5 . 7 * 5 10 * 10
) 5 . 8 37 ( 5 . 3 ) 5 . 7 35 ( 5 . 3 ) 10 40 ( 5 0 0 0
=
+ +
÷ + ÷ + ÷ + + +
= o
RUAS
2
1 3
B
A C
D
D
7,5 6
8,5
2,5
5 3,5
12
Iterative Assignment
Langkah 0 ³,QLVLDOLVDVL´
Terapkan A-O-N berdasarkan
Diperoleh Set n = 1
Langkah 1 ³8SGDWH´
Langkah 2 µ¶3HPEHEDQDQ¶¶
Terapkan, A-O-N berdasarkan
diperoleh
Langkah 3 µ¶3HQJKDOXVDQ¶¶
Pilih ì (=0.5) (=1/n)
Set n = n+1
Ulangi langkah (1) s/d (3) sampai Convergence
a c c
a a
¬ = ) 0 (
0
} {
0
a
v
a v c c
n
a a
n
a
¬ =
÷
) (
1
} {
n
a
c
) ( } { sementara arus F
n
a
n
a
n
a
n
a
F v v ì ì + ÷ =
÷1
) 1 (
13
Contoh Iterative Assignment
1
2
3
4
A
E
B
F
C
D
Dari/ke 3 4
1 800 400
2 400 800
Fungsi biaya ± arus = Ca (Va)
AB : c = 20 + ( V
2
x 10
-4
)
DB
AC c = 4 + (V
2
x 10
-4
)
DF
EC
CD : c = 4 + (V
2
x 10
-4
) / 4
EF : c= 20 + (V
2
x 10
±4
)
Diminta :
Hasil pembebanan yang mendekati
prinsip WARDROP
(pakai Interative Assignment ì = 0.5)
14
Jawab :
Step (0) Permulaan :
Terapkan a-o-n berdasarkan c(0) ; v = 0
Hasil Alokasi arus ÷ {Va0}
1
2
3
4
A
E
B
F
C D
4
4
4
4
20
4
20
c(0) :
15
„ {Va0}
1
2
3
4
A
E
B
F
C D
800
400
400
800
800
400
400
800
800
400
400
800
0
0
¯VAC = 1200 : ¯VDB = 1200
¯VCD = 2400 : ¯VDF = 1200
¯VEC = 1200 : ¯VAB = ¯VEF = o
÷ sebut n = 1
16
Step (1): Update { C
a
1
}= { Ca(Va
0
)}:
1
2
3
4
A
E
B
F
C D
148
148
148
148
20
148
20

Sign up to vote on this title
UsefulNot useful