Hybrid variable neighbourhood approaches to university exam timetabling

DOI10.1016/j.ejor.2010.01.044zbMath1188.90090OpenAlexW2031012845MaRDI QIDQ976395

Sanja Petrovic, Barry McCollum, A. J. Eckersley, Rong Qu, Edmund Kieran Burke

Publication date: 11 June 2010

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.044

zbMATH Keywords

genetic algorithmsmeta-heuristicsvariable neighbourhood searchexamination timetabling

Mathematics Subject Classification ID

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

Related Items

Fairness in academic course timetabling ⋮ A survey of search methodologies and automated system development for examination timetabling ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A multi-objective evolutionary algorithm for examination timetabling ⋮ Operational research in education ⋮ A column generation approach for solving the examination-timetabling problem ⋮ A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem ⋮ A cellular memetic algorithm for the examination timetabling problem ⋮ Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling ⋮ Case-based heuristic selection for timetabling problems ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions ⋮ A multiobjective framework for heavily constrained examination timetabling problems ⋮ An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ A practical three‐phase ILP approach for solving the examination timetabling problem ⋮ An Adaptive Flex-Deluge Approach to University Exam Timetabling ⋮ A graph-based hyper-heuristic for educational timetabling problems ⋮ A constructive approach to examination timetabling based on adaptive decomposition and ordering ⋮ Memetic techniques for examination timetabling ⋮ Adaptive selection of heuristics for improving exam timetables ⋮ Practices in timetabling in higher education institutions: a systematic review ⋮ A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem ⋮ New integer linear programming approaches for course timetabling ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ Integer programming techniques for educational timetabling ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ Linear combinations of heuristics for examination timetabling ⋮ A new model for automated examination timetabling ⋮ Managing the tabu list length using a fuzzy inference system: an application to examination timetabling ⋮ Robust university course timetabling problem subject to single and multiple disruptions ⋮ A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem ⋮ A hybrid heuristic of variable neighbourhood descent and great deluge algorithm for efficient task scheduling in grid computing ⋮ Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems ⋮ Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization ⋮ A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems ⋮ A multi-objective combinatorial model of casualty processing in major incident response

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving examination timetabling problems through adaption of heuristic orderings
• A survey of very large-scale neighborhood search techniques
• A survey of search methodologies and automated system development for examination timetabling
• Case-based heuristic selection for timetabling problems
• Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
• Variable neighborhood search
• A robust simulated annealing based examination timetabling system.
• Using tabu search with longer-term memory and relaxation to create examination timetables.
• Recent research directions in automated timetabling
• A new model for automated examination timetabling
• Variants of simulated annealing for the examination timetabling problem
• A graph-based hyper-heuristic for educational timetabling problems
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• Search Methodologies
• A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications