Hybrid heuristics for examination timetabling problem

DOI10.1016/j.amc.2003.10.061zbMath1116.90413OpenAlexW2112634036MaRDI QIDQ1774877

Zahra Naji-Azimi

Publication date: 4 May 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2003.10.061

zbMATH Keywords

Simulated AnnealingTabu SearchGenetic AlgorithmHybrid methodsAnt Colony SystemTimetabling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A survey of search methodologies and automated system development for examination timetabling ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A self-adaptive differential evolution algorithm based on ant system with application to estimate kinetic parameters ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions ⋮ A heuristic method to schedule training programs for small and medium enterprises ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ A new model for automated examination timetabling ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Tabu search for large scale timetabling problems
• Simulated annealing: A tool for operational research
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• Heuristic concentration and tabu search: A head to head comparison
• A robust simulated annealing based examination timetabling system.
• Timetable planning using the constraint-based reasoning
• Recent research directions in automated timetabling
• A generalized class-teacher model for some timetabling problems
• A time-predefined approach to course timetabling
• Student centred school timetabling
• Simulated Annealing – An Annotated Bibliography
• Equation of State Calculations by Fast Computing Machines
• An upper bound for the chromatic number of a graph and its application to timetabling problems

This page was built for publication: Hybrid heuristics for examination timetabling problem