A honey-bee mating optimization algorithm for educational timetabling problems

In this work, we propose a variant of the honey-bee mating optimization algorithm for solving educational timetabling problems. The honey-bee algorithm is a nature inspired algorithm which simulates the process of real honey-bees mating. The performance of the proposed algorithm is tested over two benchmark problems; exam (Carter’s un-capacitated datasets) and course (Socha datasets) timetabling problems. We chose these two datasets as they have been widely studied in the literature and we would also like to evaluate our algorithm across two different, yet related, domains. Results demonstrate that the performance of the honey-bee mating optimization algorithm is comparable with the results of other approaches in the scientific literature. Indeed, the proposed approach obtains best results compared with other approaches on some instances, indicating that the honey-bee mating optimization algorithm is a promising approach in solving educational timetabling problems.

[1]  Giuseppe F. Italiano,et al.  New Algorithms for Examination Timetabling , 2000, WAE.

[2]  Edmund K. Burke,et al.  A Memetic Algorithm for University Exam Timetabling , 1995, PATAT.

[3]  George M. White,et al.  Examination Timetables and Tabu Search with Longer-Term Memory , 2000, PATAT.

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

[5]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[6]  Edmund K. Burke,et al.  Enhancing Timetable Solutions with Local Search Methods , 2002, PATAT.

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

[8]  Barry J. Adams,et al.  Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation , 2007, J. Frankl. Inst..

[9]  Peter J. Stuckey,et al.  A Hybrid Algorithm for the Examination Timetabling Problem , 2002, PATAT.

[10]  Robert Sabourin,et al.  A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem , 2004, PATAT.

[11]  Edmund K. Burke,et al.  A hybrid evolutionary approach to the university course timetabling problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[12]  Luca Di Gaspero,et al.  Tabu Search Techniques for Examination Timetabling , 2000, PATAT.

[13]  Lale Özbakır,et al.  Artificial Bee Colony Algorithm and Its Application to Generalized Assignment Problem , 2007 .

[14]  Paul McMullan,et al.  An Extended Implementation of the Great Deluge Algorithm for Course Timetabling , 2007, International Conference on Computational Science.

[15]  Wolfgang Banzhaf,et al.  An informed genetic algorithm for the examination timetabling problem , 2010, Appl. Soft Comput..

[16]  Abdul Razak Hamdan,et al.  Solving a Practical Examination Timetabling Problem: A Case Study , 2007, ICCSA.

[17]  Michael Eley,et al.  Ant Algorithms for the Exam Timetabling Problem , 2006, PATAT.

[18]  H A Abbass,et al.  MARRIAGE IN HONEY-BEE OPTIMIZATION (MBO): A HAPLOMETROSIS POLYGYNOUS SWARMING APPROACH , 2001 .

[19]  Gilbert Laporte,et al.  Examination Timetabling: Algorithmic Strategies and Applications , 1994 .

[20]  D. Landa-Silva,et al.  Great deluge with non-linear decay rate for solving course timetabling problems , 2008, 2008 4th International IEEE Conference Intelligent Systems.

[21]  Edmund K. Burke,et al.  A survey of search methodologies and automated system development for examination timetabling , 2009, J. Sched..

[22]  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.

[23]  Manoj Kumar Tiwari,et al.  Swarm Intelligence, Focus on Ant and Particle Swarm Optimization , 2007 .

[24]  Salwani Abdullah,et al.  Construction of Course Timetables Based on Great Deluge and Tabu Search , 2009 .

[25]  Hussein A. Abbass,et al.  A Monogenous MBO Approach to Satisfiability , 2001 .

[26]  Xin-She Yang,et al.  Nature-Inspired Metaheuristic Algorithms , 2008 .

[27]  E. Burke,et al.  AN INVESTIGATION OF VARIABLE NEIGHBOURHOOD SEARCH FOR UNIVERSITY COURSE TIMETABLING , 2005 .

[28]  Graham Kendall,et al.  Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems , 2009, COCOA.

[29]  Sanja Petrovic,et al.  Recent research directions in automated timetabling , 2002, Eur. J. Oper. Res..

[30]  Kathryn A. Dowsland,et al.  Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..

[31]  Graham Kendall,et al.  Tabu exponential Monte-Carlo with counter heuristic for examination timetabling , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

[32]  Ersan Ersoy,et al.  Memetic Algorithms and Hyperhill-climbers , 2008 .

[33]  Ben Paechter,et al.  Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition , 2010, INFORMS J. Comput..

[34]  Salwani Abdullah,et al.  Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem , 2009, RSKT.

[35]  Alain Hertz,et al.  Ants can colour graphs , 1997 .

[36]  Edmund K. Burke,et al.  A Multi-Start Very Large Neighbourhood Search Approach with Local Search Methods for Examination Timetabling , 2006, ICAPS.

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

[38]  Sanja Petrovic,et al.  Hybrid variable neighbourhood approaches to university exam timetabling , 2010, Eur. J. Oper. Res..