Luca Di Gaspero

Luca Di Gaspero
University of Udine | UNIUD · Polytechnic Department of Engineering and Architecture

PhD

About

134
Publications
20,223
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
2,668
Citations
Introduction
Luca Di Gaspero is exploring the application of meta-heuristic techniques to real-world combinatorial optimization problems, mainly in the area of Scheduling, Timetabling and Computational Logistics. A major focus of his research is in boosting meta-heuristic techniques by their hybridization with other optimization methods, mainly in the area of Artificial Intelligence, such as Constraint Programming and Reinforcement Learning.
Additional affiliations
April 2011 - June 2011
TU Wien
Position
  • Professor
Description
  • Teaching the course Modeling and Solving Constrained Optimization Problems at Master Degree level
April 2011 - June 2011
TU Wien
Position
  • Professor
January 2005 - present
Università degli studi di Udine
Position
  • Professor (Associate)
Description
  • Teaching Web Applications in the Master of Electronic Engineering
Education
January 1999 - February 2003
University of Udine
Field of study
  • Computer Science
October 1993 - December 1998
University of Udine
Field of study
  • Computer Science

Publications

Publications (134)
Article
We propose a survey of the research contributions on the field of Educational Timetabling with a specific focus on “standard” formulations and the corresponding benchmark instances. We identify six of such formulations and we discuss their features, pointing out their relevance and usability. Other available formulations and datasets are also revie...
Article
Full-text available
We describe the solver that we developed for the Sports Timetabling Competition ITC2021, a three-stage simulated annealing approach, that makes use of a portfolio of six different neighborhoods. Five of these neighborhoods are taken from the literature on round-robin tournament scheduling, whereas the last one, denoted as PartialSwapTeamsPhased, is...
Preprint
We propose a survey of the research contributions on the field of Educational Timetabling with a specific focus on "standard" formulations and the corresponding benchmark instances. We identify six of such formulations and we discuss their features, pointing out their relevance and usability. Other available formulations and datasets are also revie...
Article
We propose a Simulated Annealing approach for the Examination Timetabling problem, in the classical uncapacitated formulation of Carter et al. (1996). Our solver is based on a novel combination of many neighborhoods and a principled tuning procedure performed on artificial training instances. The experimental results on real-world benchmarks show t...
Article
Full-text available
In recent years, cold food chains have shown an impressive growth, mainly due to customers life style changes. Consequently, the transportation of refrigerated food is becoming a crucial aspect of the chain, aiming at ensuring efficiency and sustainability of the process while keeping a high level of product quality. The recently defined Refrigerat...
Article
In this work we analyse basketball play-by-play data in order to evaluate the efficiency of different five-man lineups employed by teams. Starting from the adjusted plus-minus framework, we present a model-based strategy for the analysis of the result of partial match outcomes, extending the current literature in two main directions. The first exte...
Chapter
We investigate the examination timetabling problem in the context of Italian universities. The outcome is the definition of a general problem that can be applied to a large set of universities, but is quite different in many aspects from the classical versions proposed in the literature. We propose both a metaheuristic approach based on Simulated A...
Article
The thesis defense timetabling problem consists in composing the suitable committee for a set of defense sessions and assigning each graduation candidate to one of the sessions. In this work, we define the problem formulation that applies to some Italian universities and we provide three alternative solution methods, based on Integer Programming, C...
Article
We propose a general model for the problem of planning and scheduling steelmaking and casting activities obtained by combining common features and constraints of the operations from a real plant and the literature. For tackling the problem, we develop a simulated annealing approach based on a solution space made of job permutations, which uses as s...
Article
We consider the discrete single-machine, multi-item lot-sizing and scheduling problem and we propose a Simulated Annealing (SA) approach together with a statistically-principled tuning procedure to solve it. We compare our solver with the state-of-the-art methods based on Mixed Integer Programming (MIP), both on publicly-available instances and on...
Conference Paper
Full-text available
MiniZinc is a high-level declarative modeling language that has become quite popular in the last few years. One of the main features of MiniZinc is the underlying middle-level constraint language FlatZinc, into which a MiniZinc model, along with a given instance, is translated. In this work, we describe an on-going project consisting in the impleme...
Article
Full-text available
Automation of engineering procedures for the development of new manufacturing processes is of great importance in modern competitive conditions. For example, metalworking companies would greatly benefit from the development of methods for automatic generation, testing and optimization of part programs for machining operations. Indeed, the generatio...
Article
Full-text available
Bike sharing systems need to be properly rebalanced to meet the demand of users and to operate successfully. However, the problem of Balancing Bike Sharing Systems (BBSS) is a demanding task: it requires the design of optimal tours and operating instructions for relocating bikes among stations to maximally comply with the expected future bike deman...
Article
A promising research line in the optimization community regards the hybridization of exact and heuristics methods. In this chapter we survey the specific integration of two complementary optimization paradigms, namely Constraint Programming, for the exact part, and metaheuristics.
Article
We consider the university course timetabling problem, which is one of the most studied problems in educational timetabling. In particular, we focus our attention on the formulation known as curriculum-based course timetabling problem (CB-CTT), which has been tackled by many researchers and has many available benchmarks. The contributions of this p...
Article
Full-text available
We propose an extension of the Generalized Balanced Academic Curriculum Problem (GBACP), a relevant planning problem arising in many universities. The problem consists of assigning courses to teaching terms and years, satisfying a set of precedence constraints and balancing students’ load among terms. Differently from the original GBACP formulation...
Conference Paper
Full-text available
Homecare, i.e., supportive care provided at the patients’ homes, is established as a prevalent alternative to unnecessary hospitalization or institutional care (e.g., in a rest home or a nursing home). These activities are provided either by healthcare professional or by non-medical caregivers, depending on the patient’s needs (e.g., medical care o...
Conference Paper
Full-text available
In order to meet the users’ demand, bike sharing systems must be regularly rebalanced. The problem of balancing bike sharing systems (BBSS) is concerned with designing optimal tours and operating instructions for relocating bikes among stations to maximally comply with the expected future bike demands. In this paper, we tackle the BBSS by means of...
Conference Paper
Full-text available
Balancing bike sharing systems is an increasingly important problem, because of the rising popularity of this mean of transportation. Bike sharing systems need to be balanced so that bikes (and empty slots for returning bikes) are available to the customers, thus ensuring an adequate level of service. In this paper, we tackle the problem of balanci...
Article
Full-text available
This paper is the organizers’ report on the Third International Timetabling Competition (ITC2011), run during 2011–2012 with the aim of raising the profile of automated high school timetabling. Its participants tackled 35 instances of the high school timetabling problem, taken from schools in 10 countries. The paper describes the data model used, t...
Chapter
Full-text available
We present GELATO, a general tool for encoding and solving optimization problems. Problems can be modeled using several paradigms and/or languages such as: Prolog, MiniZinc, and GECODE. Other paradigms can be included. Solution search is performed by a hybrid solver that exploits the potentiality of the Constraint Programming environment GECODE and...
Chapter
Shift design and break scheduling are important employee scheduling problems that arise in many contexts, especially at airports, call centers, and service industries. The aim is to find a minimum number of legal shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requir...
Article
Full-text available
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotypes. This piece of information makes it possible to perform association studies for the genetic variants involved in multifactorial diseases and the individual responses to therape...
Article
Full-text available
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 application that maintains...
Conference Paper
Full-text available
In our participation to the Cross-Domain Heuristic Search Challenge (CHeSC 2011) [1] we developed an approach based on Reinforcement Learning for the automatic, on-line selection of low-level heuristics across different problem domains. We tested different memory models and learning techniques to improve the results of the algorithm. In this paper...
Article
Portfolio selection is a problem arising in finance and economics. While its basic formulations can be efficiently solved using linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by heuristics. In this work, we present a hybrid techn...
Article
The post-enrolment course timetabling (PE-CTT) is one of the most studied timetabling problems, for which many instances and results are available. In this work we design a metaheuristic approach based on Simulated Annealing to solve the PE-CTT. We consider all the different variants of the problem that have been proposed in the literature and we p...
Article
The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching terms satisfying prerequisites and balancing the credit course load within each term. The BACP is part of the CSPLib with three benchmark instances, but its formulation is simpler than the problem solved in practice by universities. In this article, we introdu...
Conference Paper
The Portfolio Selection Problem [7] is amongst the most studied issues in finance. In this problem, given a universe of assets (shares, options, bonds, . . . ), we are concerned in finding out a portfolio (i.e., which asset to invest in and by how much) which minimizes the risk while ensuring a given minimum return. In the most common formulation i...
Article
We propose a hybrid local search algorithm for the solution of the Curriculum-Based Course Timetabling Problem and we undertake a systematic statistical study of the relative influence of the relevant features on the performances of the algorithm. In particular, we apply modern statistical techniques for the design and analysis of experiments, such...
Article
Full-text available
Mr. Hamann gave some of the constraints upon the engineer in the automotive industry.
Article
Full-text available
In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost for vehicles, and the possibility of leaving orders unscheduled. For tackling this problem we propose a metaheu...
Conference Paper
Full-text available
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is to find a minimum number of shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirement...
Article
Full-text available
The typical scenario of a user seeking information on the Web requires significant effort to get the desired information (Web pages, applications, resources, and so on). The user must submit a query to a Web search engine and then check the results to see if they really provide the desired information. Often the user must refine and resubmit the qu...
Article
Full-text available
The 2nd International Timetabling Competition (ITC2007) was announced on the 1st Au-gust 2007. Building on the success of the first, this competition aimed to further develop interest in the area of educational timetabling while providing researchers with models of the problems faced which incorporate an increased number of real world constraints....
Chapter
Nowadays, the mobile computing paradigm and the widespread diffusion of mobile devices are quickly changing and replacing many common assumptions about software architectures and interaction/communication models. The environment, in particular, or more generally, the so-called user context is claiming a central role in everyday’s use of cellular ph...
Article
Full-text available
In this work we study a hybrid local search algorithm for the solu-tion of timetabling problems, and we undertake a systematic statistical study of the relative influence of the relevant features on the perfor-mances of the algorithm. In particular, we apply statistical methods for the design and analysis of experiments. This work is still ongoing,...
Conference Paper
Full-text available
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A notable a...
Conference Paper
Full-text available
We present a hybrid solver (called \(\mathbb{GELATO}\)) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal + + ). \(\mathbb{GELATO}\) allows to easily develop and use hybrid meta-heuristic combining CP and LS phases (in particular Large Neighborhood Search). We tested...
Conference Paper
Full-text available
We present EasyGenetic, a genetic solver based on template metaprogramming, that enables the user to configure the solver by instantiating template parameters. The framework allows to combine flexibility with efficiency. The framework is mainly designed to be applied to problems for which a master-slave solution strategy can be defined.
Article
Full-text available
I will present the Context Aware Browser, a novel paradigm for context-aware access to Web contents with mobile devices. The idea is to allow automatic download of Web pages, and even automatic execution of Web applications, on user's own mobile device. The Web resources are not simply pushed on the mobile device; rather, they are selected on the b...
Article
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A notable a...
Conference Paper
Full-text available
Haplotype inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This piece of information allows researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A...
Conference Paper
Full-text available
The Balanced Academic Curriculum Problem (BACP) consists in assigning courses to teaching periods satisfying prerequisites and balancing students’ load. BACP is included in CSPlib along with three benchmark instances. However, the BACP formulation in CSPLib is actually simpler than the real problem that, in general, universities have to solve in pr...
Conference Paper
Camera placement in 3D scenes is a relevant issue in most D graphics interactive application, such as videogames, data visualization, and virtual tours. Virtual Camera Composition (VCC) consists in automatically positioning a camera in a virtual world, such that the resulting image satisfies a set of visual cinematographic properties [1]. We propos...
Conference Paper
Full-text available
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information enables researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A notable...
Conference Paper
Full-text available
The Virtual Camera Composition (VCC) problem consists in auto- matically positioning a camera in a virtual world, such that the resulting image satisfies a set of visual cinematographic properties (3). In this paper, we propose an approach to VCC based on Particle Swarm Optimization(5). We show, in re- alistic situations, that our approach outperfo...
Conference Paper
Context aware computing is a computational paradigm that has faced a rapid growth in the last few years, especially in the field of mobile devices. One of the promises of context-awareness in this field is the possibility of automatically adapting the functioning mode of mobile devices to the environment and the current situation the user is in, wi...
Article
Full-text available
Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researchers to perform association studies for the genetic variants involved in diseases and the individual responses to therapeutic agents. A notable a...
Article
Full-text available
The min-Shift Design problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize the deviation from workforce requirements. Our research considers both theoretical and practical a...
Conference Paper
Full-text available
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its more practical and realistic variants, which include various kinds of constraints and objectives, have in many cases to be tackled by approximate algorithms. In this work, we...
Article
Full-text available
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...
Conference Paper
Full-text available
Portfolio selection is a relevant problem arising in nance and economics. While its basic formulation can be ecien tly solved through linear programming, its more practical and realistic variants, that include various kinds of constraints and objec- tives, have to be tackled by approximate algorithms. In this work, we present a hybrid technique tha...
Conference Paper
Full-text available
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 dierent timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian unive...