OTM DARS JADVALI UCHUN INTELLEKTUAL TAQSIMOT ALGORITMI
Narziyev U. Z.
Annotatsiya
Mazkur ishda oliy ta’lim muassasalari uchun dars jadvalini avtomatik tuzish masalasi qaraladi. Masala NP-murakkab kombinator optimallashtirish sifatida talqin qilinib, qat’iy cheklovlar (stiksiz, vaqt oralig‘i, potokni saqlash) va yumshoq talablar (o‘qituvchi darslarining yaqinligi, fanlarni yaqin joylashtirish, kunlar bo‘yicha tenglik) asosida yechim ishlab chiqildi. Taqdim etilgan greedy + chain relocation (zanjirli ko‘chirish) usuli amalda tez ishlashi va juftliklar orasida bo‘sh joylarsiz jadval hosil qilishi bilan ajralib turadi. Delphi muhitida amaliy dastur yaratildi va real ma’lumotlar bazasida sinovdan o‘tkazildi.
Adabiyotlar
- Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266–280.
- Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176(1), 177–192.
- Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.
- Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167–190.
- Carter, M. W., & Laporte, G. (1996). Recent developments in practical course timetabling. Lecture Notes in Computer Science, 1153, 3–19.