Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal JURNAL MEDIA INFORMATIKA BUDIDARMA IJISTECH (International Journal Of Information System & Technology) IJISTECH
Andri Yunaldi
AMIK KOSGORO
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering Social Sciences

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

Found 3 Documents
Search

 1 
Sistem Pendukung Keputusan Seleksi Bantuan Siswa Miskin Menerapkan Kombinasi Metode SAW dan ROC Andri Yunaldi
JURNAL MEDIA INFORMATIKA BUDIDARMA Vol 3, No 4 (2019): Oktober 2019
Publisher : STMIK Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/mib.v3i4.1511

Abstract

Decision support system (DSS) is a system that helps decision makers in this case the principal, so that the decisions produced are considered effective and appropriate to solve the problems faced. Specifically in determining the provision of assistance to poor students, the determination of the criteria is aimed at making the recipient of the assistance in accordance with the purpose of the assistance itself. In this study, the authors applied a combination of SAW and ROC methods in selecting beneficiaries. ROC (Rank Order Centroid) is a method that can produce weight values, while Simple Additive Weighting (SAW) is a method used to rank poor prospective student assistance recipients as an alternative. The results of the study are expected to contribute to the development of science, especially the principal in the selection decision for recipients of poor student assistance
Implementation of The Shortest Route Value Calculation Using The Generate and Test Algorithm Andri Yunaldi
IJISTECH (International Journal of Information System and Technology) Vol 6, No 2 (2022): August
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (683.922 KB) | DOI: 10.30645/ijistech.v6i2.233

Abstract

Search and tracking issues are important in determining the success of a system based on Artificial Intelligence. One that is well known is the Generate and Test method which is one of several heuristic search models in Artificial Intelligence terminology. Generate and Test is an algorithm that performs tests to find the shortest route in the case of a trip. Generete and test is suitable for measuring the smallest distance. The benefit of this research is to save time and money in traveling the distance to a city. How it works in this algorithm is to see the initial state as a star point and see the final state as a goal state. Perform all calculations to each distance provided that it starts from the initial strat and ends with the end strat. Count all values, choose the smallest value to reach the Final goal. If the search results have been found then the search is stopped, if not the solution then the search continues until it finds the smallest result to find a solution.
Implementation of The Shortest Route Value Calculation Using The Generate and Test Algorithm Andri Yunaldi
IJISTECH (International Journal of Information System and Technology) Vol 6, No 2 (2022): August
Publisher : Sekolah Tinggi Ilmu Komputer (STIKOM) Tunas Bangsa

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

Abstract

Search and tracking issues are important in determining the success of a system based on Artificial Intelligence. One that is well known is the Generate and Test method which is one of several heuristic search models in Artificial Intelligence terminology. Generate and Test is an algorithm that performs tests to find the shortest route in the case of a trip. Generete and test is suitable for measuring the smallest distance. The benefit of this research is to save time and money in traveling the distance to a city. How it works in this algorithm is to see the initial state as a star point and see the final state as a goal state. Perform all calculations to each distance provided that it starts from the initial strat and ends with the end strat. Count all values, choose the smallest value to reach the Final goal. If the search results have been found then the search is stopped, if not the solution then the search continues until it finds the smallest result to find a solution.
Co-Authors