Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
From MaRDI portal
Publication:2460072
Recommendations
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- scientific article; zbMATH DE number 1728534
- Local search and constraint programming for a real-world examination timetabling problem
- Novel local-search-based approaches to university examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
- scientific article; zbMATH DE number 3848952
- Coupling Stochastic and Deterministic Local Search in Examination Timetabling
- Exact and metaheuristic methods for a real-world examination timetabling problem
- A multiobjective framework for heavily constrained examination timetabling problems
Cites work
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- A robust simulated annealing based examination timetabling system.
- A survey of very large-scale neighborhood search techniques
- An introduction to timetabling
- Case-based heuristic selection for timetabling problems
- Constraint logic programming for examination timetabling
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Extended clique initialisation in examination timetabling
- scientific article; zbMATH DE number 1728534 (Why is no real title available?)
- scientific article; zbMATH DE number 1305705 (Why is no real title available?)
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- New methods to color the vertices of a graph
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- Recent research directions in automated timetabling
- Scheduling examinations to reduce second-order conflicts
- Solving examination timetabling problems through adaption of heuristic orderings
Cited in
(26)- 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
- Decomposition, reformulation, and diving in university course timetabling
- An integer programming approach to curriculum-based examination timetabling
- Solving the examination timetabling problem in GPUs
- Linear combinations of heuristics for examination timetabling
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- A graph-based hyper-heuristic for educational timetabling problems
- Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
- An adaptive flex-deluge approach to university exam timetabling
- Hybrid bee colony optimization for examination timetabling problems
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
- An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
- Cyclic transfers in school timetabling
- Constraint-based very large-scale neighborhood search
- A constructive approach to examination timetabling based on adaptive decomposition and ordering
- Memetic techniques for examination timetabling
- A multiobjective framework for heavily constrained examination timetabling problems
- Data-driven university examination timetabling with consideration of student stress
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups
- A survey of search methodologies and automated system development for examination timetabling
- A multi-objective evolutionary algorithm for examination timetabling
- Hybrid variable neighbourhood approaches to university exam timetabling
This page was built for publication: Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460072)
