Nama : Muhammad Dwi Alfandi Banurea

NIM : 180403164
Kelas : E (Riset Operasi 2)
TUGAS ALGORITMA DJIKSTRA DARI GLUGUR KE USU

1. Node 1 : Jl. KL Yos Sudarso (BNI Glugur)

2. Node 2 : Jl. Putri Hijau (Gedung Graha Niaga)
3. Node 3 : Jl. Adam Malik (Politeknik Kesehatan YRSU Dr Rusdi)
4. Node 4 : Jl. Merak Jingga (Simpang tiga merak jinga/rel kereta)
5. Node 5 : Jl. Guru Patimpus (Simpang Milo Karaoke/Bundaran SIB)
6. Node 6 : Jl. Jendral Gatot Subroto (Bundaran SIB)
7. Node 7 : Jl. Iskandar Muda (Simpang Restoran Simpang Raya)
8. Node 8 : Jl. Nibung (Simpang Nibung)
9. Node 9 : Jl. Gajah Mada (Simpang KFC)
10. Node 10 : Jl, S. Parman (Simpang Restoran Mntra Manado)
11. Node 11 : Jl. Pattimura (Simpang Gelato Café)
12. Node 12 : Jl. Jamin Ginting (Lampu Merah Simpang STMIK Pelita Nusantara)
13. Node 13 : Jl. Jamin Ginting (Simpang Lampu Merah Kedutaan Belgia)
14. Node 14 : Jl. Dr. Mansyur (Universitas Sumatera Utara)
Titik awal berada di Node 1 (Bank BNI) cabang glugur menuju ke titik tujuan Node 14
(Universitas Sumatera Utara).
Satuan Jarak yang digunakan adalah meter (m)
Iterasi 0
Node Label Status
1 [0,-] Permanent

Iterasi 1
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [1500,1] Temporary

Iterasi 2
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [1500,1] Temporary
6 [1500+1800,3] Temporary
7 [1500+2500,3] Temporary

Iterasi 3
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [600,1] Permanent
6 [3300,3] Permanent
7 [1500+2500,3] Temporary
8 [3300+500,6] Temporary
7 [3300+400,6] Temporary

Iterasi 4
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [600,1] Permanent
6 [3300,3] Permanent
7 [1500+2500,3] Temporary
8 [3300+500,6] Temporary
7 [3700,6] Permanent
12 [3700+2000,7] Temporary
Iterasi 5
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [600,1] Permanent
6 [3300,3] Permanent
7 [1500+2500,3] Temporary
8 [3300+500,6] Temporary
7 [3700,6] Permanent
12 [5700,7] Permanent
14 [5700+600,12] Temporary

Iterasi 6
Node Label Status
1 [0,-] Permanent
2 [2000,1] Temporary
3 [600,1] Permanent
6 [3300,3] Permanent
7 [1500+2500,3] Temporary
8 [3300+500,6] Temporary
7 [3700,6] Permanent
12 [5700,7] Permanent
14 [5700+600,12] Permanent

Solusi Akhir
Node Label Status
1 [0,-] Permanent
3 [600,1] Permanent
6 [3300,3] Permanent
7 [3700,6] Permanent
12 [5700,7] Permanent
14 [6300,12] Permanent

Kesimpulan :
Jalur terpendek dari Node 1 (BNI Glugur) menuju Node 14 (Universitas Sumatera Utara)
adalah:

(14)[6300,12](12)[5700,7](7)[3700,6](6)[3300,3](3)[600,1]
(1)[0,-]

Rute : 14-12-7-6-3-1
Rute :

BNI Glugur  Jl. Adam Malik Jl. Jendral Gatot Subroto  Jl. Iskandar Muda Jl. Jamin
Ginting (Simpang Lampu Merah STMIK Pelita Nusantara)  Jl. Dr. Mansyur (Universitas
Sumatera Utara)

Total Jarak : 6300 meter

TUGAS LATIHAN
1. Minimum Spanning Tree
 Gambar Ilustrasi disederhakan menjadi :

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300

Misalkan titik awal adalah SE

Iterasi 1

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300

Iterasi 2

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300
Iterasi 3

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300

Iterasi 4

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300

Iterasi 5

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300
Iterasi 6

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
780
LA 2600
DC

1400
DA 1300

Iterasi 7

NY
800
2000
SE

CH
1000
1300
DE 200
1100

2000 900
2600 780
LA
DC

1400
DA 1300

Minimum Spanning Tree

NY

SE

CH
1300
DE 200
1100

900
780
LA
DC

DA
Total Minimum Spanning Tree :
= 1100 + 1300 + 780 + 900 + 800 + 200
= 5080

1. Algoritma Djikstra

Iterasi 0
Node Label Status
1 [0,-] Permanent

Iterasi 1
Node Label Status
1 [0,-] Permanent
2 [5,1] Temporary
3 [1,1] Temporary

Iterasi 2
Node Label Status
1 [0,-] Permanent
2 [5,1] Temporary
3 [1,1] Permanent
2 [1+2,3] Temporary
4 [1+6,3] Temporary
5 [1+7,3] Temporary

Iterasi 3
Node Label Status
 1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
4 [1+6,3] Temporary
5 [1+7,3] Temporary
4 [3+7,2] Temporary
5 [3+1,2] Temporary
6 [3+6,2] Temporary

Iterasi 4
Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
4 [1+6,3] Temporary
4 [3+7,2] Temporary
5 [4,2] Permanent
6 [3+6,2] Temporary
4 [4+3,5] Temporary
6 [4+5,5] Temporary
7 [4+9,5] Temporary

Iterasi 5
Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
[7,3]
4 Permanent
[7,5]
5 [4,2] Permanent
6 [3+6,2] Temporary
6 [4+5,5] Temporary
7 [4+9,5] Temporary
6 [7+4,4] Temporary
7 [7+6,4] Temporary

Iterasi 6
Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
[7,3]
4 Permanent
[7,5]
5 [4,2] Permanent
[9,2]
6 Permanent
[9,5]
 7 [4+9,5] Temporary
7 [7+6,4] Temporary
7 [9+2,6] Temporary

Solusi Akhir
Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
[7,3]
4 Permanent
[7,5]
5 [4,2] Permanent
[9,2]
6 Permanent
[9,5]
7 [11,6] Permanent

Solusi Akhir (Alternatif 1)

Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
[7,3]
4 Permanent
[7,5]
5 [4,2] Permanent
[9,2]
6 Permanent
[9,5]
7 [11,6] Permanent

Solusi Akhir (Alternatif 2)

Node Label Status
1 [0,-] Permanent
3 [1,1] Permanent
2 [3,3] Permanent
[7,3]
4 Permanent
[7,5]
5 [4,2] Permanent
[9,2]
6 Permanent
[9,5]
7 [11,6] Permanent

Kesimpulan :
Jalur terpendek dari Node 1 menuju ke Node 7 ditempuh dengan 2 alternatif cara:
Alternatif 1

(7)[11,6](6)[9,5](5)[4,2](2)[3,3](3)[1,1](1)[0,-]

Rute : 1-3-2-5-6-7

Total = 11

Alternatif 2

(7)[11,6](6)[9,2](2)[3,3](3)[1,1](1)[0,-]

Rute : 1-3-2-6-7

Total = 11