The group is involved in several projects ranging across several research areas. Here is a list of the currently active projects.


EasyLocal is an object-oriented framework that can be used as a general tool for the development of local search algorithms in C++ and Java. The basic idea of EasyLocal is to capture the essential features of most local search metaheuristics, and their possible compositions. This allows the user to address the design and implementation issues of new heuristics in a more principled way. Furthermore, the framework can easily be customized by an expert user allowing the development of new metaheuristics, and its architecture fully supports the reuse of code.

EasyLocal++ main site

Educational Timetabling

The educational timetabling problem consists in scheduling a sequence of events (typically lectures or examinations) which involves teachers and students in a prefixed period of time, satisfying a set of constraints of various types. Constraints involve, among others, overlapping of events with common participants, capacity of rooms, and student and teacher workload.

The Course Timetabling project | The Generalized Balanced Academic Curriculum project | The Post-Enrollment Course Timetabling


We tackle complex real-world variants of the classical Vehicle Routing Problem and Three Dimensional Packing Problem, with a lot of practical features. In the web site we make available our real-world instances, along with our best results.

The VRP with Time Windows and Carrier-Dependent Costs project | The Multiple Container Loading problem with Bearing Weights and Multi-drop


The patient admission scheduling (PAS) problem consists assigning patients to beds in such a way to maximize both medical treatment effectiveness and patients' comfort. The problem has been defined by Demeester et al. (2010). The Dynamic Patient Admission Scheduling Problem under Uncertainty (PASU) extends the PAS problem, by including several real-world features, such as the presence of emergency patients, uncertainty in stay lengths, and the possibility to delay admissions.

The Dynamic Patient Admission Scheduling Problem under Uncertainty

Portfolio selection

The portfolio selection problem is a computational finance problem that consists in selecting a set of assets, and the share invested in each asset, that provides the investor a minimum required return and minimizes the risk.

The Portfolio selection project

Multi-Agent Distributed Timetabling

TT-MAS is a multi-agent system for distributed course timetabling. We consider the timetabling problem for a set of university departments, in which each department prepares the schedule according to private rules, constraints, and objectives, and relying on own resources. In order to share and/or exchange resources for mutual benefits the system allows the departments to negotiate on a common marketplace and making use of an artificial currency.