Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
From MaRDI portal
Publication:2460072
DOI10.1007/s00291-006-0034-7zbMath1170.90383OpenAlexW2020608597MaRDI QIDQ2460072
Moshe Dror, Samad Ahmadi, Salwani Abdullah, Edmund Kieran Burke
Publication date: 14 November 2007
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-006-0034-7
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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 ⋮ 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 ⋮ Hybrid bee colony optimization for examination timetabling problems ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ A multiobjective framework for heavily constrained examination timetabling problems ⋮ An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ Cyclic transfers in school timetabling ⋮ A graph-based hyper-heuristic for educational timetabling problems ⋮ Constraint-based very large-scale neighborhood search ⋮ A constructive approach to examination timetabling based on adaptive decomposition and ordering ⋮ Memetic techniques for 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 ⋮ Hybrid variable neighbourhood approaches to university exam timetabling ⋮ 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 ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving examination timetabling problems through adaption of heuristic orderings
- A survey of very large-scale neighborhood search techniques
- An introduction to timetabling
- Case-based heuristic selection for timetabling problems
- Scheduling examinations to reduce second-order conflicts
- A robust simulated annealing based examination timetabling system.
- Recent research directions in automated timetabling
- A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
- Constraint logic programming for examination timetabling
- On a Principle of Chain-exchange for Vehicle-routeing Problems (1-VRP)
- New methods to color the vertices of a graph
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Extended clique initialisation in examination timetabling
