A stochastic local search algorithm with adaptive acceptance for high-school timetabling

QR Code

A stochastic local search algorithm with adaptive acceptance for high-school timetabling

Automating high school timetabling is a challenging task. This problem is a well known hard computational problem which has been of interest to practitioners as well as researchers. High schools need to timetable their regular activities once per year, or even more frequently. The exact solvers migh...

Full description

Bibliographic Details
Main Authors:	Kheiri, Ahmed, Özcan, Ender, Parkes, Andrew J.
Format:	Article
Published:	Springer 2014
Subjects:	timetabling stochastic local search hyper-heuristic restart scheduling
Online Access:	https://eprints.nottingham.ac.uk/32184/

Similar Items

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
by: Asta, Shahriar, et al.
Published: (2016)

High school timetabling using selection hyperheuristics
by: Nasir Ahmed, Leena Hassan
Published: (2014)

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems
by: Qu, Rong, et al.
Published: (2008)

Automated generation of constructive ordering heuristics for educational timetabling
by: Pillay, Nelishia, et al.
Published: (2017)

Non-linear great deluge with reinforcement learning for university course timetabling
by: Obit, Joe Henry, et al.
Published: (2011)

Iterated local search using an add and delete hyper- heuristic for university course timetabling
by: Soria-Alcaraz, Jorge A., et al.
Published: (2016)

Hyper-heuristics and fairness in examination timetabling problems
by: Muklason, Ahmad
Published: (2017)

A time predefined variable depth search for nurse rostering
by: Burke, Edmund, et al.
Published: (2013)

Similarity Measures for Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2003)

Move acceptance in local search metaheuristics for cross-domain search
by: Jackson, Warren G., et al.
Published: (2018)

A constructive approach to examination timetabling based on adaptive decomposition and ordering
by: Abdul-Rahman, Syariza, et al.
Published: (2014)

An iterated multi-stage selection hyper-heuristic
by: Kheiri, Ahmed, et al.
Published: (2016)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

An investigation of Monte Carlo tree search and local search for course timetabling problems
by: Goh, Say Leng
Published: (2017)

Solving high school timetabling problems worldwide using selection hyper-heuristics
by: Ahmed, Leena N., et al.
Published: (2015)

Fuzzy methodologies for automated University timetabling solution construction and evaluation
by: Asmuni, Hishammuddin
Published: (2008)

Improved local search approaches to solve the post enrolment course timetabling problem
by: Goh, Say Leng, et al.
Published: (2017)

Development and application of hyperheuristics to personnel scheduling
by: Soubeiga, Eric
Published: (2003)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

A tensor based hyper-heuristic for nurse rostering
by: Asta, Shahriar, et al.
Published: (2016)

A grouping hyper-heuristic framework: application on graph colouring
by: Elhag, Anas, et al.
Published: (2015)

Crossover control in selection hyper-heuristics: case studies using MKP and HyFlex
by: Drake, John H.
Published: (2014)

Case Based Heuristic Selection for Timetabling Problems
by: Burke, Edmund, et al.
Published: (2006)

Case Based Heuristic Selection for Timetabling Problems
by: Burke, Edmund, et al.
Published: (2006)

Computational study of non-linear great deluge for university course timetabling
by: Obit, Joe Henry, et al.
Published: (2010)

Search with evolutionary ruin and stochastic rebuild: a theoretic framework and a case study on exam timetabling
by: Li, Jingpeng, et al.
Published: (2014)

Constructing constrained-version of magic squares using selection hyper-heuristics
by: Kheiri, Ahmed, et al.
Published: (2014)

Multiple-Retrieval Case-Based Reasoning for Course Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

Multiple-retrieval case-based reasoning for course timetabling problems
by: Burke, Edmund, et al.
Published: (2006)

Comparing hybrid constructive heuristics for university course timetabling
by: Landa-Silva, Dario, et al.
Published: (2011)

Hyper-heuristics: a survey of the state of the art
by: Burke, Edmund, et al.
Published: (2013)

Fairness in examination timetabling: student preferences and extended formulations
by: Muklason, Ahmad, et al.
Published: (2017)

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

The automatic design of hyper-heuristic framework with gene expression programming for combinatorial optimization problems
by: Sabar, Nasar, et al.
Published: (2014)

A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems
by: Sabar, Nasar R., et al.
Published: (2015)

Designing a multi-agent approach system for distributed course timetabling
by: Obit, Joe Henry, et al.
Published: (2011)

Tuning a Simulated Annealing metaheuristic for cross-domain search
by: Jackson, Warren G., et al.
Published: (2017)

A variable neighbourhood search for the workforce scheduling and routing problem
by: Pinheiro, Rodrigo Lankaites, et al.
Published: (2015)