Constructive hyper-heuristics in class timetabling

2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

Volumn 2, Issue , 2005, Pages 1493-1500

  Ross, Peter ^a   Marìn Blázquez, Javier G ^b  

^a EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF MURCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS; PARAMETER ESTIMATION; PROBLEM SOLVING; RANDOM PROCESSES; SEARCH ENGINES; SENSITIVITY ANALYSIS;

BACKTRACKING; CHROMOSOME SIZE; CLASS TIMETABLING; STOCHASTIC PROBLEM SOLVING;

HEURISTIC METHODS;

EID: 27144554137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Stuart J. Russell and Peter Norvig. Artificial Intelligence: a modern approach, chapter 4: Informed Search and Exploration, pages 116-120. Prentice Hall, Upper Saddle River, N.J., 2nd international edition edition, 2003.
2. Peter Ross, Sonia Schulenburg, Javier G. Marín-Blázquez, and Emma Hart. Hyper-heuristics: learning to combine simple heuristics in bin packing problems. In Genetic and Evolutionary Computation Conference, New York, NY, 2002. Winner of the Best Paper Award in the Learning Classifier Systems Category of GECCO 2002.
3. Sonia Schulenburg, Peter Ross, Javier G. Marín-Blázquez, and Emma Hart. A Hyper-Heuristic Approach to Single and Multiple Step Environments in Bin-Packing Problems. In Learning Classifier Systems: From Foundations to Applications, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, 2003. In press.
4. Peter Ross, Javier Marín-Blázquez, Sonia Schulenburg, and Emma Hart. Learning a procedure that can solve hard bin-packing problems: A new ga-based approach to hyper-heuristics. In E. Cantú-Paz et al, editor, Genetic and Evolutionary Computation - GECCO 2003, volume 2 of LNCS, pages 1295-1306. Springer, 2003.
5. Peter Ross, Javier G. Marín-Blázquez, and Emma Hart. Hyper-heuristics applied to class and exam timetabling problems. In CEC 2004, pages 1691-1698, Portland, Oregon, 20-23 June 2004. IEEE Press.
6. European Metaheuristics Network. International timetabling competition. http://www.idsia.ch/Files/ttcomp2002/, 2003.
7. D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22:251-256, 1979.
8. E. Burke and P. Ross, editors. The Practice and Theory of Automated Timetabling Volume 1: Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling. Number 1153 in LNCS. Springer, 1996.
9. E.K. Burke and M. Carter, editors. The Practice and Theory of Automated Timetabling Volume 2: Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling. Number 1408 in LNCS. Springer, 1998.
10. E. Burke and W. Erben, editors. The Practice and Theory of Automated Timetabling 3: Selected Papers of the 3rd International Conference on Practice and Theory of Automated Timetabling. Number 2079 in LNCS. Springer, 2001.
11. E. Burke and P. De Causemacker, editors. The Practice and Theory of Automated Timetabling 4: Selected Papers of the 4th International Conference on Practice and Theory of Automated Timetabling. Number 2740 in LNCS. Springer, 2003.
12. Hugo Terashima-Marín, Peter Ross, and Manuel Valenzuela- Rendón. Evolution of Constraint Satisfaction Strategies in Examination Timetabling. In GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, pages 635-642. Morgan Kaufmann, 1999.