Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Fatwa Ramdhani
Fakultas Ilmu Komputer, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 2 Documents
Search

 1 
Pengembangan Sistem Rekomendasi Rute Paling Optimum Dengan Algoritme Voronoi Continuous K Nearest Neighbor (VCKNN), Progressive Incremental Network Expansion (PINE), Voronoi-Based Network Nearest Neighbor (VN3), Berbasis Webgis Fajar Krisna Wicaksono; Fatwa Ramdhani; Mochamad Chandra Saputra
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (866.874 KB)

Abstract

In daily life, people in Malang often travel from one place to another by considering the efficiency of travel time. Lowokwaru is one of the densely populated sub-districts in Malang City. Therefore, traffic jam often occurs frequently at certain time. Path searching is one of the solutions in handling traffic jam at certain time in Malang. This research uses the Voronoi-Based Continuous K Nearest Neighbor (VCKNN), Progressive Incremental Network Expansion (PINE), Voronoi-Based Network Nearest Neighbor (VN3) algorithms. Every algorithm has different calculation steps and data models, it affects the computing time of every algorithm that affects the response time of the system. In the VCKNN, PINE and VN3 algorithms, the route searching process is divided into two stages, the first stage is searching for the voronoi neighbor to filter the data based on the voronoi polygon, after that, it searches the route on the voronoi polygon. This research was conducted to find out the response time, the number of passed node and the relationship between response time and the number of passed node, so the most efficient algorithm in the problem of route searching was known. From this research it was known that the algorithm with the fastest response time was VCKNN algorithm with 0.071 seconds response time and the algorithm with the lowest number of passed node was PINE algorithm with the number of nodes passed by 17 nodes. From the results of the research, the most efficient algorithm in determining the optimum route was the VCKNN algorithm.
Pengembangan Sistem Simulasi Perkiraan Penyebaran Api Pada Gunung Arjuno Kawasan Tahura R. Soerjo Menggunakan Tangible Landscape Adhi Isti Febriandhika; Fatwa Ramdhani; Alfi Nur Rusydi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 2 (2019): Februari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1030.501 KB)

Abstract

Forest fires is a condition where forests are hit by flames, causing damage of forests and or forest products that causes economic losses and environmental value. May occur naturally or prescribed, and until now the spread of fire during forest fires has not been predicted with certainty, because there is a lot of variability in fire triggering factors. East Java is a Province in Indonesia that often occurs forest fires. One of the forest areas that often occur forest fires in East Java Province is Tahura R. Soerjo area, and forest fires are one of the most difficult issues handled by Tahura R. Soerjo in managing forest areas. Until now the technology to overcome the problem of forest is still very minimal. The Tangible Landscape method can be used to simulate the possibility of spreading fire that occurs in real-time. By using Tangible Landscape and GRASS GIS, multiple fire simulation scenarios can be performed, and experimenting the determination of making different fire breaks on physical models to evaluate their effectiveness in overcoming the spread of fires. In this study the level of conformity of physical models with actual elevation data in the study area was 30% at maximum values and -28% at minimum values. The simulation process of estimating the spread of fire in this study produces data on the pattern of spread at a certain time according to the specified time and produces a data base rate of spread of 1.18 meters / minute, the maximum rate of spread is the highest of 403.99 meters / minute and the lowest amounting to 5.57 Meters / Minute, the direction of maximal rate of spread that spreads to 19 to 316 degrees in units of degree of wind direction, and maximal spotting distance of 0 to 303 meters.
Co-Authors Adhi Isti Febriandhika Alfi Nur Rusydi Fajar Krisna Wicaksono Mochamad Chandra Saputra