Luca Di Gaspero

Learn More
A recent trend in local search concerns the exploitation of several different neighbourhood functions so as to increase the ability of the algorithm to navigate the search space. In this work we investigate the use of local search techniques based on various combinations of neighbourhood functions, and we apply it to a timetabling problem. In particular, we(More)
B. McCollum, P. McMullan School of Electronics, Electrical Engineering and Computer Science, Queen’s University, Belfast, N. Ireland, BT7 1NN, b.mccollum@qub.ac.uk B. Paechter Centre for Emergent Computing, Napier University, Edinburgh, EH10 5DT, Scotland, b.paechter@napier.ac.uk R. Lewis Cardiff Business School, Prifysgol Caerdydd / Cardiff University,(More)
Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities(More)
The Traveling Tournament Problem (TTP) is a combinatorial problem that combines features from the traveling salesman problem and the tournament scheduling problem. We propose a family of tabu search solvers for the solution of TTP that make use of complex combination of many neighborhood structures. The different neighborhoods have been thoroughly analyzed(More)
Local search is an optimization paradigm that has recently gained interest also in the constraint programming community as a method to improve constraint-based search strategies. We present EASYLOCAL++, an object-oriented framework to be used as a general tool for the development of local search algorithms. The abstract classes that compose the framework(More)
We propose a set of formulations for the Curriculum-Based Course Timetabling problem, with the aim of “capturing” many real-world formulations, and thus encouraging researchers to “reduce” their specific problems to one of them, gaining the opportunity to compare and assess their results. This work is accompanied by a web site that maintains all the(More)