A tabu search algorithm with controlled randomization for constructing feasible university course timetables

DOI10.1016/J.COR.2020.105007MaRDI QIDQ2664347zbMATH OpenOpenAlexFDO

Authors Mao Chen, Xiangyang Tang, Ting Song, C. Wu, Sanya Liu, Xicheng Peng

Publication date 20 April 2021

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105007

zbMATH Keywords

controlled randomizationtabu searchthreshold mechanismuniversity course timetabling problem

Mathematics Subject Classification ID

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

Recommendations

• A tabu search algorithm to solve a course timetabling problem
• A clique-based algorithm for constructing feasible timetables
• Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
• University course timetabling problem using a heuristic approach based on uniform teaching resources
• Evolutionary Computation in Combinatorial Optimization

Cites work

• A clique-based algorithm for constructing feasible timetables
• A graph-based hyper-heuristic for educational timetabling problems
• A modification of threshold accepting and its application to the quadratic assignment problem
• A survey of metaheuristic-based techniques for university timetabling problems
• A threshold accepting approach to the Open Vehicle Routing problem
• Adaptive tabu search for course timetabling
• An effective hybrid algorithm for university course timetabling
• Automated scheduling and planning. From theory to practice
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• Handbook of metaheuristics
• New methods to color the vertices of a graph
• Optimization by simulated annealing
• Round robin scheduling -- a survey
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Vehicle and crew scheduling for urban bus lines

Cited in

(7)

• Solving university course timetabling problems using constriction particle swarm optimization with local search
• A harmony search algorithm for university course timetabling
• Adaptive tabu search for course timetabling
• University course timetabling problem using a heuristic approach based on uniform teaching resources
• A clique-based algorithm for constructing feasible timetables
• Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
• A university-wide orientation course timetabling model and its modification for pandemic period

This page was built for publication: A tabu search algorithm with controlled randomization for constructing feasible university course timetables

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