Incorporating Machine Learning to Evaluate Solutions to the University Course Timetabling Problem

Evaluating solutions to optimization problems is arguably the most important step for heuristic algorithms, as it is used to guide the algorithms towards the optimal solution in the solution search space. Research has shown evaluation functions to some optimization problems to be impractical to compute and have thus found surrogate less expensive evaluation functions to those problems. This study investigates the extent to which supervised learning algorithms can be used to find approximations to evaluation functions for the university course timetabling problem. Up to 97 percent of the time, the traditional evaluation function agreed with the supervised learning regression model on the result of comparison of the quality of pair of solutions to the university course timetabling problem, suggesting that supervised learning regression models can be suitable alternatives for optimization problems' evaluation functions.

[1]  Juliana Wahid,et al.  Harmony Search Algorithm for Curriculum-Based Course Timetabling Problem , 2014, ArXiv.

[2]  Craig A. Morgenstern,et al.  Coloration neighborhood structures for general graph coloring , 1990, SODA '90.

[3]  Can Akkan,et al.  A bi-criteria hybrid Genetic Algorithm with robustness objective for the course timetabling problem , 2018, Comput. Oper. Res..

[4]  Ben Paechter,et al.  Metaheuristics for University Course Timetabling , 2007, Evolutionary Scheduling.

[5]  Vasant Honavar,et al.  Learn++: an incremental learning algorithm for supervised neural networks , 2001, IEEE Trans. Syst. Man Cybern. Part C.

[6]  Luca Di Gaspero,et al.  Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results , 2012, Ann. Oper. Res..

[7]  Yuichi Nagata,et al.  Random partial neighborhood search for the post-enrollment course timetabling problem , 2018, Comput. Oper. Res..

[8]  Andrea Esuli,et al.  Evaluation Measures for Ordinal Regression , 2009, 2009 Ninth International Conference on Intelligent Systems Design and Applications.

[9]  Kenekayoro Patrick,et al.  Comparison of simulated annealing and hill climbing in the course timetabling problem , 2012 .

[10]  Sanja Petrovic,et al.  A graph-based hyper-heuristic for educational timetabling problems , 2007, Eur. J. Oper. Res..

[11]  John Geraghty,et al.  Genetic Algorithm Performance with Different Selection Strategies in Solving TSP , 2011 .

[12]  Edmund K. Burke,et al.  A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem , 2012, 2012 12th UK Workshop on Computational Intelligence (UKCI).

[13]  Mohammed Azmi Al-Betar,et al.  Artificial bee colony algorithm for curriculum-based course timetabling problem , 2011 .

[14]  Michael Sampels,et al.  Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.

[15]  Salwani Abdullah,et al.  Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling , 2010, EvoCOP.

[16]  J. Magalhães-Mendes,et al.  A Comparative Study of Crossover Operators for Genetic Algorithms to Solve the Job Shop Scheduling Problem , 2013 .

[17]  Jin-Kao Hao,et al.  Lower bounds for the ITC-2007 curriculum-based course timetabling problem , 2011, Eur. J. Oper. Res..

[18]  Regina Berretta,et al.  A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem , 2007, 6th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007).

[19]  Jin-Kao Hao,et al.  Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm , 2008, AIMSA.

[20]  Rich Caruana,et al.  An empirical comparison of supervised learning algorithms , 2006, ICML.

[21]  Ben Paechter,et al.  Finding Feasible Timetables Using Group-Based Operators , 2007, IEEE Transactions on Evolutionary Computation.

[22]  David B. Fogel,et al.  Evolution-ary Computation 1: Basic Algorithms and Operators , 2000 .

[23]  Jin-Kao Hao,et al.  Adaptive Tabu Search for course timetabling , 2010, Eur. J. Oper. Res..

[24]  Robertas Damaševičius,et al.  Automatic Examination Timetable Scheduling Using Particle Swarm Optimization and Local Search Algorithm , 2019 .

[25]  Edmund K. Burke,et al.  A Hybrid Genetic Algorithm for Highly Constrained Timetabling Problems , 1995, ICGA.

[26]  Sanya Liu,et al.  An iterated local search algorithm for the University Course Timetabling Problem , 2018, Appl. Soft Comput..

[27]  L. M. Patnaik,et al.  Adaptive Probabilities of Crossover Genetic in Mu tation and Algorithms , 1994 .

[28]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Annals of Operations Research.

[29]  Mike Thelwall,et al.  Automatic classification of academic web page types , 2014, Scientometrics.

[30]  Shengxiang Yang,et al.  Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[31]  Tadahiko MURATA,et al.  Positive and negative combination effects of crossover and mutation operators in sequencing problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[32]  R. Sahajpal,et al.  Lecture timetabling using hybrid genetic algorithms , 2004, International Conference on Intelligent Sensing and Information Processing, 2004. Proceedings of.

[33]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[34]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[35]  Corinna Cortes,et al.  Support-Vector Networks , 1995, Machine Learning.

[36]  Sotiris B. Kotsiantis,et al.  PREDICTING STUDENTS' PERFORMANCE IN DISTANCE LEARNING USING MACHINE LEARNING TECHNIQUES , 2004, Appl. Artif. Intell..