A cellular memetic algorithm for the examination timetabling problem

DOI10.1016/J.COR.2018.02.009zbMath1391.90284OpenAlexW2791928761MaRDI QIDQ1652614

Nuno Leite, Agostinho C. Rosa, Carlos M. Fernandes, Fernando Melício

Publication date: 11 July 2018

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

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

zbMATH Keywords

timetablingmemetic algorithmsexamination timetablingcellular evolutionary algorithmITC 2007 benchmark setthreshold acceptance algorithmuncapacitated Toronto benchmark set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ Modeling and solving the problem of scheduling university exams in terms of new constraints on the conflicts of professors' exams and the concurrence of exams with common questions ⋮ Exact and metaheuristic methods for a real-world examination timetabling problem ⋮ Educational timetabling: problems, benchmarks, and state-of-the-art results

Uses Software

• ParaDisEO
• JCell

Cites Work

• Unnamed Item
• Unnamed Item
• A review of hyper-heuristics for educational timetabling
• Fairness in academic course timetabling
• Operational research in education
• Hybrid bee colony optimization for examination timetabling problems
• An adaptive artificial bee colony and late-acceptance hill-climbing algorithm for examination timetabling
• An introduction to timetabling
• A survey of search methodologies and automated system development for examination timetabling
• A multi-objective evolutionary algorithm for examination timetabling
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• Cellular genetic algorithms
• Applying evolutionary computation to the school timetabling problem: The Greek case
• Hybrid variable neighbourhood approaches to university exam timetabling
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• The combinatorics of timetabling
• Shuffled complex evolution approach for effective and efficient global minimization
• A robust simulated annealing based examination timetabling system.
• An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem
• A new model for automated examination timetabling
• ITC2007 solver description: a hybrid approach
• A survey of metaheuristic-based techniques for university timetabling problems
• Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
• Novel Local-Search-Based Approaches to University Examination Timetabling
• Handbook of Natural Computing
• New methods to color the vertices of a graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Handbook of metaheuristics

This page was built for publication: A cellular memetic algorithm for the examination timetabling problem