A graph-based hyper-heuristic for educational timetabling problems
From MaRDI portal
Publication:2432892
DOI10.1016/j.ejor.2005.08.012zbMath1137.90602OpenAlexW2086726443MaRDI QIDQ2432892
Barry McCollum, Sanja Petrovic, Rong Qu, Amnon Meisels, Edmund Kieran Burke
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/346/1/rxqEJOR.pdf
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items
A review of hyper-heuristics for educational timetabling, Fairness in academic course timetabling, A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems, A survey of search methodologies and automated system development for examination timetabling, Effective learning hyper-heuristics for the course timetabling problem, Unified encoding for hyper-heuristics with application to bioinformatics, Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling, A multi-objective evolutionary algorithm for examination timetabling, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, A step counting hill climbing algorithm applied to university examination timetabling, A decomposed metaheuristic approach for a real-world university timetabling problem, Adaptive tabu search for course timetabling, Operational research in education, An iterated multi-stage selection hyper-heuristic, A column generation approach for solving the examination-timetabling problem, Towards objective measures of algorithm performance across instance space, An exact algorithm with learning for the graph coloring problem, Random partial neighborhood search for the post-enrollment course timetabling problem, A hyper-heuristic approach to sequencing by hybridization of DNA sequences, A tabu search algorithm with controlled randomization for constructing feasible university course timetables, Decomposition-based hyperheuristic approaches for the bi-objective cold chain considering environmental effects, A cooperative hyper-heuristic search framework, Case-based heuristic selection for timetabling problems, Generalized hyper-heuristics for solving 2D regular and irregular packing problems, Recent advances in selection hyper-heuristics, A multiobjective framework for heavily constrained examination timetabling problems, Greedy scheduling with custom-made objectives, Grouping products for the optimization of production processes: a case in the steel manufacturing industry, New variable neighborhood search method for minimum sum coloring problem on simple graphs, Exploring the role of graph spectra in graph coloring algorithm performance, Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems, New results on the robust coloring problem, An Adaptive Flex-Deluge Approach to University Exam Timetabling, A simulated annealing hyper-heuristic methodology for flexible decision support, Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm, Advancing Shannon entropy for measuring diversity in systems, Memetic techniques for examination timetabling, Adaptive selection of heuristics for improving exam timetables, A survey of school timetabling research, Practices in timetabling in higher education institutions: a systematic review, Automated generation of constructive ordering heuristics for educational timetabling, Towards a practical engineering tool for rostering, Metaheuristics ``In the large, Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems, Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system, A methodology for determining an effective subset of heuristics in selection hyper-heuristics, An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables, A survey of metaheuristic-based techniques for university timetabling problems, A university-timetabling problem and its solution using Benders' partitioning---a case study, Adaptive linear combination of heuristic orderings in constructing examination timetables, Monte Carlo hyper-heuristics for examination timetabling, A harmony search algorithm for university course timetabling, Applying the threshold accepting metaheuristic to~curriculum based course timetabling, A new model for automated examination timetabling, Coloring large graphs based on independent set extraction, Hybrid variable neighbourhood approaches to university exam timetabling, Improving the extraction and expansion method for large graph coloring, Hyper-heuristic approaches for the response time variability problem, The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution, A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem, Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems, Polynomial reduction of time-space scheduling to time scheduling, A memetic algorithm for graph coloring, A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems, AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING, A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Hybrid variable neighbourhood approaches to university exam timetabling
- A tabu search algorithm for computing an operational timetable
- Nurse rostering problems -- a bibliographic survey.
- Recent research directions in automated timetabling
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- The state of the art of nurse rostering
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- New methods to color the vertices of a graph
- University timetabling by constraint-based reasoning: A case study
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Multiple-retrieval case-based reasoning for course timetabling problems
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Handbook of metaheuristics
- Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers
