Article Per Year (5 Year)
p-Index From 2020 - 2025
0.444
P-Index
This Author published in this journals
All Journal INFORMAL: Informatics Journal Jurnal Malikussaleh Mengabdi
Ar Razi
Unknown Affiliation
Religion Humanities Computer Science & IT Environmental Science Social Sciences Other

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

Found 2 Documents
Search

 1 
Algoritma Dijkstra dan Bellman-Ford dalam Sistem Pemetaan Barbershop di Kota Lhokseumawe Rozzi Kesuma Dinata; Bustami Bustami; Ar Razi; Muhammad Arasyi
INFORMAL: Informatics Journal Vol 7 No 2 (2022): Informatics Journal (INFORMAL)
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v7i2.33303

Abstract

A Barbershop service provider is a company that provides hair care to the community. Many people are currently doing business in this field, and many business actors are opening Barbershops in a variety of locations, ranging from campuses to office districts to densely populated towns. In Lhokseumawe City, there are 12 Barbershops. The application's benefit is that it can identify the shortest path from the user's location to the selected Barbershop, as well as the Barbershop's location and a brief description of the Barbershops in Lhokseumawe City. Only the system's defined nodes can be used to find the fastest route to the Barbershop. Dijkstra's method was chosen because it works against all current alternative functions and provides the shortest path from all nodes, ensuring that the shortest path is produced optimally. Because the Bellman-Ford algorithm is a variant of the BFS (best-first-search) algorithm, which is also employed in the search for the closest distance when the search for the closest distance has a negative weight, it was chosen. The same results were obtained in picking the route based on the results of the route selection test. However, when the two techniques are compared in terms of program execution time, Dijkstra's algorithm is faster than the Bellman-Ford algorithm.
Penyuluhan Pengendalian Korosi Pipa pada Pelaku Industri Blasting Fikri, Ahmad; Khairul Anshar; Agam Muarif; Rizka Mulyawan; Ar Razi; Desvina Yulisda; Kurniawati; Dini Rizki; Syamsul Bahri
Jurnal Malikussaleh Mengabdi Vol. 4 No. 1 (2025): Jurnal Malikussaleh Mengabdi, April 2025
Publisher : LPPM Universitas Malikussaleh

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29103/jmm.v4i1.22388

Abstract

Korosi merupakan fenomena yang sering terjadi pada komponen dan peralatan industri. Proses penanganan korosi salah satunya adalah dengan menggunakan blasting. CV Mitra Blastida Utama merupakan salah satu perusahaan blasting yang cukup baik untuk membantu mitranya dalam menghadapi korosi. Kemampuan dalam melakukan blasting setelah didapatkan oleh perusahaan tersebut sejak lama. Namun prinsip blasting Yang digunakan untuk mengendalikan polusi belum sepenuhnya dipahami oleh karyawan perusahaan tersebut. Kegiatan penyuluhan pengendalian korosi pada pipa merupakan kegiatan memberikan dasar-dasar pengendalian korosi dan blasting pada mitra. Metode yang digunakan dalam kegiatan ini adalah metode penyuluhan. Pemahaman pengendalian korosi pada pipa mengalami peningkatan dari mulai sebelum penyuluhan sampai setelah dilakukan penyuluhan. Metode tersebut yang memudahkan peningkatan pemahaman peserta sebelum penyuluhan sampai sesudah penyuluhan.
Co-Authors Agam Muarif Ahmad Fikri Bustami Bustami Dini Rizki Khairul Anshar Kurniawati Muhammad Arasyi Rizka Mulyawan Rozzi Kesuma Dinata Syamsul Bahri Yulisda, Desvina