Implementasi Penggunaan Algoritma Steepest Ascent Hill Climbing dalam Penyelesaian Permasalahan Penjadwalan Ujian (Studi Kasus : SMKN 13 Medan)

Abstract

Scheduling exams is a complex issue commonly faced by educational institutions, including SMKN 13 Medan. To address this challenge, The Steepest Ascent Hill Climbing algorithm can be used as an approach in finding optimal exam scheduling solutions. Implementation steps involve utilizing data on teachers, rooms, subjects, and exam schedules as inputs, with the aim of minimizing exam conflicts, meeting room and proctor availability, and adhering to other constraints. Steepest Ascent Hill Climbing algorithm operates by seeking best solution from current solution, aiming to achieve an optimal outcome. Solution search is conducted iteratively, starting from an initial solution generated randomly or based on predefined rules. Subsequently, the algorithm moves to a better solution in each iteration until reaching a solution that meets the specified criteria. This results in an exam schedule that minimizes conflicts, ensures room and proctor availability, and complies with relevant constraints. This implementation significantly contributes to enhancing the efficiency of the exam scheduling process in schools, thus improving students’ learning experience.