An effective hybrid algorithm for university course timetabling

DOI10.1007/S10951-006-8495-8zbMath1154.90428OpenAlexW2108432292WikidataQ62672044 ScholiaQ62672044MaRDI QIDQ880559

Marco Chiarandini, Olivia Rossi-Doria, Mauro Birattari, Krzysztof Socha

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-006-8495-8

zbMATH Keywords

Algorithm engineeringMetaheuristicsLocal search methodsHybrid algorithmsExperimental methodologyUniversity course timetabling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (23)

The consultation timetabling problem at Danish high schools ⋮ Elective course student sectioning at Danish high schools ⋮ A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem ⋮ Adaptive tabu search for course timetabling ⋮ Developing compact course timetables with optimized student flows ⋮ Random partial neighborhood search for the post-enrollment course timetabling problem ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ A tabu search algorithm with controlled randomization for constructing feasible university course timetables ⋮ A simulated annealing hyper-heuristic methodology for flexible decision support ⋮ A fuzzy random resource-constrained scheduling model with~multiple projects and its application to a working procedure in a large-scale water conservancy and hydropower construction project ⋮ Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm ⋮ Improved local search approaches to solve the post enrolment course timetabling problem ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A harmony search algorithm for university course timetabling ⋮ Local search and constraint programming for the post enrolment-based course timetabling problem ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Solving the post enrolment course timetabling problem by ant colony optimization ⋮ On the performance of scatter search for post-enrolment course timetabling problems ⋮ A Simulated Annealing Genetic Algorithm for Solving Timetable Problems ⋮ Polynomial reduction of time-space scheduling to time scheduling ⋮ An overview of curriculum-based course timetabling

Uses Software

• Hyperheuristics
• EasyLocal++
• race
• HotFrame

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• An introduction to timetabling
• A robust simulated annealing based examination timetabling system.
• Recent research directions in automated timetabling
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• A time-predefined approach to course timetabling
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Evolutionary Computation in Combinatorial Optimization
• Practice and theory of automated timetabling III. 3rd international conference, PATAT 2000, Konstanz, Germany, August 16--18, 2000. Selected papers

This page was built for publication: An effective hybrid algorithm for university course timetabling