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

DOI10.1016/J.EJOR.2017.01.040MaRDI QIDQ1753553zbMATH OpenOpenAlexWikidataFDO

Authors Say Leng Goh, Graham Kendall, Nasser R. Sabar

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

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

Recommendations

• Local search and constraint programming for the post enrolment-based course timetabling problem
• A Simulated Annealing Genetic Algorithm for Solving Timetable Problems
• Random partial neighborhood search for the post-enrollment course timetabling problem
• A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling

Cites work

• scientific article; zbMATH DE number 1783852 (Why is no real title available?)
• 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
• An effective hybrid algorithm for university course timetabling
• An introduction to timetabling
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• Equation of state calculations by fast computing machines
• Future paths for integer programming and links to artificial intelligence
• Local search and constraint programming for the post enrolment-based course timetabling problem
• Optimization by simulated annealing
• Solving the post enrolment course timetabling problem by ant colony optimization
• Variants of simulated annealing for the examination timetabling problem

Cited in

(11)

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

Describes a project that uses

Uses Software

• Hyperheuristics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753553)