A graph-based hyper-heuristic for educational timetabling problems
From MaRDI portal
Publication:2432892
Recommendations
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Effective learning hyper-heuristics for the course timetabling problem
- Linear combinations of heuristics for examination timetabling
- Automated generation of constructive ordering heuristics for educational timetabling
Cites work
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- A tabu search algorithm for computing an operational timetable
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Handbook of metaheuristics
- scientific article; zbMATH DE number 1728534 (Why is no real title available?)
- scientific article; zbMATH DE number 1728536 (Why is no real title available?)
- scientific article; zbMATH DE number 1727365 (Why is no real title available?)
- scientific article; zbMATH DE number 3910116 (Why is no real title available?)
- scientific article; zbMATH DE number 1016767 (Why is no real title available?)
- scientific article; zbMATH DE number 2040652 (Why is no real title available?)
- scientific article; zbMATH DE number 2079883 (Why is no real title available?)
- scientific article; zbMATH DE number 1783852 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Hybrid variable neighbourhood approaches to university exam timetabling
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- Multiple-retrieval case-based reasoning for course timetabling problems
- New methods to color the vertices of a graph
- Nurse rostering problems -- a bibliographic survey.
- Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers
- Recent research directions in automated timetabling
- Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering
- The state of the art of nurse rostering
- University timetabling by constraint-based reasoning: A case study
Cited in
(73)- 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
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Advancing Shannon entropy for measuring diversity in systems
- Practices in timetabling in higher education institutions: a systematic review
- Automated generation of constructive ordering heuristics for educational timetabling
- 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
- Monte Carlo hyper-heuristics for examination timetabling
- A harmony search algorithm for university course timetabling
- Linear combinations of heuristics for examination 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
- A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties
- Recent advances in selection hyper-heuristics
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- Metaheuristics ``In the large
- Adaptive linear combination of heuristic orderings in constructing examination timetables
- Hyper-heuristic approaches for the response time variability problem
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Adaptive tabu search for course timetabling
- Towards a practical engineering tool for rostering
- A survey of metaheuristic-based techniques for university timetabling problems
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- 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 review of hyper-heuristics for educational timetabling
- Fairness in academic course timetabling
- An extraction and expansion approach for graph coloring
- An adaptive flex-deluge approach to university exam timetabling
- Effective learning hyper-heuristics for the course timetabling problem
- Unified encoding for hyper-heuristics with application to bioinformatics
- A step counting hill climbing algorithm applied to university examination timetabling
- Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
- 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
- New variable neighborhood search method for minimum sum coloring problem on simple graphs
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- Exploring the role of graph spectra in graph coloring algorithm performance
- A simulated annealing hyper-heuristic methodology for flexible decision support
- Analysing the robustness of multiobjectivisation approaches applied to large scale optimisation problems
- A Fast, Network-based, Hybrid Heuristic for the Assignment of Students to Schools
- Memetic techniques for examination timetabling
- Adaptive selection of heuristics for improving exam timetables
- A survey of school timetabling research
- A cooperative hyper-heuristic search framework
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- New results on the robust coloring problem
- A multiobjective framework for heavily constrained examination timetabling problems
- Greedy scheduling with custom-made objectives
- Educational timetabling: problems, benchmarks, and state-of-the-art results
- Solving a multiobjective professional timetabling problem using evolutionary algorithms at Mandarine Academy
- Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
- University course timetabling with multi-section courses, room stability and lecturer preferences: an application in a business school
- Improving the extraction and expansion method for large graph coloring
- 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
- A multi-objective evolutionary algorithm for examination timetabling
- Case-based heuristic selection for timetabling problems
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- A university-timetabling problem and its solution using Benders' partitioning---a case study
- Hybrid variable neighbourhood approaches to university exam timetabling
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
This page was built for publication: A graph-based hyper-heuristic for educational timetabling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432892)
