An integer program and a hybrid genetic algorithm for the university timetabling problem

DOI10.1080/10556788.2016.1233970zbMath1365.90136MaRDI QIDQ5268943

Yuna Lee, Xuehao Feng, Il-Kyeong Moon

Publication date: 21 June 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1233970

zbMATH Keywords

hybrid genetic algorithmmixed integer linear programperiodicity constraintconsecutiveness constraintuniversity timetabling problem

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90B90: Case-oriented studies in operations research

Cites Work

• Effective learning hyper-heuristics for the course timetabling problem
• A heuristic for solving large bin packing problems in two and three dimensions
• Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
• Container packing problem with balance constraints
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• An introduction to timetabling
• Application of a real-world university-course timetabling model solved by integer programming
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
• A classroom/time assignment model
• Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
• A logic approach to the resolution of constraints in timetabling
• Distribution requirements and compactness constraints in school timetabling
• A tabu search algorithm for computing an operational timetable
• An integer programming formulation for a case study in university timetabling.
• A harmony search algorithm for university course timetabling
• Curriculum based course timetabling: new solutions to Udine benchmark instances
• Efficient solutions for a university timetabling problem through integer programming
• A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
• A computational approach to enhancing course timetabling with integer programming
• A decomposed metaheuristic approach for a real-world university timetabling problem
• Adaptive tabu search for course timetabling
• A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem
• A clique-based algorithm for constructing feasible timetables
• A linear algorithm for computing the optimum university timetable
• School Timetabling—A Case in Large Binary Integer Linear Programming
• University timetabling by constraint-based reasoning: A case study
• A hybrid genetic algorithm for the container loading problem