Hisyam Fahmi
Universitas Islam Negeri Maulana Malik Ibrahim Malang, Indonesia

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

Found 3 Documents
Search

Implementasi Algoritma A-Star dalam Menentukan Rute Terpendek Destinasi Wisata Kota Malang Riyan Fahmi Syihabuddin; Mohammad Nafie Jauhari; Muhammad Khudzaifah; Hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 1, No 5 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (663.253 KB) | DOI: 10.18860/jrmm.v1i5.14497

Abstract

Traveling is one of the needs of everyone to relax the mind from the busyness that is lived every day. One of the cities in East Java which is a prima donna for traveling is Malang. The city has approximately 43 tourist destinations. Usually, tourists who want to visit not only one place, but several places. generate assistance in deciding which destinations to visit first in order for their trip to be effective. The shortest search process in this study uses the A-Star Algorithm, one of the BFS algorithms which in the process really considers the heuristic value. The process of testing the shortest route is done by selecting a starting point, then selecting several tourist locations. Next, the shortest route will be searched using the A-star algorithm at each destination, then which destination will be visited first. And so on until the final destination. The effectiveness of the route which involves comparison with the route presented by google maps. Based on the results of 30 experiments on several comprehensive destinations, it was found that the average route search using the A-Star algorithm was 44.17% shorter than that presented on google maps. This is due to the uniqueness of the algorithm in which there is a heuristic value and selection for each destination so as to make the route more effective.
Implementasi Jaringan Syaraf Tiruan Backpropagation untuk Menentukan Prediksi Jumlah Permintaan Produksi Dodol Apel Farrah Nurmalia Sari; Ari Kusumastuti; hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 2, No 2 (2022): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (839.513 KB) | DOI: 10.18860/jrmm.v2i2.14899

Abstract

Forecasting is importantly in accordance with the planning strategy; therefore it will affect the way of decision making. One of the forecasting methods is Artificial Neural Network with Backpropagation as the algorithm. This research aims to measure the accuracy of the network architecture which is being applied in order to calculate the prediction of the future’s apple paste product monthly demand which was obtained from CV. Bagus Agriseta Mandiri. The data which are being used are 36 monthly data from the year 2017, 2018 and 2019. Furthermore, the data obtained are normalized and divided into two, 66,66% as the data for training process and 33,33% as the data for testing process. Network architecture that is applied in this research is 12 : 10 :1, where 12 are neurons for input layer, 10 are neurons for one hidden layer and 1 is neuron for output layer. The Network with that framework obtained a result 20.161% for MAPE and 79.839% for the accuracy. That model is categorized as good enough for its forecasting ability. Moreover, the network was entirely validated using k-fold cross validation method with . The result obtained as follows: the average of MAPE is 47.079% and the average accuracy is 52.921%. According to it, the entire model can be categorized as good enough in order to run a forecast. As a comparison, another testing has been done with the same fold but different in the network architecture (model 6 – 8 – 1). The second model obtained results as follows: the average of MAPE is 26.74% and the average accuracy is 73.18%, so that the two prediction models’ ability are in the same category, it is good enough to run a forecast.
Implementasi Algoritma Floyd Warshall dalam Pencarian Rute Terpendek Lokasi Tower Base Transceiver Station (BTS) pada PT Citra Akses Indonusa Bella Nafa Savitri; Mohammad Nafie Jauhari; Evawati Alisah; Hisyam Fahmi
Jurnal Riset Mahasiswa Matematika Vol 2, No 4 (2023): Jurnal Riset Mahasiswa Matematika
Publisher : Mathematics Department, Maulana Malik Ibrahim State Islamic University of Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.18860/jrmm.v2i4.16811

Abstract

PT Citra Akes Indonusa is a company that operates on the expertise of information technology services in Banten Province. One of the services provided by the company requires the construction of a Base Transceiver Station (BTS) tower. The tower requires maintenance if there is damage to the network signal. As a result, the shortest route is needed to make it easier for employees to reach the tower location to be more effective. There are eight BTS tower locations in Tangerang Regency and three BTS tower locations in Tangerang City. The process of finding the shortest route in this study uses the Floyd Warshall algorithm, which is unique in finding the shortest route by comparing each edge of all edges that are passed. The process of testing the shortest route is done by selecting the starting point, then selecting several BTS tower locations. Next, the shortest route will be searched using the Floyd Warshall algorithm from each point of destination for the BTS tower location, then the BTS tower location will be selected first and so on until the last destination. The effectiveness of this shortest route search involves a comparison of the routes presented by Google Maps. Based on the results of 30 randomized trials on BTS tower locations, the average shortest route effectiveness was 25.54% compared to the route generated by Google Maps. This is due to the selection at each BTS tower destination location so as to make the route more effective.