Comparison of metaheuristic algorithms for examination timetabling problem

DOI10.1007/BF02936173zbMath1129.90318OpenAlexW2133875025MaRDI QIDQ1885092

Zahra Naji-Azimi

Publication date: 28 October 2004

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

Full work available at URL: https://doi.org/10.1007/bf02936173

zbMATH Keywords

simulated annealingtabu searchTimetablinggenetic algorithm, ant colony system.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) 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 ⋮ A column generation approach for solving the examination-timetabling problem

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
• Reducibility among Combinatorial Problems
• Equation of State Calculations by Fast Computing Machines
• An upper bound for the chromatic number of a graph and its application to timetabling problems