Improved local search approaches to solve the post enrolment course timetabling problem

DOI10.1016/J.EJOR.2017.01.040zbMath1403.90329OpenAlexW2581834059WikidataQ59569411 ScholiaQ59569411MaRDI QIDQ1753553

Say Leng Goh, Nasser R. Sabar, Graham Kendall

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://eprints.nottingham.ac.uk/49525/

zbMATH Keywords

combinatorial optimizationlocal searchtimetablingsimulated annealing with reheating (SAR)tabu search with sampling and perturbation (TSSP)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

An effective hybrid local search approach for the post enrolment course timetabling problem ⋮ A multi-objective mixed integer linear programming model for thesis defence scheduling ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results ⋮ A matheuristic for customized multi-level multi-criteria university timetabling ⋮ Metaheuristics ``In the large ⋮ A decomposition-based algorithm for the double row layout problem ⋮ An assignment problem and its application in education domain: a review and potential path

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• An introduction to timetabling
• An effective hybrid algorithm for university course timetabling
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Solving the post enrolment course timetabling problem by ant colony optimization
• Future paths for integer programming and links to artificial intelligence
• Variants of simulated annealing for the examination timetabling problem
• A graph coloring heuristic using partial solutions and a reactive tabu scheme
• A survey of metaheuristic-based techniques for university timetabling problems
• A time-predefined approach to course timetabling
• Equation of State Calculations by Fast Computing Machines

This page was built for publication: Improved local search approaches to solve the post enrolment course timetabling problem