Adaptive linear combination of heuristic orderings in constructing examination timetables

European Journal of Operational Research

Volumn 232, Issue 2, 2014, Pages 287-297

  Abdul Rahman, Syariza ^a,b   Bargiela, Andrzej ^b   Burke, Edmund K ^c   Özcan, Ender ^b   McCollum, Barry ^d   McMullan, Paul ^d  

^a UNIVERSITI UTARA MALAYSIA   (Malaysia)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^c UNIVERSITY OF STIRLING   (United Kingdom)

^d QUEEN'S UNIVERSITY BELFAST   (United Kingdom)

Author keywords

Constructive heuristic; Examination timetabling; Graph colouring; Linear combinations

Indexed keywords

CONSTRUCTIVE HEURISTIC; EXAMINATION TIMETABLING; GRAPH COLOURING; HEURISTIC ORDERING; LINEAR COMBINATIONS; SATURATION DEGREE; SOLUTION QUALITY; SPECIFIC PROBLEMS;

GRAPH THEORY;

SCHEDULING;

EID: 84883779527     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.06.052     Document Type: Article

References (32)

1. H. Asmuni, E.K. Burke, J.M. Garibaldi, B. McCollum, and A.J. Parkes An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables Computers and Operations Research 36 4 2009 981 1001
2. E.K. Burke, Y. Bykov, J.P. Newall, and S. Petrovic A time-predefined local search approach to exam timetabling problem IIE Transactions 36 6 2004 509 528
3. E.K. Burke, A.J. Eckersley, B. McCollum, S. Petrovic, and R. Qu Hybrid variable neighbourhood approaches to university exam timetabling European Journal of Operational Research 206 1 2010 46 53
4. E.K. Burke, D. Elliman, P.H. Ford, and R.F. Weare Examination timetabling in British universities: A survey Selected papers from the first international conference on practice and theory of automated timetabling 1996 Springer-Verlag
5. E.K. Burke, J. Kingston, and D. de Werra Applications to timetabling J. Gross, J. Yellen, Handbook of graph theory 2004 Chapman Hall/CRC Press 445 474
6. E.K. Burke, B. Mccollum, A. Meisels, S. Petrovic, and R. Qu A graph-based hyper-heuristic for educational timetabling problems European Journal of Operational Research 176 2007 177 192
7. E.K. Burke, and J.P. Newall Solving examination timetabling problems through adaptation of heuristic orderings Annals of Operations Research 129 2004 107 134
8. E.K. Burke, S. Petrovic, and R. Qu Case based heuristic selection for timetabling problems Journal of Scheduling 9 2 2006 115 132
9. E.K. Burke, N. Pham, R. Qu, and J. Yellen Linear combinations of heuristics for examination timetabling Annals of Operations Research 2010 (doi:10.1007/s10479-011-0854-y)
10. E.K. Burke, R. Qu, and A. Soghier Adaptive selection of heuristics for improving exam timetables Annals of Operations Research 2012 (doi:10.1007/s10479-012-1140-3)
11. M. Caramia, P. Dell'Olmo, and G.F. Italiano Novel local search based approaches to university examination timetabling INFORMS Journal of Computing 20 2008 86 99
12. M.W. Carter A survey of practical applications of examination timetabling algorithms Operational Research 34 2 1986 193 202
13. M.W. Carter, G. Laporte, and S. Lee Examination timetabling: Algorithmic strategies and applications Journal of the Operational Research Society 47 3 1996 373 383
14. Ersoy, E., Özcan, E., & Sima Uyar, A. (2007). Memetic algorithms and hyperhill-climbers. In P. Baptiste, G. Kendall, A. M. Kordon, & F. Sourd (Eds.), Lecture notes in computer science: Multidisciplinary international conference on scheduling: Theory and applications: selected papers from the 3rd international conference (pp. 159-166).
15. C. Gogos, P. Alefragis, and E. Housos An improved multi-staged algorithmic process for the solution of the examination timetabling problem Annals of Operations Research 3 2010 1 3
16. D. Johnson Timetabling university examinations Journal of the Operational Research Society 41 1 1990 39 47
17. D.E. Joslin, and D.P. Clements "Squeaky wheel" optimization Journal of Artificial Intelligence Research 10 1999 353 370
18. M.N.M. Kahar, and G. Kendall The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution European Journal of Operational Research 207 2010 557 565
19. McCollum, B., McMullan, P., Parkes, A. J., Burke, E. K., & Abdullah, S. (2009). An extended great deluge approach to the examination timetabling problem. In Proceedings of the 4th multidisciplinary international conference on scheduling: theory and applications (MISTA09), Dublin.
20. B. McCollum, P. McMullan, E.K. Burke, A.J. Parkes, and R. Qu A new model for automated examination timetabling Annals of Operations Research 2 2008 2 3
21. T. Müller ITC2007 solver description: A hybrid approach Annals of Operations Research 172 1 2009 429 446
22. Müller, T. (2008). ITC 2007: Solver description. Practice and theory of automated timetabling (PATAT 2008), Montreal, 19-22 August 2008.
23. Z. Naji Azimi Hybrid heuristics for examination timetabling problem Applied Mathematics and Computation 163 2 2005 705 733
24. N. Pillay, and W. Banzhaf A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem European Journal of Operational Research 197 2 2009 482 491
25. R. Qu, E.K. Burke, and B. McCollum Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems European Journal of Operational Research 198 2 2009 392 404
26. R. Qu, E.K. Burke, B. Mccollum, L.T. Merlot, and S.Y. Lee A survey of search methodologies and automated system development for examination timetabling Journal of Scheduling 12 1 2009 55 89
27. Abdul Rahim, S. K., Bargiela, A., & Qu, R. (2009). Granular modelling of exam to slot allocation. In Proceedings of the 23rd european conference on modelling and simulation (ECMS), Madrid, Spain (pp. 861-866).
28. Abdul Rahman, S., Bargiela, A., Burke, E. K., McCollum, B., & Özcan, E. (2009). Construction of examination timetables based on ordering heuristics. In Proceedings of the 24th international symposium on computer and information sciences (pp. 727-732).
29. D. Schindl Some new hereditary classes where graph coloring remains NP-hard Discrete Mathematics 295 1-3 2005 197 202
30. J. Thompson, and K. Dowsland Variants of simulated annealing for the examination timetabling problem Annals of Operational Research 63 1996 105 128
31. H. Turabieh, and S. Abdullah An integrated hybrid approach to the examination timetabling problem Omega 39 2011 598 607
32. G.M. White, B.S. Xie, and S. Zonjic Using tabu search with longer-term memory and relaxation to create examination timetables European Journal of Operational Research 153 1 2004 80 91