SRI MARGIYANI , NIM. 07610029 (2014) APLIKASI ALGORITMA BRANCH AND BOUND UNTUK OPTIMASI JALUR PEMADAM KEBAKARAN KOTA YOGYAKARTA. Skripsi thesis, UIN SUNAN KALIJAGA.
|
Text ( APLIKASI ALGORITMA BRANCH AND BOUND UNTUK OPTIMASI JALUR PEMADAM KEBAKARAN KOTA YOGYAKARTA )
07610029_bab-i_iv-atau-v_daftar-pustaka(1).pdf Download (1MB) | Preview |
|
![]() |
Text ( APLIKASI ALGORITMA BRANCH AND BOUND UNTUK OPTIMASI JALUR PEMADAM KEBAKARAN KOTA YOGYAKARTA )
07610029_bab-ii_sampai_sebelum-bab-terakhir(1).pdf Restricted to Registered users only Download (3MB) |
Abstract
The cases of fires in Indonesia, especially Yogyakarta from year to year, still show a high rate. This resulted in the loss of high enough for the fire victims. To minimize the fatalities and the material losses in the event of a fire, then the fire department to seek through the shortest path to arrive at the scene of the fire. The purpose of this study is the search for the shortest path of fire path from the office of extinguishers to the location of fire. Shortest path problem of fire path in the abstract can be described by a graph which is an optimization problem in shortest path problem. These problem solvings is to represents map of firefighters in the form of weighted and directed graph, then the problems are solved by using Algorithm of Branch and Bound. The calculation is conducted manually with the distance (in meters) as the weight calculation. Based on calculations by using Algorithm of Branch and Bound for route optimization of fire path in Yogyakarta for 2 sub-districts, namely Umbulharjo District and Pakualaman District, it produces the solutions fot Umbulharjo District: i.e. the firefighter Office - Jln. Ipda Tut Harsono - Jln. Kusumanegara - Jln. Glagahsari – the Office of Umbulharjo District) with a total distance of 5305 meters or 5,035 miles. And the other side in Pakualaman District, it produces the solutions: i.e. the firefighter Office - Jln. Ipda Tut Harsono - Jln. Kusumanegara (towards Jln. Glagahsari) - Jln. Kusumanegara (towards Jln. Cendana) - Jln. Sultan Agung – the Office of Pakualaman District) with a total distance of 5465 m or 5.465 miles.
Item Type: | Thesis (Skripsi) |
---|---|
Additional Information: | Pembimbing : Noor Saif Muhammad Musafi, S.Si., M.Sc. |
Uncontrolled Keywords: | Keywords : Algorithm of Branch and Bound, Shortest Path Problem, route optimization |
Subjects: | Matematika |
Divisions: | Fakultas Sains dan Teknologi > Matematika (S1) |
Depositing User: | Miftahul Ulum [IT Staff] |
Date Deposited: | 10 Nov 2014 08:57 |
Last Modified: | 20 Jan 2016 10:08 |
URI: | http://digilib.uin-suka.ac.id/id/eprint/14452 |
Share this knowledge with your friends :
Actions (login required)
![]() |
View Item |