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

DOI10.1080/10556788.2016.1233970MaRDI QIDQ5268943zbMATH OpenOpenAlexFDO

Authors Xuehao Feng, Yuna Lee, Ilkyeong Moon

Publication date 21 June 2017

Published in Optimization Methods \& 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

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11)

Recommendations

• A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
• Evolutionary Computation in Combinatorial Optimization
• Hybrid genetic algorithms for timetabling
• Diploid code genetic algorithm used to solve UTP
• A genetic algorithm for a university weekly courses timetabling problem

Cites work

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

Cited in

(4)

• Evolutionary Computation in Combinatorial Optimization
• A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem
• A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies
• Diploid code genetic algorithm used to solve UTP

This page was built for publication: An integer program and a hybrid genetic algorithm for the university timetabling problem

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