Terdapat jaringan jalan sebagai berikut :

Tentukan rute angkutan umumnya, jika:

1 Rute tidak memutar

2 Antar rute tidak boleh saling bersinggungan

3 Waktu tempuh rute maksimal = 40% dari shortest path

PENYELESAIAN :

1) Rute tidak memutar

NO NODE YANG DILALUI (RUTE WAKTU PERJALANAN

RUTE BERLAWANAN) (MENIT)
1 1-2 (2-1) 5
2 1-3 (3-1) 15
3 1-2-3 (3-2-1) 25
4 1-2-4 (4-2-1) 25
5 1-2-5 (5-2-1) 15
6 1-2-3-5 (5-3-2-1) 45
7 1-2-3-6 (6-3-2-1) 55
8 1-2-3-5-4 (4-5-3-2-1) 70
9 1-2-3-5-7 (7-5-3-2-1) 55
10 1-2-3-5-8 (8-5-3-2-1) 70
11 1-2-3-5-6 (6-5-3-2-1) 80
12 1-2-3-6-5 (5-6-3-2-1) 90
13 1-2-3-6-8 (8-6-3-2-1) 85
14 1-2-4-5 (5-4-2-1) 50
15 1-2-4-7 (7-4-2-1) 50
16 1-2-4-5-3 (3-5-4-2-1) 70
17 1-2-4-5-6 (6-5-4-2-1) 85
18 1-2-4-5-7 (7-5-4-2-1) 60
19 1-2-4-5-8 (8-5-4-2-1) 75
20 1-2-4-7-8 (8-7-4-2-1) 55
21 1-2-5-3 (3-5-2-1) 35
22 1-2-5-6 (6-5-2-1) 50
23 1-2-5-8 (8-5-2-1) 40
24 1-2-5-7 (7-5-2-1) 25
25 1-2-5-4 (4-5-2-1) 40
26 1-2-5-3-6 (6-3-5-2-1) 65
27 1-2-5-6-3 (3-6-5-2-1) 80
28 1-2-5-6-8 (8-6-5-2-1) 80
29 1-2-5-8-6 (6-8-5-2-1) 70
30 1-2-5-8-7 (7-8-5-2-1) 45
31 1-2-5-7-8 (8-7-5-2-1) 30
32 1-2-5-7-4 (4-7-5-2-1) 50
33 1-2-5-4-7 (7-4-5-2-1) 65
34 1-3-2 (2-3-1) 25
35 1-3-5 (5-3-1) 35
36 1-3-6 (6-3-1) 45
37 1-3-2-4 (4-2-3-1) 45
38 1-3-2-5 (5-2-3-1) 35
39 1-3-2-4-7 (7-4-2-3-1) 70
40 1-3-2-4-5 (5-4-2-3-1) 70
41 1-3-2-5-4 (4-5-2-3-1) 60
42 1-3-2-5-7 (7-5-2-3-1) 45
43 1-3-2-5-8 (8-5-2-3-1) 60
44 1-3-2-5-6 (6-5-2-3-1) 70
45 1-3-5-2 (2-5-3-1) 45
46 1-3-5-4 (4-5-3-1) 60
47 1-3-5-7 (7-5-3-1) 45
48 1-3-5-8 (8-5-3-1) 60
49 1-3-5-6 (6-5-3-1) 70
50 1-3-5-2-4 (4-2-5-3-1) 65
51 1-3-5-4-2 (2-4-5-3-1) 80
52 1-3-5-4-7 (7-4-5-3-1) 85
53 1-3-5-7-4 (4-7-5-3-1) 70
54 1-3-5-7-8 (8-7-5-3-1) 50
55 1-3-5-8-7 (7-8-5-3-1) 65
56 1-3-5-8-6 (6-8-5-3-1) 90
 57 1-3-5-6-8 (8-6-5-3-1) 100
58 1-3-6-5 (5-6-3-1) 80
59 1-3-6-8 (8-6-3-1) 75
60 1-3-6-5-2 (2-5-6-3-1) 90
61 1-3-6-5-4 (4-5-6-3-1) 105
62 1-3-6-5-7 (7-5-6-3-1) 90
63 1-3-6-5-8 (8-5-6-3-1) 105
64 1-3-6-8-5 (5-8-6-3-1) 100
65 1-3-6-8-7 (7-8-6-3-1) 80
66 1-2-4-7-8-6-3-1 (-) 130
67 1-2-4-5-7-8-6-3-1 (-) 140
68 1-2-4-5-3-1 (-) 85
69 1-2-4-7-5-3-1 (-) 95
70 1-2-5-7-8-6-3-1 (-) 105
71 1-2-5-8-7-4-2-1 (-) 95
72 1-2-5-8-6-3-1 (-) 115
73 1-2-5-6-3-1 (-) 95
74 1-2-5-3-1(-) 50
75 1-3-6-8-7-4-2-1 (-) 130
76 1-3-6-8-7-4-5-3 (-) 150
77 1-3-6-8-7-5-3 (-) 110
78 1-3-5-2-1 (-) 50
79 1-3-5-8-6-3-1 (-) 125
80 1-3-5-2-1 (-) 50
81 1-3-2-1 (-) 40

Syarat 2 dan 3
Dipilih rute 31 dan rute 36 agar semua Syarat 2 dan 3 terpenuhi
NO NODE YANG DILALUI (RUTE WAKTU PERJALANAN
RUTE BERLAWANAN) (MENIT)
 31 1-2-5-7-8 (8-7-5-2-1) 30
36 1-3-6 (6-3-1) 45

Rute 1-2 1-3 1-4 1-5 1-6 1-7 1-8

Rute tercepat 1-2 1-3 1-2-4 1-2-5 1-3-6 1-2-5-7 1-2-5-
(shortest path) 7-8
Waktu perjalanan 5 15 25 15 45 25 30
pada rute tercepat
rute yang mungkin 31 (1- 36 (1- - 31 (1- 36 (1- 31(1-2- 31 (1-
(node yang dilalui) 2-5-7- 3-6) 2-5-7- 3-6) 5-7-8) 2-5-7-
8) 8) 8)
Waktu tempuh dari 31(5) 36(15) - 31(15) 36(45) 31(25) 31(30)
rute yang mungkin
Persentase Waktu 31(0%) 36(0%) - 31(0%) 36(0%) 31(0%) 31(0%)
tempuh dari
shortest path