Adaptive large neighborhood search for the curriculum-based course timetabling problem
From MaRDI portal
Publication:2398424
DOI10.1007/s10479-016-2151-2zbMath1368.90072OpenAlexW2292049590WikidataQ59389539 ScholiaQ59389539MaRDI QIDQ2398424
Alexander Schnell, Richard F. Hartl, Alexander Kiefer
Publication date: 16 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2151-2
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning, Educational timetabling: problems, benchmarks, and state-of-the-art results, Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study, Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure, Practices in timetabling in higher education institutions: a systematic review, A matheuristic approach to large-scale avionic scheduling, An adaptive large neighborhood search approach for multiple traveling repairman problem with profits, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, An overview of curriculum-based course timetabling
Cites Work
- Optimization by Simulated Annealing
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A survey of very large-scale neighborhood search techniques
- An introduction to timetabling
- A survey of search methodologies and automated system development for examination timetabling
- A general heuristic for vehicle routing problems
- Decomposition, reformulation, and diving in university course timetabling
- Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
- Curriculum based course timetabling: new solutions to Udine benchmark instances
- Record breaking optimization results using the ruin and recreate principle
- ITC2007 solver description: a hybrid approach
- An overview of curriculum-based course timetabling
- The consultation timetabling problem at Danish high schools
- Adaptive tabu search for course timetabling
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
- A survey of metaheuristic-based techniques for university timetabling problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- General Purpose Simulated Annealing
- New methods to color the vertices of a graph
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Final examination scheduling
