Claim Missing Document
Check
Articles

Found 22 Documents
Search

Implementasi Aplikasi Web Pemilihan Kelas Berdasarkan Minat Menggunakan Algoritma K-Means Clustering Clarenza Dixie Rose; Bernadus Anggo Seno Aji; Farah Zakiyah Rahmanti
Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) Vol 9 No 1 (2025): JANUARI-MARET 2025
Publisher : Lembaga Otonom Lembaga Informasi dan Riset Indonesia (KITA INFO dan RISET)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35870/jtik.v9i1.3165

Abstract

Giki High School has a large number of 10th grade students and the need to provide class recommendations based on student interests in current subjects is done conventionally. This study aims to help schools make more informed decisions in class selection. This study implements a web application. The implementation of the category selection web application was created using the K-means Clustering algorithm and integrated into the web using Tkinter as the standard GUI library for Python. This implementation goal is to make school life easier to determine class recommendations for students. Results of the K-Means algorithm produce 4 clusters: Cluster 1 (Indonesian, Social Studies, and Mathematics), Cluster 2 (English), Cluster 3 (Indonesian and Science), Cluster 4 (English and Science) with the Silhouette Score results giving a score of 0.6233 which indicates that the score calculation is at 0 that the data point is the center of each cluster.
Automatic Task Provisioning and Routing Framework for Carrier Robots in Smart Factory with Edge Computing Philip Tobianto Daely; Oktavia Ayu Permata; Bernadus Anggo Seno Aji
International Journal of Recent Technology and Applied Science (IJORTAS) Vol 7 No 1: March 2025
Publisher : Lamintang Education and Training (LET) Centre

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36079/lamintang.ijortas-0701.739

Abstract

This paper proposed a pickup and delivery (P&D) task provisioning and vehicle routing framework for carrier robots in a factory with edge servers assisting as the intermediary between robots and working stations, where the task requests come. The carrier robots must pick up and deliver each assigned load from and to designated locations with minimal traveled distance and without violating designated constraints. Edge servers are utilized to facilitate communication between the main server and delivery robots and assist the main server in deciding the best robot for each incoming task request and the updated route to facilitate execution of tasks by each carrier robot. The problem of pickup and delivery for each robot is modeled based on Dial-a-Ride Problem, and a discrete bio-inspired algorithm is proposed to solve this problem. The tasks are distributed to edge servers and carrier robots by taking their service loads into account. The simulation results show that the proposed framework can provide an effective solution towards optimizing the pickup and delivery process in a smart factory.