Article Per Year (5 Year)
p-Index From 2021 - 2026
3.609
P-Index
This Author published in this journals
All Journal Jurnal Informatika Scientific Journal of Informatics JURNAL ILMIAH INFORMATIKA JURNAL TEKNOLOGI DAN OPEN SOURCE IJISTECH (International Journal Of Information System & Technology) JURIKOM (Jurnal Riset Komputer) Minda Baharu Building of Informatics, Technology and Science JASIEK (Jurnal Aplikasi Sains, Informasi, Elektronika dan Komputer) Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) IJISTECH Journal of Information System and Technology (JOINT) International Journal of Research in Vocational Studies (IJRVOCAS) JUPADAI : Jurnal Pengabdian Kepada Masyarakat Jurnal Siteba Jurnal Pengabdian Barelang Prosiding Seminar Nasional Ilmu Sosial dan Teknologi (SNISTEK)
Alvendo Wahyu Aranski
Institut Teknologi Batam, Indonesia
Religion Aerospace Engineering Agriculture, Biological Sciences & Forestry Humanities Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Earth & Planetary Sciences Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Social Sciences Other

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

Found 2 Documents
Search
Journal : IJISTECH

 1 
Optimization of The Smallest Road Using The Traveling Salesman Problem (TSP) Method Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 1 (2022): June
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i1.224

Abstract

Optimization is the process of obtaining a minimum (small) or maximum (largest) value in an opportunity function. One case that uses the optimization function is the Traveling Salesman Problem (TSP). The case study problem in this research is to find the shortest route to a destination city in order to get a short time to get to that city and save time and costs on the way. The completion of the search for the shortest route uses the TSP concept. Basic concepts in running CSR 1. The journey starts and ends in the same city as the original city of the salesperson. 2. Entire cities must be visited without missing a single city.3. Sales are not allowed to return to the city of origin before all cities have been visited. By using this method, the distance between each city will be analyzed. The cities that the salesman will go to consist of 4 cities A, B, C, and D with a combination process to obtain as many as 24 lanes that can be passed by the salesman. From each route taken by the salesman, there are 2 shortest paths that can be used as alternatives, including the CABD=17+15+19=51 route and the DBAC=19+15+17=51 route. The final results of this study can be used as a reference in determining the shortest route by salesmen with a distance value of 15.
Depth First Search Algorithm In Solving the Shortest Route Using the Concept of Generate and Test Alvendo Wahyu Aranski
IJISTECH (International Journal of Information System and Technology) Vol 6, No 3 (2022): October
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30645/ijistech.v6i3.249

Abstract

Depth First Search Algorithm is a search process to find the right solution that requires short memory and time in finding the Goal. The problem in this research is the difficulty of salesmen to find alternative short routes to arrive at the final node as consideration for finding solutions. The purpose of this study is to find the shortest path so that salesmen can easily and quickly get to the final solution by saving time and mileage. The Generate And Test concept consists of combining the Depth first search algorithm with the backward tracking process. All processes must be completed before the testing process is carried out. If the General And Test process is carried out sequentially or systematically, it will get the best value in finding a solution, the weakness if the search process is large or extensive then the search process takes a very long time. How it works Generatr and test, namely 1. Generate possible solutions in the form of state states with the concept of a one-position path to the destination path. 2. Test, select whether the solution can be accepted according to the existing criteria 3. If the solution has got the Goal then the search is stopped, if not then the process is continued until finding a solution. The final result of testing the shortest route is A-B-E-J-P-S-U = 25+21+24+24+17+18=129
Co-Authors Abrar, Mohammad Masril Andi Supriadi Chan, Andi Supriadi Andri Yunaldi Ardiansyah, Luky Aulia Agung Dermawan Azkia, Muhammad Zukhruful Bagus Andhika Tuah Aprilyana Malaka Bilbina, Andhin Nabila Burhan, Rifatul Mahmudah candra, joni eka Darmansah, Darmansah Destiadi, Rezha Dimas Akmarul Putera Dwi Ely Kurniawan Dwi Maharani, Suci Ellbert Hutabri Franky Chia Handoko, Koko Hasibuan, Annalisa Sonaria Hasla, Salsabila Dwi Putri Hendri Kremer Indra Lesmana, Naufal januardi nasir Kremer, Hendri Lawi, Ansarullah Lesmana, Naufal Indra Mielanda, Ezzy Mohammad Jufri Muhammad Abrar Masril Muhammad Jufri Muhammad Jufri munir, Zainul Munir Nasution, Nadia Widari Nopriadi Nopriadi Noviardi, Refli Putra, Riko Andrian Rafi Dio Rahmat Fauzi Rahmat Fauzi Ramadona, Tri Suci Ririt Dwiputri Permatasari Rizki, Sestri Novia Sarah Astiti S.Kom., M.MT Sestri Novia Rizki Situmorang, Deslika Sugiyanto, Joko Sunarsono, Hery Wibisono, Muhammad Chairul Winata, Ardiya Yasha Langitta Setiawan Yunaldi, Andri