PERBANDINGAN ALGORITMA DIJKSTRA DAN ALGORITMA BRANCH AND BOUND DALAM PEMILIHAN LINTASAN TERPENDEK (Studi Kasus Rute Jalan Antar Cabang Kantor Pos Palembang)
Daftar Isi:
- 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