A greedy gradient-simulated annealing selection hyper-heuristic

[1]  Michel Gendreau,et al.  Hyper-heuristics: a survey of the state of the art , 2013, J. Oper. Res. Soc..

[2]  Per Kristian Lehre,et al.  A runtime analysis of simple hyper-heuristics: to mix or not to mix operators , 2013, FOGA XII '13.

[3]  Marcone J. F. Souza,et al.  A SA-VNS approach for the High School Timetabling Problem , 2012, Electron. Notes Discret. Math..

[4]  Ender Özcan,et al.  The Interleaved Constructive Memetic Algorithm and its application to timetabling , 2012, Comput. Oper. Res..

[5]  Ender Özcan,et al.  HySST: Hyper-heuristic Search Strategies and Timetabling , 2012 .

[6]  Graham Kendall,et al.  A simulated annealing hyper-heuristic methodology for flexible decision support , 2012, 4OR.

[7]  Luca Di Gaspero,et al.  Evaluation of a Family of Reinforcement Learning Cross-Domain Optimization Heuristics , 2012, LION.

[8]  Sanja Petrovic,et al.  HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search , 2011, EvoCOP.

[9]  Simon Kristiansen,et al.  International Timetabling Competition 2011: An Adaptive Large Neighborhood Search algorithm , 2012 .

[10]  Jörg Homberger,et al.  An Evolutionary Algorithm for High School Timetabling , 2012 .

[11]  Ender Özcan,et al.  A Hyper-Heuristic Based on Random Gradient, Greedy and Dominance , 2011, ISCIS.

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

[13]  Rhyd Lewis,et al.  A survey of metaheuristic-based techniques for University Timetabling problems , 2007, OR Spectr..

[14]  Ender Özcan,et al.  A comprehensive analysis of hyper-heuristics , 2008, Intell. Data Anal..

[15]  Michel Gendreau,et al.  Memory Length in Hyper-heuristics: An Empirical Study , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.

[16]  Ben Paechter,et al.  Metaheuristics for University Course Timetabling , 2007, Evolutionary Scheduling.

[17]  Ender Özcan,et al.  Hill Climbers and Mutational Heuristics in Hyperheuristics , 2006, PPSN.

[18]  Ender Özcan,et al.  An Experimental Study on Hyper-heuristics and Exam Timetabling , 2006, PATAT.

[19]  Sanja Petrovic,et al.  Case-based heuristic selection for timetabling problems , 2006, J. Sched..

[20]  Ender Özcan,et al.  Final exam scheduler - FES , 2005, 2005 IEEE Congress on Evolutionary Computation.

[21]  Graham Kendall,et al.  An Investigation of Automated Planograms Using a Simulated Annealing Based Hyper-Heuristic , 2005 .

[22]  Alexander Nareyek,et al.  Choosing search heuristics by non-stationary reinforcement learning , 2004 .

[23]  A. Alkan,et al.  Memetic algorithms for timetabling , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[24]  Graham Kendall,et al.  A Tabu-Search Hyperheuristic for Timetabling and Rostering , 2003, J. Heuristics.

[25]  Michael Sampels,et al.  A MAX-MIN Ant System for the University Course Timetabling Problem , 2002, Ant Algorithms.

[26]  Luiz Antonio Nogueira Lorena,et al.  A Constructive Evolutionary Approach to School Timetabling , 2001, EvoWorkshops.

[27]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

[28]  David Abramson,et al.  Simulated Annealing Cooling Schedules for the School Timetabling Problem , 1999 .

[29]  Ben Paechter,et al.  Timetabling the Classes of an Entire University with an Evolutionary Algorithm , 1998, PPSN.

[30]  D. de Werra,et al.  The combinatorics of timetabling , 1997 .

[31]  Andrea Schaerf,et al.  REPORT RAPPORT , 2022 .

[32]  Edmund K. Burke,et al.  Selected papers from the First International Conference on Practice and Theory of Automated Timetabling , 1995 .

[33]  Wilhelm Erben,et al.  A Genetic Algorithm Solving a Weekly Course-Timetabling Problem , 1995, PATAT.

[34]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[35]  Alberto Colorni,et al.  A genetic algorithm to solve the timetable problem , 1992 .

[36]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[37]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[38]  Fred Glover,et al.  PROBABILISTIC AND PARAMETRIC LEARNING COMBINATIONS OF LOCAL JOB SHOP SCHEDULING RULES , 1963 .