A simulated annealing hyper-heuristic methodology for flexible decision support

[1]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[2]  Graham Kendall,et al.  A Genetic Programming Hyper-Heuristic Approach for Evolving 2-D Strip Packing Heuristics , 2010, IEEE Transactions on Evolutionary Computation.

[3]  Edmund K. Burke,et al.  Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems , 2009, J. Oper. Res. Soc..

[4]  Edmund K. Burke,et al.  Analyzing the landscape of a graph based hyper-heuristic for timetabling problems , 2009, GECCO.

[5]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[6]  Paul McMullan,et al.  An Extended Implementation of the Great Deluge Algorithm for Course Timetabling , 2007, International Conference on Computational Science.

[7]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[8]  Mauro Birattari,et al.  An effective hybrid algorithm for university course timetabling , 2006, J. Sched..

[9]  Gleb Belov,et al.  A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..

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

[11]  H. Asmuni.  Fuzzy multiple heuristic orderings for course timetabling , 2005 .

[12]  Gary G. Yen,et al.  A generic framework for constrained optimization using genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.

[13]  Raymond S. K. Kwan,et al.  Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling , 2004, PATAT.

[14]  Fred W. Glover,et al.  A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem , 2004, J. Heuristics.

[15]  Graham Kendall,et al.  Guided Operators for a Hyper-Heuristic Genetic Algorithm , 2003, Australian Conference on Artificial Intelligence.

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

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

[18]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[19]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[20]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

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

[22]  Jonas Mockus,et al.  A Set of Examples of Global and Discrete Optimization , 2000 .

[23]  J. L. Maryak,et al.  Bayesian Heuristic Approach to Discrete and Global Optimization , 1999, Technometrics.

[24]  H. Terashima-Marín,et al.  Evolution of Constraint Satisfaction strategies in examination timetabling , 1999 .

[25]  Emanuel Falkenauer,et al.  Genetic Algorithms and Grouping Problems , 1998 .

[26]  Peter Ross,et al.  Solving a Real-World Problem Using an Evolving Heuristically Driven Schedule Builder , 1998, Evolutionary Computation.

[27]  Gerhard Wäscher,et al.  The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .

[28]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[29]  Gerhard Wäscher,et al.  Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .

[30]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[31]  Jonas Mockus,et al.  Application of Bayesian approach to numerical methods of global and stochastic optimization , 1994, J. Glob. Optim..

[32]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[33]  T. Obremski.  Practical Nonparametric Statistics (2nd ed.) , 1981 .

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

[35]  Graham Kendall,et al.  A Classification of Hyper-heuristic Approaches , 2010 .

[36]  Edmund K. Burke,et al.  Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem , 2007, Metaheuristics.

[37]  Philipp Kostuch,et al.  The University Course Timetabling Problem with a 3-phase approach , 2007 .

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

[39]  Thomas Stützle,et al.  A landscape analysis for a Hybrid Approximate Algorithm on a Timetabling Problem , 2004 .

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

[41]  Sanja Petrovic,et al.  A time-predefined approach to course timetabling , 2003 .

[42]  N. Given.  Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyper-heuristics , 2003 .

[43]  Eric Soubeiga,et al.  Development and application of hyperheuristics to personnel scheduling , 2003 .

[44]  Hiroaki Kitano,et al.  Designing Neural Networks Using Genetic Algorithms with Graph Generation System , 1990, Complex Syst..

[45]  J. Mockus,et al.  The Bayesian approach to global optimization , 1989 .

[46]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..