SIMULATED ANNEALING APPROACH FOR UNIVERSITY TIMETABLE PROBLEM

  • R. Kristoforus J. Bendi Universitas Katolik Musi Charitas
  • Hadi Junaidi Universitas Katolik Musi Charitas
Keywords: university timetable problem, simulated annealing, optimization.

Abstract

Abstract :  University Scheduling is a way of allocating students, lecturers, and rooms, which is used for lectures in the available time slots. The common problems are that a lecturer is scheduled in the same time slot, or several courses are scheduled in the same room and the same time slot. For this reason, scheduling needs to be made in such a way that it can optimize the use of resources. We use simulated annealing as an approach to solve that problem. The results showed that the higher the initial temperature value used and the greater the iteration value would reduce the violation constraints in scheduling problems.

References

[1] K.R. Baker, Introduction to Sequenceing Scheduling.: John Wiley & Sons, 1974.
[2] Z. Bozyer, M. S. Basar, and A. Aytekin, "A Novel Approach of Graph Coloring for Solving University Course Timetabling Problem," in The Second International Symposium on Computing in Science & Engineering, Kusadasi, Aydin, Turkey, 2011, pp. 560-566.
[3] F. K. Dewi, "Pembangunan Perangkat Lunak Pembangkit Jadwal Kuliah dan Ujian Dengan Metode Pewarnaan Graf," Buana Informatika, vol. 1, no. 1, pp. 57-68, 2010.
[4] M. Mariana and L. Hiryanto, "Penjadwalan Kelas Matakuliah menggunakan Vertex Graph Coloring dan Simulated Annealing," Jurnal Ilmu Komputer dan Sistem Informasi, vol. 1, no. 1, pp. 125-132, 2013.
[5] W. A. Puspaningrum, A. Djunaidy, and R. A. Vinarti, "Penjadwalan Mata Kuliah Menggunakan Algoritma Genetik di Jurusan Sistem Informasi ITS," Jurnal Teknik POMITS, vol. 2, no. 1, pp. 127-131, 2013.
[6] N.R. Sabar, M. Ayob, G. Kendall, and R. Qu, "A Honey Bee Mating Optimization Algorithm For Educational Timetabling Problems," European Journal of Operatorin Research, vol. 216, no. 2012, pp. 533-543, 2012.
[7] K. Setemen, "Implementasi Algoritma Genetika Dalam Pengembangan Sistem Aplikasi Penjadwalan Kuliah," Jurnal IKA, vol. 8, no. 1, pp. 56-68, 2010.
[8] N. S. Jat and S. Yang, "A Memetic Algorithm for the University Course Timetabling Problem," in IEEE International Conference on Tools With Artificial Intelligence, Dayton, OH, USA, 2008, pp. 427-433.
[9] H. Saragih, G. Hoendarto, B. Reza, and D. Setiyadi, "Aplikasi Sistem Perangkat Lunak Menggunakan Algoritma Ant Untuk Mengatur Pendjadwalan Kuliah," Jurnal Teknik dan Ilmu Komputer, vol. 1, no. 3, pp. 241-256, 2012.
[10] M. S. Kohshori and M. S. Abadeh, "Hybrid Genetic Algorithms for University Course Timetabling," International Journal of Computer Science Issues, vol. 9, no. 2, pp. 446-455, 2012.
[11] S. Kirkpatrick, C. D. Gellat, and M. P. Vecchi, "Optimization by Simulated Annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
[12] E. Aycan and T. Ayav, "Solving the course scheduling problem using simulated annealing," in IEEE International Advance Computing Conference, Patiala, India, 2009, pp. 462-466.
[13] B. Santosa and T. J. Ai, Pengantar Metaheuristik Implementasi dengan Matlab. Surabaya: ITS Tekno Sains, 2017.
[14] Suyanto, Algoritma Optimasi Deterministik atau Probabilistik. Yogyakarta: Graha Ilmu, 2010.
[15] A. Rochman, "Penjadwalan Kuliah Menggunakan Metode Constraints Programming dan Simulated Annealing.," in Seminar Nasional Aplikasi Teknologi Informasi, Yogyakarta, 2012.
[16] T. Kristanto, T. Indriyani, and N. Khoiroh, "Penjadwalan Ruang Kuliah Menggunakan Vertex Graph Coloring Dan Simulated Annealing," in Seminar Nasional Sains dan Teknologi Terapan, Surabaya, 2016, pp. 61-68.
[17] W. Sari and J. E. Suseno, "Metode Simulated Annealing untuk Optimasi Penjadwalan Perkuliahan Perguruan Tinggi," Jurnal Sistem Informasi Bisnis, vol. 6, no. 2, pp. 133-143, 2017.
Published
2019-12-19
How to Cite
J. Bendi, R. K., & Junaidi, H. (2019). SIMULATED ANNEALING APPROACH FOR UNIVERSITY TIMETABLE PROBLEM. Jurnal Ilmiah Matrik, 21(3), 204-213. https://doi.org/10.33557/jurnalmatrik.v21i3.723
Section
Articles
Abstract viewed = 21 times
PDF : 8 times