Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Scientific Journal of Informatics

Determination of The Shortest Route Based on BFS Algorithm for Purpose to Disaster Evacuation Shelter Sularno, Sularno; Mulya, Dio Prima; Astri, Renitra; mulya, Dwiki
Scientific Journal of Informatics Vol 8, No 1 (2021): May 2021
Publisher : Universitas Negeri Semarang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15294/sji.v8i1.27863

Abstract

Purus village in Padang City which has an area of 0.86 km2 consisting of 8 RW and 28 RT has a population of 8,075 people with a density of 11,875. As a result, people are always haunted by fear and always feel threatened if an earthquake occurs. If an earthquake and tsunami occur, what the community needs at that time is information about a safe zone that can be reached to save themselves and their families. For this reason, there needs to be an educational process for the community so that they have a culture of disaster awareness in the form of a system that is able to inform the community where the closest safe zone they can reach is the route they must take when a disaster strikes so that it can provide a sense of security because of safety guarantees. This study aims to determine the shortest route that can be taken by the user (community) during a disaster to reduce the risk of a greater number of victims by using the Breadth first search algorithm which is integrated into a web-based GIS application. By determining the starting point which is the user's position when the disaster occurs, and then determining the end point which is the location of the closest shelter, it will be possible to calculate the shortest distance that can be reached by the user at that time. The method chosen in this study is a waterfall because each step of the research carried out must be sequential and structured to avoid the risk of errors in each sequence of processes carried out. The results of this study can be proven by doing manual calculations to determine the shortest distance which will later be compared with the results of applications that have been designed using the BFS algorithm.
Co-Authors Ade Sumiahadi Ade Sumiahadi, Ade Adinda Vania Aghi Caesar Liandro Ahmad Hidayawan, Ahmad Alex Muhamad Kasiba Alif Pagar Alam Andre Prasetyo Annisa Yola Syafitri Asyih Zatayu Aurora, Keisha Azya Maharani Oktaputri Bagas Wahyu Adhi, Bagas Wahyu Cantika Erina Putri Chia Ramona Fitri Chintya, Cindy Geraldine Della DelfiYanti Dhea Tri Indah Zebua Dhea vega Anandha Dhini Rahmawati Dio aguswantoro Dirgahani Putri Divana Yuliant Elsa R. Sigalingging Endang Ulfa Finarsih Erlina Rahmayuni, Erlina Faisal Farhan Fachrurrazi Fausiah Yasmin Firdinal Juliandre Fitrah Ramadhani Fitri Fadila Gharsa Syahputra Ghinaa Safitri Gustiana Putri Helfi Gustia IRFAN EFENDI Janeza Revel Jenal Mutaqin, Dadang Julia Anggraini Luthfi Hanif Al Hadi M.Harif Ramadhan Maruf, Mohammad Ainul Maulana, Ragil Mia Nurlita Muhammad Danial Muhammad Faridz Azizi Muhammad Rakha Mulya, Dio Prima mulya, Dwiki Nafisah Altin Naghea Zuella Natasya Felisha Nori Sahrun Nova Dilastri Novadilastri Novadilatri Novi Ardi Winata Novita Ramadhani Nurjanah Ode Rintik Segara Paldi Saputra Pandra Maitul Akbar Pratiwi Kartika Sari Putri Dwi Julita Rahmawati Zamri Raihana Mardhiyyah Reghina Syakhila Resma Yanti, Tira Reza Sugara Amri Riesa, Rafidola Mareta Rita Tri Puspitasari, Rita Tri Rosdiana Sarli Amri TP Sholehuddin Sri Imawati Suci Rahmadayani Suci Rahmawati Sukrianto Surya Adi Nugraha Susan Olivia Tanjung, Dian Diani Tarishah Indah Ashira Tiara Salsabila Olivia Wifrandi, Arild Sadewo Yeni Nurazizah Yolanda Aprilia S Yolanda Irma Julia Putri Yudha Ananda Yukarie Ayu Wulandari Yukarie Ayu Wulandari, Yukarie Ayu Ziza Fazira