Artificial bee colony search algorithm for examination timetabling problems

International Journal of Physical Sciences

Volumn 6, Issue 17, 2011, Pages 4264-4272

  Alzaqebah, Malek ^a   Abdullah, Salwani ^a  

^a UNIVERSITI KEBANGSAAN MALAYSIA   (Malaysia)

Author keywords

Artificial bee colony; Examination timetabling; Honeybees algorithms; Metaheuristics

Indexed keywords

EID: 80052995167     PISSN: 19921950     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. Abdullah S, Burke EK, McCollum B (2007). Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. In Proceedings of MIC05: The 6th Metaheuristic International Conference, Vienna, Austria, In Metaheuristics - Progress in Complex Systems Optimization, Computer Science Interfaces Book Series, Springer Operations Research, ISBN-13:978-0-387-71919-1, 39: 153-169.
2. Atsuta M, Nonobe N, Ibaraki T (2007). ITC2007 Track 1: An Approach using general CSP solver. www.cs.qub.ac.uk/itc2007.
3. Baykasoglu A, Ozbakir L, Tapkan P (2007). Artificial bee colony algorithm and its application to generalized assignment problem. In Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, TSC. Felix and KT. Mano j, Eds. Itech Education and Publishing, Vienna, Austria, 113-143.
4. Burke EK, Bykov Y, Newall JP, Petrovic S (2004). A time-predefined local search approach to exam timetabling problem. IIE Trans., 36(6): 509-528.
5. Burke EK, Eckersley A, McCollum B, Petrovic S, Qu R (2010). Hybrid Variable Neighbourhood Approaches to Exam Timetabling. Eur. J. Oper. Res., 206: 46-53.
6. Burke EK, Elliman DG, Ford PH, Weare RF (1996). Examination Timetabling in British Universities - A Survey. In EK. Burke and P.Ross (eds.), The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference, pp 76-90. Lect. Notes Comput. Sci., p. 1153. Springer.
7. Caramia M, Dell'Olmo P, Italiano GF (2001). New algorithms for examination timetabling. Algorithms Engineering 4th International Workshop, Proceedings WAE 2001, Saarbrücken, Germany, Springer Lect. Notes Comput. Sci., 1982: 230-241.
8. Carter MW (1986). A survey of practical applications of examination timetabling algorithms. J. Oper. Res., 34(2): 193-202.
9. Carter MW, Laporte G, Lee SY (1996). Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res., 47: 373-383.
10. Gogos C, Alefragis P, Housos E (2010). An improved multi-staged algorithmic process for the solution of the examination timetabling problem, Annals of Operations Research. DOI: 10.1007/s10479-010-0712-3.
11. Gogos C, Goulas G, Alefragis P, Housos E (2009). Pursuit of Better Results for the Examination Timetabling Problem Using Grid Resources, CI-Sched '09. IEEE Symposium Computat. Intell. Scheduling, pp. 48-53.
12. Kang F, Li J, Xu Q (2009). Structural inverse analysis by hybrid simplex artificial bee colony algorithms, Comput. Struct., 87: 861-870.
13. Karaboga D (2005). An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
14. Karaboga D, Basturk B (2007). A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm, J. Glob. Optim., 39: 459-471.
15. Lewis R (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1): 167-190.
16. McCollum B, Schaerf A, Paechter B, McMullan P, Lewis R, Parkes AJ, Gaspero L, Qu R, Burke EK (2010). Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS. J. Comput., 22: 120-130.
17. Muller T (2009). ITC2007 Solver Description: A Hybrid Approach. Ann. Oper. Res., 172(1): 429-446.
18. Pillay A (2007). Developmental approach to the examination timetabling problem. www.cs.qub.ac.uk/itc2007.
19. Qu R, Burke EK, McCollum B, Merlot LTG (2009). A survey of search methodologies and automated system development for examination timetabling. J. Scheduling, 12: 55-89.
20. Sabar NR, Ayob M, Kendall G (2009). Solving examination timetabling problems using honey-bee mating optimization (ETP-HBMO). In: Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pp. 399-408.
21. Yang Y, Petrovic S (2004). A novel similarity measure for heuristic selection in examination timetabling, Lecture Notes Comput. Sci., 3616: 334-353. 2005 Practice and Theory of Automated Timetabling V.