Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

DOI10.1016/j.ejor.2008.10.001zbMath1163.90775OpenAlexW1995123252MaRDI QIDQ1026761

Barry McCollum, Rong Qu, Edmund Kieran Burke

Publication date: 29 June 2009

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

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

zbMATH Keywords

graph colouringadaptivehyper-heuristicexam timetablinggraph colouring heuristicshybridisation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (18)

A review of hyper-heuristics for educational timetabling ⋮ Effective learning hyper-heuristics for the course timetabling problem ⋮ On some applications of the selective graph coloring problem ⋮ Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling ⋮ A column generation approach for solving the examination-timetabling problem ⋮ A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ An integer programming approach to curriculum-based examination timetabling ⋮ A practical three‐phase ILP approach for solving the examination timetabling problem ⋮ Memetic techniques for examination timetabling ⋮ Adaptive selection of heuristics for improving exam timetables ⋮ Metaheuristics ``In the large ⋮ A methodology for determining an effective subset of heuristics in selection hyper-heuristics ⋮ Adaptive linear combination of heuristic orderings in constructing examination timetables ⋮ Applying the threshold accepting metaheuristic to~curriculum based course timetabling ⋮ Hybrid variable neighbourhood approaches to university exam timetabling ⋮ Hyper-heuristic approaches for the response time variability problem ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy

Uses Software

• MCS
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving examination timetabling problems through adaption of heuristic orderings
• An introduction to timetabling
• A survey of search methodologies and automated system development for examination timetabling
• Case-based heuristic selection for timetabling problems
• Hybrid variable neighbourhood approaches to university exam timetabling
• A robust simulated annealing based examination timetabling system.
• Recent research directions in automated timetabling
• On sum coloring of graphs
• MCS---a new algorithm for multicriteria optimisation in constraint programming
• A graph-based hyper-heuristic for educational timetabling problems
• Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling
• A survey of metaheuristic-based techniques for university timetabling problems
• Novel Local-Search-Based Approaches to University Examination Timetabling
• Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems
• Search Methodologies
• New methods to color the vertices of a graph
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Ant colony optimization for the examination scheduling problem
• Reducibility among Combinatorial Problems
• Multiple-retrieval case-based reasoning for course timetabling problems
• Handbook of metaheuristics

This page was built for publication: Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems