ITC2007 solver description: a hybrid approach
From MaRDI portal
Publication:2267318
DOI10.1007/s10479-009-0644-yzbMath1184.90143OpenAlexW2028480548MaRDI QIDQ2267318
Publication date: 1 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0644-y
Related Items (33)
GOAL solver: a hybrid local search based solver for high school timetabling ⋮ Fairness in academic course timetabling ⋮ Late acceptance hill-climbing for high school timetabling ⋮ A step counting hill climbing algorithm applied to university examination timetabling ⋮ Real-life examination timetabling ⋮ Variable neighborhood search based algorithms for high school timetabling ⋮ Integer programming methods for large-scale practical classroom assignment problems ⋮ Hybrid bee colony optimization for examination timetabling problems ⋮ A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem ⋮ Random partial neighborhood search for the post-enrollment course timetabling problem ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ Adaptive large neighborhood search for the curriculum-based course timetabling problem ⋮ An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling ⋮ Simulated annealing with penalization for university course timetabling ⋮ Elective course planning ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming ⋮ Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems ⋮ Preprocessing and an improved MIP model for examination timetabling ⋮ Integer programming techniques for educational timetabling ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Curriculum based course timetabling: new solutions to Udine benchmark instances ⋮ A new model for automated examination timetabling ⋮ An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007 ⋮ On the performance of scatter search for post-enrolment course timetabling problems ⋮ A SA-VNS approach for the High School Timetabling Problem ⋮ An overview of curriculum-based course timetabling
Uses Software
Cites Work
This page was built for publication: ITC2007 solver description: a hybrid approach
