Article Per Year (5 Year)
p-Index From 2019 - 2024
3.23
P-Index
This Author published in this journals
All Journal Pixel : Jurnal Ilmiah Komputer Grafis Elkom: Jurnal Elektronika dan Komputer JTERA (Jurnal Teknologi Rekayasa) JMM (Jurnal Masyarakat Mandiri) Jurnal Teknik Informatika UNIKA Santo Thomas Paspalum: Jurnal Ilmiah Pertanian Jurnal Sistem Informasi Kaputama (JSIK) Jutisi: Jurnal Ilmiah Teknik Informatika dan Sistem Informasi Progresif: Jurnal Ilmiah Komputer Technologia: Jurnal Ilmiah JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Jurnal Teknik Informatika Unika Santo Thomas (JTIUST) Jurnal Sintaks Logika (JSilog)
Iwan Rizal Setiawan
Universitas Muhammadiyah Sukabumi
Agriculture, Biological Sciences & Forestry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Industrial & Manufacturing Engineering Mechanical Engineering Other

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

Found 22 Documents
Search

 1   2   3 
Penerapan Algoritma Dijkstra dengan metode SAW dan Haversine Pada Pencarian Rute Terdekat Menemukan Titik Pemberhentian Angkot Kota Sukabumi Zaldi Arif Mulkan; Iwan Rizal Setiawan; Fathia Frazna
Journal of Information System Research (JOSH) Vol 4 No 4 (2023): Juli 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/josh.v4i4.3661

Abstract

Angkot (City Transportation) in Sukabumi City is a popular public transportation system and is one of the main means of transportation for local residents and visitors to move around in the city with so many lanes each that the angkot itself passes, 19 route routes which cause so many problems for the community and outsiders of Sukabumi in finding angkot stop points so that it slows down time and is inefficient. Therefore, to make it easier to find angkot stopping points, Dijkstra's algorithm was chosen. Dijkstra's algorithm is the shortest route search algorithm by relying on the smallest value weight and calculating all neighboring nodes to find the smallest value. Researchers used 2 methods used, namely the SAW and Haversine methods. SAW method (Simple Additive Weighting Method). This method is for carrying out weighted sums based on 3 criteria for road width, distance traveled and estimated time and then normalizing the data to ranking. the haversine method is to calculate distances based on lattitude and lontitude. Initiate from the starting point to the destination point with a graph using Dijkstra's algorithm to produce a 30 iteration focus point generated by Dijkstra's algorithm, then evaluate the model by reaching other paths to the destination point.The results obtained in the search for the closest route using the two SAW and Haversine methods, after calculating all the paths passed from the starting point V117 (Bayangkara Street) - V82 (R.E Martadinata Street) obtained the results of the shortest route obtained, namely V117 - V118 - V131 - V130 - V132 - V133 - V134 - V138 - V137 - V110 - V82. Looking for the closest route from the starting point to the destination location determined by the researcher with the final result in the form of a Web-based application.
PENERAPAN EXTREME PROGRAMMING DALAM MEMBANGUN APLIKASI KOS-KOSAN DI KOTA SUKABUMI BERBASIS WEB Naufal Ali Fardiansyah; Iwan Rizal Setiawan; Lelah Lelah
Elkom : Jurnal Elektronika dan Komputer Vol 16 No 1 (2023): Juli : Jurnal Elektronika dan Komputer
Publisher : STEKOM PRESS

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.51903/elkom.v16i1.928

Abstract

With the changing times, technology has become more sophisticated and powerful. Even all circles of society also feel the impact, as time goes by many people have taken advantage of this technology, thus making it easier for users to carry out activities in each of their activities. Especially in this millennial era, which predominantly uses everything digital. For example, new students who study to the next level at a dominant university from outside the region who need a temporary residence or what is commonly called a boarding house. The difficulty encountered at first was the difficulty of getting information and locations that were easily accessible by students to campus. In this way researchers take advantage of existing problems by utilizing technology to create an information system. With this application, it is hoped that it will make it easier for students to find boarding houses that match the student's wishes and assist the owner of the boarding house in promoting his boarding house. By making this boarding house application, it is a form of utilizing existing technology so that it can be used anywhere and anytime. By using this extreme programming method, it is software development that gives users access rights to add or change application processes. So a website was created to build applications for boarding houses in the city of Sukabumi.
Co-Authors Agung Pambudi Argia Pranselga Arsiyanik Arsiyanik Asep Budiman Kusdinar Asril Adi Sunarto Asriyani Asriyani Asriyanik Asriyanik Asriyanik Asriyanik Asriyanik Azhilla Margiani Saraswati Dicky Jhoansyah Eza Anbiya Tisna Fahrizal Fahrizal Fathia Frazna George Pri Hartawan Isa, Indra Griha Tofik Jijim Saepudin Kaswili Sriwenda Putri Lastri Yuningsih Lelah Lelah Mochamad Ezra Yasin Fauzi Naufal Ali Fardiansyah Neneng Kartika Rini Prajoko Rijal Agus Rusmana Rizki Fauzan Suswandy Suswandy Rizky Kausar Shilva Imanibillah Syaivi Indra Giri Tsani, Ashrul Widdy Arfiansyah Winda Apriandari Zaldi Arif Mulkan