Skip to main content

Research Repository

Advanced Search

All Outputs (6)

A tensor-based selection hyper-heuristic for cross-domain heuristic search (2014)
Journal Article
Asta, S., & Özcan, E. (2015). A tensor-based selection hyper-heuristic for cross-domain heuristic search. Information Sciences, 299, https://doi.org/10.1016/j.ins.2014.12.020

Hyper-heuristics have emerged as automated high level search methodologies that manage a set of low level heuristics for solving computationally hard problems. A generic selection hyper-heuristic combines heuristic selection and move acceptance metho... Read More about A tensor-based selection hyper-heuristic for cross-domain heuristic search.

A constructive approach to examination timetabling based on adaptive decomposition and ordering (2014)
Journal Article
Abdul-Rahman, S., Burke, E., Bargiela, A., McCollum, B., & Özcan, E. (2014). A constructive approach to examination timetabling based on adaptive decomposition and ordering. Annals of Operations Research, 218(1), https://doi.org/10.1007/s10479-011-0999-8

In this study, we investigate an adaptive decomposition and ordering strategy that automatically divides examinations into difficult and easy sets for constructing an examination timetable. The examinations in the difficult set are considered to be h... Read More about A constructive approach to examination timetabling based on adaptive decomposition and ordering.

A stochastic local search algorithm with adaptive acceptance for high-school timetabling (2014)
Journal Article
Kheiri, A., Özcan, E., & Parkes, A. J. (2016). A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Annals of Operations Research, 239(1), 135-151. https://doi.org/10.1007/s10479-014-1660-0

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 yea... Read More about A stochastic local search algorithm with adaptive acceptance for high-school timetabling.

A genetic programming hyper-heuristic for the multidimensional knapsack problem (2014)
Journal Article
Drake, J. H., Hyde, M., Khaled, I., & Özcan, E. (2014). A genetic programming hyper-heuristic for the multidimensional knapsack problem. Kybernetes, 43(9/10), https://doi.org/10.1108/K-09-2013-0201

Purpose: Hyper-heuristics are a class of high-level search techniques which operate on a search space of heuristics rather than directly on a search space of solutions. The purpose of this paper is to investigate the suitability of using genetic prog... Read More about A genetic programming hyper-heuristic for the multidimensional knapsack problem.

Constructing constrained-version of magic squares using selection hyper-heuristics (2014)
Journal Article
Kheiri, A., & Özcan, E. (2014). Constructing constrained-version of magic squares using selection hyper-heuristics. Computer Journal, 57(3), https://doi.org/10.1093/comjnl/bxt130

A square matrix of distinct numbers in which every row, column and both diagonals have the same total is referred to as a magic square. Constructing a magic square of a given order is considered a difficult computational problem, particularly when ad... Read More about Constructing constrained-version of magic squares using selection hyper-heuristics.

Adaptive linear combination of heuristic orderings in constructing examination timetables (2014)
Journal Article
Abdul-Rahman, S., Bargiela, A., Burke, E., Özcan, E., McCollum, B., & McMullan, P. (2014). Adaptive linear combination of heuristic orderings in constructing examination timetables. European Journal of Operational Research, 232(2), https://doi.org/10.1016/j.ejor.2013.06.052

In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a heuristic modifier to address the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specifi... Read More about Adaptive linear combination of heuristic orderings in constructing examination timetables.