Improved local search approaches to solve the post enrolment course timetabling problem

QR Code

Improved local search approaches to solve the post enrolment course timetabling problem

In this work, we are addressing the post enrollment course timetabling (PE-CTT) problem. We combine different local search algorithms into an iterative two stage procedure. In the first stage, Tabu Search with Sampling and Perturbation (TSSP) is used to generate feasible solutions. In the second sta...

Full description

Bibliographic Details
Main Authors:	Goh, Say Leng, Kendall, G., Sabar, Nasser R.
Format:	Article
Published:	2017
Subjects:	Timetabling Combinatorial optimization Local search Tabu Search with Sampling and Perturbation (TSSP) Simulated Annealing with Reheating (SAR)
Online Access:	https://eprints.nottingham.ac.uk/49525/

Similar Items

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

An adaptive evolutionary multi-objective approach based on simulated annealing
by: Li, Hui, et al.
Published: (2011)

Application of Heuristic Methods To Portfolio Optimisation: An Object-Oriented Approach
by: Adedoyin, Olatunde
Published: (2008)

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

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)

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)

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

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

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

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

A stochastic local search algorithm with adaptive acceptance for high-school timetabling
by: Kheiri, Ahmed, et al.
Published: (2014)

Move Acceptance in Local Search Metaheuristics for Cross-domain Heuristic Search
by: Jackson, Warren G
Published: (2021)

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

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems
by: Xu, Ying, et al.
Published: (2013)

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

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

A hybrid evolutionary approach to the nurse rostering problem
by: Bai, Ruibin, et al.
Published: (2010)

Evolutionary squeaky wheel optimization: a new framework for analysis
by: Li, Jingpeng, et al.
Published: (2011)

Optimization of the event timetable scheduling problem with user preferences
by: Kong, Jin Wern Justin
Published: (2017)

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)

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

A survey in semantic search technologies
by: Dong, Hai, et al.
Published: (2008)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

An Estimation of Distribution Algorithm with Intelligent Local Search for Rule-based Nurse Rostering
by: Aickelin, Uwe, et al.
Published: (2007)

Search literacy: learning to search to learn
by: Wilson, Max L., et al.
Published: (2016)

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

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

A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices
by: Cui, Tianxiang, et al.
Published: (2020)

Domain transformation approach to deterministic optimization of examination timetables
by: Abdul Rahim, Siti, et al.
Published: (2013)

Case-based reasoning for course timetabling problems
by: Qu, Rong
Published: (2002)

Analysing Similarity in Exam Timetabling
by: Burke, Edmund, et al.
Published: (2004)

Similarity- and substructure-based development of β2-adrenergic receptor ligands based on unusual scaffolds
by: Schmidt, Denis, et al.
Published: (2017)

A multi-agent based cooperative approach to scheduling and routing
by: Martin, Simon, et al.
Published: (2016)

Parameter tuning for cross-domain search
by: Gumus, Duriye Betul
Published: (2020)

Microsoft launches Windows Live seach engine
Published: (2008)

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

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

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