Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Scientific Journal of Informatics

Analisis dan Penerapan Metode Fuzzy AHP-TOPSIS dalam Penentuan Mitra Industri Sebagai Tempat Praktek Kerja Lapangan Veri Julianto; Hendrik Setyo Utomo; Herpendi Herpendi
Jurnal Ilmiah Informatika Vol. 5 No. 2 (2020): Jurnal Ilmiah Informatika
Publisher : Department of Science and Technology Ibrahimy University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35316/jimi.v5i2.942

Abstract

Field Work Practices are part of achieving the expected competencies in the educational process. The suitability of students to companies that serve as street vendors is something that is important to note. The weakness of the previous field work practices system was that there were still many students who were inaccurate in choosing a company or institution as a place for street vendors. This study aims to help determine industry partners in accordance with the competency achievements of each department. The method to be used in this research is Fuzzy Analytical Hierarchy Process (FAHP) in the process of determining the weight priority of each criterion and the TOPSIS method in carrying out the ranking process. The criteria used are the suitability of the department with the company's core (C1), company credibility (C2), and company commitment (C3). corporate environment (C4), and the facilities provided (C5). Each of these criteria consists of several sub criteria. The weights of the criteria obtained through the FAHP are Furthermore, the process of ranking 37 companies using the TOPSIS method obtained the highest preference value, namely 0.8157.
Penerapan Bat Algorithm Dalam Penyelsaian Kasus Travelling Salesman Problem (TSP) Pada Internship Program Veri Julianto; Hendrik Setyo Utomo; Muhammad Rusyadi Arrahimi
Jurnal Ilmiah Informatika Vol. 6 No. 2 (2021): Jurnal Ilmiah Informatika
Publisher : Department of Science and Technology Ibrahimy University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35316/jimi.v6i2.1485

Abstract

This optimization is an optimization case that organizes all possible and feasible solutions in discrete form. One form of combinatorial optimization that can be used as material in testing a method is the Traveling Salesman Problem (TSP). In this study, the bat algorithm will be used to find the optimum value in TSP. Utilization of the Metaheuristic Algorithm through the concept of the Bat Algorithm is able to provide optimal results in searching for the shortest distance in the case of TSP. Based on trials conducted using data on the location of student street vendors, the Bat Algortima is able to obtain the global minimum or the shortest distance when compared to the nearest neighbor method, Hungarian method, branch and bound method.