PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA BRANCH AND BOUND DALAM PEMILIHAN LINTASAN TERPENDEK (Studi Kasus : Rute Jalan Antar Cabang Kantor Pos Palembang)

MANALU, FIRMAN and Sitepu, Robinson and Hanum, Herlina (2018) PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA BRANCH AND BOUND DALAM PEMILIHAN LINTASAN TERPENDEK (Studi Kasus : Rute Jalan Antar Cabang Kantor Pos Palembang). Undergraduate thesis, Sriwijaya University.

[img] Text
RAMA_44201_08111001028_0001125801_00080165_01_front_ref.pdf - Accepted Version
Available under License Creative Commons Public Domain Dedication.

Download (636kB)
[img] Text
RAMA_44201_08111001028_0001125801_00080165_02.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (396kB) | Request a copy
[img] Text
RAMA_44201_08111001028_0001125801_00080165_03.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (89kB) | Request a copy
[img] Text
RAMA_44201_08111001028_0001125801_00080165_04.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (650kB) | Request a copy
[img] Text
RAMA_44201_08111001028_0001125801_00080165_05.pdf - Accepted Version
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (194kB) | Request a copy
[img] Text
RAMA_44201_08111001028_0001125801_00080165_06_ref.pdf - Bibliography
Restricted to Repository staff only
Available under License Creative Commons Public Domain Dedication.

Download (88kB) | Request a copy

Abstract

Distribution goods from headquarter of post office to subdivision of post office can use some methods of shorthest path problem. Dijkstra algorithm and Branch and Bound are applied to solve shortest route from Headquater of post office to each subdivision of post office. The result of Branch and Bound algorithm is shorter than the result of Dijkstra algorithm. The route yield from Branch and Bound algorithm is KPRK Palembang – KPC Sebrang Ulu – KPC Mayor Ruslan – KPC Kapt A Rivai – KPC Jendral Sudirman – KPC Regional III PT.Pos - KPC Lorong RW Bening - KPC Urip Rumoharjo - KPC Kenten - KPRK Palembang with total amount of distance is 36,5 Km. Meanwhile the route yield from Dijkstra algorithm is KPRK Palembang – KPC Sebrang Ulu – KPC Mayor Ruslan – KPC Kapt A Rivai – KPC Jendral Sudirman – KPC Regional III PT.Pos - KPC Lorong RW Bening – KPC Urip Rumoharjo - KPC Kenten - KPRK Palembang with total amount of distance is 41,5 Km

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: Shortest Path, Post Office, Dijkstra Algorithm, Branch and Bound Algorithm
Subjects: Q Science > QA Mathematics > QA1-939 Mathematics
Q Science > QA Mathematics > QA150-272.5 Algebra
Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions: 08-Faculty of Mathematics and Natural Science > 44201-Mathematics (S1)
Depositing User: Mrs Dies Meirita Sari
Date Deposited: 05 Aug 2019 05:03
Last Modified: 05 Aug 2019 05:03
URI: http://repository.unsri.ac.id/id/eprint/2196

Actions (login required)

View Item View Item