Olivia Rossi-Doria

TL;DR: In this paper, an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem is presented. And the results show that no metaheuristic is best on all the timetabling instances considered.

TL;DR: This article analyzes the performance of metaheuristics on the vehicle routing problem with stochastic demands (VRPSD) and explores the hybridization of the metaheuristic by means of two objective functions which are surrogate measures of the exact solution quality.

TL;DR: A hybrid metaheuristic algorithm is described and analysed which was developed under the very same rules and deadlines imposed by the competition and outperformed the official winner and shows that the systematic design of hybrid algorithms through an experimental methodology leads to high performing algorithms for hard combinatorial optimisation problems.

TL;DR: The work presented in this thesis concerns the problem of timetabling at universities – particularly course-timetabling, and examines the various ways in which metaheuristic techniques might be applied to these sorts of problems using a "twostaged" algorithmic approach.

TL;DR: In this paper, the authors show that a good choice is using the length of the a priori tour as a fast approximation of the objective, to be used in the local search of the several metaheuristics analyzed.