Penjadwalan Perkuliahan dengan Metode Metaheuristic Ant Colony Optimization Studi Kasus Politeknik Negeri Bali

  • Komang Ayu Triana Indah Politeknik Negeri Bali
  • Putu Gede Sukarata Politeknik Negeri Bali

Abstract

Lecture scheduling problems are a very complex problem, where the core of the scheduling is how to schedule several components consisting of students, lecturers, space, time, and subject matter with due regard to certain constraints and constraints. The goal to be achieved is to apply the Ant Colony Optimization (ACO) Metaheuristic method to optimize the lecture scheduling system. Every step taken by ACO uses an algorithm adapted from ant behavior to solve combinatorial problems. This system is created using Microsoft Visual Basic programming by entering several parameters, namely Lecturer, Course, Room, and several variables from each parameter which are then processed to produce lecture scheduling. The results obtained from the ACO implementation to solve college scheduling problems are seen from the number of constrained constraints and the length of time required from each iteration in each method to get a class schedule so that they get a schedule with a 82 percent truth level which is a comparison of constraint violations to the total number of timeslot used for scheduling.

Downloads

Download data is not yet available.
Penjadwalan Perkuliahan dengan Metode Metaheuristic Ant Colony Optimization Studi Kasus Politeknik Negeri Bali
Published
Jul 31, 2019
How to Cite
INDAH, Komang Ayu Triana; SUKARATA, Putu Gede. Penjadwalan Perkuliahan dengan Metode Metaheuristic Ant Colony Optimization Studi Kasus Politeknik Negeri Bali. Matrix : Jurnal Manajemen Teknologi dan Informatika, [S.l.], v. 9, n. 2, p. 74-82, july 2019. ISSN 2580-5630. Available at: <https://ojs.pnb.ac.id/index.php/matrix/article/view/1335>. Date accessed: 23 may 2024. doi: http://dx.doi.org/10.31940/matrix.v9i2.1335.