Examination timetabling using late acceptance hyper-heuristics

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 997-1004

  Özcan, Ender ^a   Bykov, Yuri ^a   Birben, Murat ^b   Burke, Edmund K ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b YEDITEPE UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

CANDIDATE SOLUTION; EXAMINATION TIMETABLING; HYPER-HEURISTICS; HYPERHEURISTIC; LOCAL SEARCH; LOW LEVEL; NEW SOLUTIONS; SELECTION METHODS; SINGLE POINT;

EVOLUTIONARY ALGORITHMS; SCHEDULING;

HEURISTIC METHODS;

EID: 70449767215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983054     Document Type: Conference Paper

References (63)

1. E. K. Burke, E. Hart, G. Kendall, J. Newall, P. Ross, S. Schulenburg, "Hyper-heuristics: An emerging direction in modern search technology," in: Glover F, Kochenberger G (eds) Handbook of Metaheuristics, Kluwer, pp. 457-474, 2003.
2. P. Cowling , G. Kendall, E. Soubeiga, "Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation," in EvoWorkShops, Springer, Lecture Notes in Computer Science, vol 4193, pp. 1-10, 2002.
3. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, R. Qu, "A graphbased hyper heuristic for educational timetabling problems," Eur. J. of Op. Res. 176: 177-192, 2007.
4. B. Bilgin, E. Ozcan, E. E. Korkmaz, "An experimental study on hyperheuristics and exam scheduling," in Proc. of the 6th Int.l Conf. on the Practice and Theory of Automated Timetabling, pp.123-140, 2006.
5. E. Ozcan, B. Bilgin, E. E. Korkmaz , "Hill climbers and mutational heuristics in hyperheuristics," in Runarsson, T., Beyer, H.G., Burke, E., J.Merelo-Guervos, J., Whitley, D., Yao, X. (eds.) The 9th Int. Conf. on Parallel Problem Solving from Nature, Reykjavik, Iceland. LNCS, vol.4193. pp. 202-211, 2006.
6. E. Ozcan, B. Bilgin, E. E. Korkmaz , "A comprehensive analysis of hyper-heuristics," Intelligent Data Analysis, 12: 1, pp. 3-23, 2008.
7. A. Cuesta-Canada, L. Garrido, H. Terashima-Marin, "Building hyperheuristics through ant colony optimisation for the 2d bin packing problem," KES'05, LNCS, vol.3684, pp. 654-660, 2005.
8. E. K. Burke, M. R. Hyde, G. Kendall, "Evolving bin packing heuristics with genetic programming," in Parallel Problem Solving from Nature - PPSN IX, LNCS, vol.4193, pp. 860-869, Springer- Verlag, 2006.
9. P. Ross, S. Schulenburg, J. G. Marin-Blázquez, E. Hart, "Hyperheuristics: learning to combine simple heuristics in binpacking problems," in: Proc. of the Genetic and Evo. Comp. Conf., New York, July 9-13, pp. 942-948, 2002.
10. P. Ross, S. Schulenburg, J. G. Marin-Blázquez, E. Hart, "Learning a procedure that can solve hard bin-packing problems: a new ga-based approach to hyper-heuristics," in Proc. Genetic and Evo. Comp., Springer, LNCS, vol.2724, pp. 1295-1306, 2003.
11. G. Kendall, M. Mohamad, "Channel assignment in cellular communication using a great deluge hyper-heuristic," in Proc. of the 12th IEEE Int. Conf. on Networks, vol.2, pp. 769-773, 2004.
12. W. Hart, , P. M. Ross, J. Nelson, " Solving a real-world problem using an evolving heuristically driven schedule builder," Evolutionary Computation, (6)1, 61-80 (1998
13. M. Ayob, G. Kendall, "A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine," in Proc. of the Int. Conf. on Intelligent Technologies, Chiang Mai, Thailand, pp.132-141, 2003.
14. E. K. Burke, G. Kendall, E. Soubeiga, "A tabu-search hyper-heuristic for timetabling and rostering," J.l of Heuristics 9(6), 451-470, 2003.
15. E. K. Burke, S. Petrovic, R. Qu, "Case Based Heuristic Selection for Timetabling Problems," J. of Scheduling 9(2), pp. 115-132, 2006.
16. E. K. Burke, Y. Bykov. "An adaptive flex-deluge approach to university exam timetabling," INFORMS J. on Computing, submitted for publication. 2008a
17. H.-L. Fang, P. M. Ross, D. Corne, "A promising hybrid ga/heuristic approach for open-shop scheduling problems," in Cohn, A. (ed) Proc. of the 11th Eur. Conf. on Artificial Intelligence, John Wiley and Sons Ltd., pp. 590-594, 1994.
18. A. Nareyek, "Choosing search heuristics by non-stationary reinforcement learning," in: Metaheuristics: Computer Decision Making, pp. 523-544. Kluwer Academic Publishers, 2004.
19. E. K. Burke, G. Kendall, D. L. Silva, R. O'Brien, E. Soubeiga, "An ant algorithm hyperheuristic for the project presentation scheduling problem," in Proc. of the IEEE Congress on Evolutionary Computation, Edinburgh, Scotland, pp. 2263-2270, 2005.
20. P. Cowling, G. Kendall and E. Soubeiga, "A hyper-heuristic approach to scheduling a sales summi," in: E. K. Burke and W. Erben (eds.) The 3rd Int. Conf. on the Practice and Theory of Automated Timetabling, Konstanz, Germany, 16-18 August 2000, Lecture Notes in Artificial Intelligence, vol.2079, pp. 176-190, 2001.
21. E. K. Burke, D. L. Silva, E. Soubeiga, "Multi-objective hyperheuristic approaches for space allocation and timetabling," in T. Ibaraki, K. Nonobe, M. Yagiura (eds.) Meta-heuristics: Progress as Real Problem Solvers, selected papers from the 5th Metaheuristics International Conference (MIC 2003), Springer, pp. 129-158, 2005.
22. K. Dowsland, E. Soubeiga, E. K. Burke, "A simulated annealing hyper-heuristic for determining shipper sizes," Eur. J. of Op. Res. (179)3, 759-774, 2005.
23. P. Cowling, G. Kendall and L. Han, "An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem," in Proc. of the 2002 Congress on Evolutionary Computation, pp. 1185-1190, 2002.
24. P. Cowling, G. Kendall and L. Han, "An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem," in Proc. of the 4th Asia-Pacific Conference on Simulated Evolution And Learning, Orchid Country Club, Singapore, pp. 267-271, 2002.
25. G. Kendall and L. Han, "Investigation of a tabu assisted hyperheuristic genetic algorithm," in Proc. of Congress on Evolutionary Computation, vol.3, pp. 2230-2237, 2003.
26. G. Kendall and L. Han, "Guided operators for a hyper-heuristic genetic algorithm," in Tamás D Gedeon and Lance Chun Che Fung (eds.) Proc. of AI-2003: Advances in Artificial Intelligence. The 16th Australian Conference on Artificial Intelligence, Perth, Australia 3-5 Dec 2003, Lecture Notes in Artificial Intelligence, vol.2903, pp. 807- 820. Springer (2003b
27. R. Bai, E. K. Burke, M. Gendreau and G. Kendall, "A simulated annealing hyper-heuristic: adaptive heuristic selection for different vehicle routing problems," in Proc. of the 3rd Multidisciplinary Int. Conf. on Scheduling: Theory and Applications, Paris, France, August 28-31, pp. 67-70, 2007.
28. S. Even, A. Itai and A. Shamir, "On the complexity of timetable and multi-commodity flow," SIAM J. on Computing, vol.5, pp. 691-703, 1976.
29. E. K. Burke and Y. Bykov, "A late acceptance strategy in hillclimbing for exam timetabling problems," presented at PATAT 2008 Conference, Montreal, Canada, August 18-22, 2008b.
30. E. Ozcan, E. Ersoy, "Final Exam Scheduler - FES," in Proc. of 2005 IEEE Congress on Evolutionary Computation, vol.2, pp 1356-1363, 2005.
31. E. K. Burke, D. Elliman, P. Ford, R. Weare, "Examination timetabling in British universities: a survey," in Lecture Notes in Computer Science, vol.1153, E. K. Burke and P. Ross, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 1996, pp. 76-90.
32. Leighton, F. T.: A graph coloring algorithm for large scheduling problems. J. of Res. of the National Bureau of Standards, 84: 489-506 (1979
33. A. J. Cole, "The preparation of examination timetables using a smallstore computer," The Computer J. vol.7, pp. 117-121, 1964.
34. S. Broder, "Final examination scheduling," Communications of the ASM, vol.7, pp.494-498, 1964.
35. T. Arani, V. Lotfi, "A three-phased approach to final exam scheduling," IIE Trans., vol.21, pp. 86-96, 1989.
36. M. W. Carter, G. Laporte, J. W. Chinneck, "A general examination scheduling system," Interfaces, vol.24, pp. 109-120, 1994.
37. D. Corne, H. L. Fang, C. Melish, "Solving the module exam scheduling problem with genetic algorithms," in Proceedings of the 6th International Conference in Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, P. W./H. Chung, G. Lovergrove, M. Ali, Eds. Gordon and Breach Science Publishers, 1993, pp. 370-373.
38. E. K. Burke, D. G. Elliman, R. F. Weare, "A genetic algorithm for university timetabling," presented at the AISB Workshop on Evolutionary Computing, Leeds, UK, April 1994.
39. E. K. Burke, J. P. Newall, R. Weare, "A memetic algorithm for university exam timetabling," in Lecture Notes in Computer Science, vol.1153, E. K. Burke and P. Ross, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 1996, pp. 241-250.
40. E. K. Burke, J. P. Newall, "A multi-stage evolutionary algorithm for the timetabling problem," The IEEE Transactions on Evolutionary Computation, vol.3(1), pp. 63-74, 1999.
41. L. F. Paquete, C.M. Fonseca, "A study of examination timetabling with multiobjective evolutionary algorithms," in Proc 4th Metaheuristics International Conference, 2001, pp. 149-154.
42. W. Erben, "A grouping genetic algorithm for graph colouring and exam timetabling," in Lecture Notes in Computer Science, vol.2079, E. K. Burke and W. Erben, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2001, pp. 132-156.
43. P. Cote, T. Wong, R. Sabouri, "Application of a hybrid multiobjective evolutionary algorithm to the uncapacitated exam proximity problem," in Lecture Notes in Computer Science, vol.3616, E. K. Burke and M. Trick, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2005, pp. 151-168.
44. A. Alkan, E. Ozcan, "Memetic algorithms for timetabling," in: Proc. of IEEE Congress on Evolutionary Computation, pp. 1796-1802, 2003
45. E. Ozcan, "Towards an xml based standard for timetabling problems: TTML," in: Multidisciplinary Scheduling: Theory and Applications, Springer Verlag, 163-187, 2005.
46. J. M. Thompson, K.A. Dowsland, "Variants of simulated annealing for the examination timetabling problem," Annals of Operations Research, vol.63, pp. 105-128, 1996.
47. L. Di Gaspero, A. Schaerf, "Tabu search techniques for examination timetabling," .in Lecture Notes in Computer Science, vol.2079, E. K. Burke and W. Erben, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2001, pp. 104-117.
48. S. Casey, J. Thompson, "GRASPing the examination scheduling problem," in Lecture Notes in Computer Science, vol.2740, E. K. Burke and P. De Causmaecker, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2003, pp. 232-246. (Pubitemid 37095591)
49. S. Petrovic and Y. Bykov, "A multiobjective optimisation technique for exam timetabling based on trajectories," in Lecture Notes in Computer Science, vol.2740, E. K. Burke and P. De Causmaecker, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2003, pp. 181- 194.
50. S. Abdullah, S. Ahmadi, E.K.Burke, M. Dror, "Investigating Ahuja- Orlin's large neighbourhood search for examination timetabling," OR Spectrum, vol.29, pp. 351-372, 2007.
51. H. T. Marin, "Combinations of gas and csp strategies for solving examination timetabling problems," Ph. D. Thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey, 1998.
52. S. Petrovic, Y. Yang, M. Dror, "Case-based selection of initialisation heuristics for metaheuristic examination timetabling," Exp. Sys. with App. (33)3, 772-785, 2007.
53. H. Asmuni, E.K. Burke, J. Garibaldi, "Fuzzy multiple ordering criteria for examination timetabling," .in Lecture Notes in Computer Science, vol.3616, E. K. Burke and M. Trick, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2005, pp. 344-354.
54. Eley, M.: Ant algorithms for the exam timetabling problem. In: The 6th International Conference on Practice and Theory of Automated Timetabling, pp. 167-180. (2006
55. L. Merlot, N. Boland, B. Hughes, P. Stuckey, "A hybrid algorithm for the examination timetabling problem," in Lecture Notes in Computer Science, vol.2740, E. K. Burke and P. De Causmaecker, Eds. Springer-Verlag, Berlin, Heidelberg, New York, 2003, pp. 207-231.
56. M. Caramia, P. Dell'Olmo, G. Italiano, "Novel local-search based approaches to university examination timetabling," INFORMS J. on Computing, vol.20, pp. 86-99, 2008.
57. M. W. Carter, "A survey of practical applications of examination timetabling algorithms," Operations Research, vol.34(2), pp. 193- 201, 1986.
58. E. K. Burke, J. Kingston, K. Jackson, R. Weare, "Automated university timetabling: The state of the art," The Computer J., vol.40(9), pp. 565-571, 1997.
59. A. Schaerf, "A survey of automated timetabling," Artificial Intelligence Review, vol.13(2), pp. 187-1127, 1999.
60. E. K. Burke, S. Petrovic, "Recent research directions in automated timetabling," Europ. J. Oper. Res., vol.140, pp. 266-280, 2002.
61. R. Qu, E. K. Burke, B. McCollum, L. Merlot, S. Lee, "A survey of search methodologies and automated system development for examination timetabling," Journal of Scheduling DOI: 10.1007/s10951-008-0077-5
62. M. Laguna and F. Glover, "What is tabu search?" Colorado Business Review, Vol.6, pp. 5-12, 1996.
63. M. W. Carter, G. Laporte, S. T. Lee, "Examination timetabling: algorithmic strategies and applications," J. of the Op. Res. Soc. 47, 373-383, 1996.