Artificial bee colony algorithm for curriculum-based course timetabling problem

This research article presents the adaption of the Artificial Bee Colony algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Timetabling Competition in 2007 (ITC-2007). An attempt to solve these problems was made via an approach broken down into two parts; first, Saturation Degree (SD) was used to ensure a feasible solution, where the hard constraints are satisfied. Secondly, Artificial Bee Colony Algorithm was used to further improve the results obtained. The algorithm produced very good results, though they were not comparatively better than those previously reported in the literature due to the fact that the algorithm easily gets stuck in the local optimal solution. With proper modification and hybridizing local search-based algorithms this approach could make the algorithm perform better on timetabling problem in general.

[1]  Martin Josef Geiger,et al.  Applying the threshold accepting metaheuristic to curriculum based course timetabling , 2012, Ann. Oper. Res..

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

[3]  Mehmet Fatih Tasgetiren,et al.  A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem , 2011, Inf. Sci..

[4]  Fred W. Glover,et al.  Neighborhood analysis: a case study on curriculum-based course timetabling , 2011, J. Heuristics.

[5]  Nurhan Karaboga,et al.  A new design method based on artificial bee colony algorithm for digital IIR filters , 2009, J. Frankl. Inst..

[6]  Marco E. Lübbecke,et al.  Curriculum Based Course Timetabling: Optimal Solutions to the Udine Benchmark Instances , 2008 .

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

[8]  Dervis Karaboga,et al.  Solving Integer Programming Problems by Using Artificial Bee Colony Algorithm , 2009, AI*IA.

[9]  Sam Kwong,et al.  Gbest-guided artificial bee colony algorithm for numerical function optimization , 2010, Appl. Math. Comput..

[10]  Selcuk Okdem,et al.  Cluster based wireless sensor network routing using artificial bee colony algorithm , 2010, Wireless Networks.

[11]  Dušan Teodorović,et al.  Bee Colony Optimization – a Cooperative Learning Approach to Complex Transportation Problems , 2005 .

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

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

[14]  Dervis Karaboga,et al.  Fuzzy clustering with artificial bee colony algorithm , 2010 .

[15]  Edmund K. Burke,et al.  A branch-and-cut procedure for the Udine Course Timetabling problem , 2012, Ann. Oper. Res..

[16]  Bo Yu,et al.  An Improved Artificial Bee Colony Algorithm for Job Shop Problem , 2010 .

[17]  Dervis Karaboga,et al.  Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems , 2007, IFSA.

[18]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[19]  Dervis Karaboga,et al.  Parameter Tuning for the Artificial Bee Colony Algorithm , 2009, ICCCI.

[20]  Junjie Li,et al.  Structural inverse analysis by hybrid simplex artificial bee colony algorithms , 2009 .

[21]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

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

[23]  Alok Singh,et al.  An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..

[24]  Barry McCollum,et al.  The Second International Timetabling Competition (ITC-2007): Curriculum-based Course Timetabling (Track 3) — preliminary presentation — , 2007 .

[25]  Martin Josef Geiger,et al.  Multi-criteria Curriculum-Based Course Timetabling-A Comparison of a Weighted Sum and a Reference Point Based Approach , 2009, EMO.

[26]  Salwani AbdullahHamza TurabiehBarry,et al.  An Investigation of a Genetic Algorithm and Sequential Local Search Approach for Curriculum-based Course Timetabling Problems , 2009 .

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

[28]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[29]  Tom.  ITC2007 Solver Description: A Hybrid Approach , 2007 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Nguyen Tung Linh,et al.  Application Artificial Bee Colony Algorithm (ABC) for Reconfiguring Distribution Network , 2010, 2010 Second International Conference on Computer Modeling and Simulation.

[32]  Salwani Abdullah,et al.  Incorporating great deluge approach with kempe chain neighbourhood structure for curriculum-based course timetabling problems , 2009, 2009 2nd Conference on Data Mining and Optimization.

[33]  D. Karaboga,et al.  Artificial Bee Colony (ABC) Algorithm on Training Artificial Neural Networks , 2007, 2007 IEEE 15th Signal Processing and Communications Applications.

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