Integrating ABC with genetic grouping for university course timetabling problem

Scheduling courses in university is an important matter in all academic institutes across the world. Scheduling courses, students, and class rooms without any crash is the main aim of university course time tabling problem. This problem is categorized as a NP-hard problem. The proposed algorithm is firstly based on a genetic grouping approach to generate feasible solutions. In the second step, an effective neighborhood structure which is embedded in an artificial bee colony is used to overcome the problem's conflicts. Experimental results showed that proposed algorithm can obtain comparative results with the best known results of previous articles. The proposed algorithm has been performed on a standard and well known dataset named Socha. The results revealed the efficiency of proposed method. The suggested approach could find the best results on large scale instances of Socha dataset. Results on medium size of the dataset has been improved approaches in four cases out of five instances of dataset.

[1]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

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

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

[4]  A. Araisa Mahiba,et al.  Genetic Algorithm with Search Bank Strategies for University Course Timetabling Problem , 2012 .

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

[6]  Halvard Arntzen,et al.  A Tabu Search Heuristic for a University Timetabling Problem , 2005 .

[7]  Gyuri Lajos.  Complete University Modular Timetabling Using Constraint Logic Programming , 1995, PATAT.

[8]  Aldy Gunawan,et al.  A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem , 2012, Comput. Oper. Res..

[9]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[10]  Bassem Jarboui,et al.  The classroom assignment problem: Complexity, size reduction and heuristics , 2014, Appl. Soft Comput..

[11]  Mohammed Azmi Al-Betar,et al.  University course timetabling using hybridized artificial bee colony with hill climbing optimizer , 2014, J. Comput. Sci..

[12]  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).

[13]  Hishammuddin Asmuni,et al.  A new hybrid imperialist swarm-based optimization algorithm for university timetabling problems , 2014, Inf. Sci..

[14]  Pupong Pongcharoen,et al.  Stochastic Optimisation Timetabling Tool for university course scheduling , 2008 .

[15]  Mohammad Saniee Abadeh,et al.  A fuzzy genetic algorithm with local search for university course timetabling , 2011, The 3rd International Conference on Data Mining and Intelligent Information Technology Applications.

[16]  Malek Alzaqebah,et al.  Hybrid bee colony optimization for examination timetabling problems , 2015, Comput. Oper. Res..

[17]  Mohammed Azmi Al-Betar,et al.  A hybrid artificial bee colony for a nurse rostering problem , 2015, Appl. Soft Comput..

[18]  Sara Ceschia,et al.  Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem , 2011, Comput. Oper. Res..

[19]  Parham Moradi,et al.  Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems , 2014, Eng. Appl. Artif. Intell..

[20]  Amit Konar,et al.  Arduino based multi-robot stick carrying by Artificial Bee Colony optimization algorithm , 2015, Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT).

[21]  Jonathan M. Thompson,et al.  Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem , 2015, Eur. J. Oper. Res..

[22]  Mohammed Azmi Al-Betar,et al.  University Course Timetabling Using a Hybrid Harmony Search Metaheuristic Algorithm , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[23]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[24]  S. Abdullah,et al.  Generating University Course Timetable Using Genetic Algorithms and Local Search , 2008, 2008 Third International Conference on Convergence and Hybrid Information Technology.

[25]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[26]  Wilhelm Erben,et al.  A Genetic Algorithm Solving a Weekly Course-Timetabling Problem , 1995, PATAT.

[27]  Masri Ayob,et al.  Hybrid Ant Colony systems for course timetabling problems , 2009, 2009 2nd Conference on Data Mining and Optimization.

[28]  Joe Henry Obit,et al.  Evolutionary Non-linear Great Deluge for University Course Timetabling , 2009, HAIS.

[29]  Paolo Toth,et al.  A new lower bound for curriculum-based course timetabling , 2013, Comput. Oper. Res..

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

[31]  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).

[32]  Graham Kendall,et al.  Population based Local Search for university course timetabling problems , 2013, Applied Intelligence.

[33]  He Yan,et al.  A Multiple-Neighborhoods-Based Simulated Annealing Algorithm for Timetable Problem , 2003, GCC.