Article Per Year (5 Year)
p-Index From 2019 - 2024
0.562
P-Index
This Author published in this journals
All Journal Scientific Journal of Informatics
mulya, Dwiki
Unknown Affiliation
Computer Science & IT

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
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.
Geographical Information System of Bus and Travel Counter in Padang City Using BFS Method Based on Mobile Web Sularno, Sularno; Astri, Renita; Anggraini, Putri; Prima Mulya, Dio; Mulya, Dwiki
Scientific Journal of Informatics Vol 8, No 2 (2021): November 2021
Publisher : Universitas Negeri Semarang

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

Abstract

Purpose: One of the main objectives of the research is the BFS (Breadth-First Search) algorithm method in the search for nearby bus and travel counters using GPS found on each device used in the search process. Each smartphone produces a different coordinate point with an average distance difference of 30.2 meters to the hardware coordinate point. Each GPS embedded in the smartphone will process the data according to the location conditions of the user's point of existence. The methodology for system development is a standard process for a team of developers to connect all the steps needed in analyzing, designing, implementing, and maintaining information systems. Methods: The methodology becomes a guideline in system development activities in SDLC. The SDLC model used in this study is the WaterFall Model. Result: The results of this study are expected to facilitate the public in booking tickets and to find the nearest location from the bus and travel counters. Novelty: The novelty of this research is the development of GIS as a search for the location of bus and travel counters using the breadth-first search algorithm. This research can help the community find the location of the nearest bus and tourist counter in the city of Padang.
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

Purpose: 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 endpoint, 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. Methods: 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. Result: 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. Novelty: The novelty of this research is the development of GIS as a disaster mitigation education. The function of this research can help the community in finding an evacuation route in the event of a tsunami disaster.
Co-Authors ANGGRAINI, PUTRI Astri, Renitra Mulya, Dio Prima Sularno Sularno Sularno Sularno, Sularno