In this paper, we investigate variable neighbourhood search (VNS) approaches for the university examination timetabling problem. In addition to a basic VNS method, we introduce variants of the technique with different initialisation methods including a biased VNS and its hybridisation with a...

In the present work, the dechanneling of protons in Si [110] is studied combining theoretical Monte-Carlo and phenomenological simulation results in the energy range E <Subscript> p </Subscript>=1.8-2.4 MeV. The applicability of a Gompertz type sigmoidal dechanneling function, with two parameters, k and x<Subscript>c</Subscript>, which...</subscript></subscript>

In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions...

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 specific problem data. Two graph coloring heuristics...