Sara Ceschia

Sara Ceschia
University of Udine | UNIUD · Polytechnic Department of Engineering and Architecture

PhD

About

44
Publications
6,677
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
677
Citations
Citations since 2017
22 Research Items
499 Citations
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
2017201820192020202120222023020406080100
Introduction
Sara Ceschia currently works at the Polytechnic Department of Engineering and Architecture, University of Udine. Sara does research in local search algorithms for combinatorial optimization problems in the field of logistics, healthcare, timetabling and scheduling.
Additional affiliations
January 2012 - December 2015
University of Udine
Position
  • Research Associate

Publications

Publications (44)
Chapter
Full-text available
We consider a mobile network in which traditional static terrestrial base stations are not capable of completely serving the existing user demand, due to the huge number of connected devices. In this setting, an equipped Unmanned Aerial Vehicle (UAV) can be employed to provide network connection where needed in a flexible way, thereby acting as an...
Chapter
We address the Permutation Flow-Shop Scheduling Problem with Predictive Maintenance presented by Varnier and Zerhouni (2012), that consists in finding the integrated schedule for production and maintenance tasks such that the total production time and the advance of maintenance services are minimized. Predictive maintenance services are scheduled b...
Article
Full-text available
We study a novel version of the capacitated facility location problem, which includes incompatibilities among customers. For this problem, we propose and compare on a fair common ground a portfolio of metaheuristic techniques developed independently from each other. We tested our techniques on a new dataset composed of instances of increasing size,...
Article
Crowdsourcing is the practice of outsourcing a task that would otherwise be performed by one or a few experts to a crowd of individuals. It is often used to collect large amounts of manually created labels that form datasets for training and evaluating supervised machine learning models. When designing a (micro-task) crowdsourcing experiment, it is...
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
available open access at https://www.tandfonline.com/doi/full/10.1080/00207543.2022.2078249 Warehouses are key elements of supply chain networks, and great attention is paid to increase their efficiency. Highly volatile space requirements are enablers of innovative resource sharing concepts, where warehouse capacities are traded on online platform...
Article
Full-text available
Solving a home energy management problem by Simulated Annealing.
Preprint
Full-text available
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 consider the Minimum Interference Frequency Assignment Problem and we propose a novel Simulated Annealing approach that makes use of a portfolio of different neighborhoods, specifically designed for this problem. We undertake at once the two versions of the problem proposed by Correia (2001) and by Montemanni et al. (2001), respectively, and the...
Chapter
This paper considers patient admissions and patient-to-room assignment problems, which are attracting increasing attention. These problems are challenging and concern with the assignment of a set of patients to a set of rooms in a well-defined planning horizon by satisfying several constraints. Hospitals usually face this complex problem of plannin...
Article
Full-text available
We consider the energy scheduling problem for a domestic setting proposed and modeled by Della Croce et al. (Comput Ind Eng 109:169–178, 2017). We solve it by means of a Simulated Annealing approach based on a complex neighborhood structure. We perform an extensive and statistically-principled tuning phase using F-Race, given that the solver is dep...
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...
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
Full-text available
This paper proposes a local search method based on a large neighborhood to solve the static version of the problem defined for the Second International Nurse Rostering Competition (INRC-II). The search method, driven by a simulated annealing metaheuristic, uses a combination of neighborhoods that either change the assignments of a nurse or swap the...
Article
Given the growing importance of cold chains and the need to promote sustainable processes, energy efficiency in refrigerated transports is investigated at operational level. The Refrigerated Routing Problem is defined, involving multi-drop deliveries of palletised unit loads of frozen food from a central depot to clients. The objective is to select...
Article
Full-text available
This paper reports on the Second International Nurse Rostering Competition (INRC-II). Its contributions are (1) a new problem formulation which, differently from INRC-I, is a multi-stage procedure, (2) a competition environment that, as in INRC-I, will continue to serve as a growing testbed for search approaches to the INRC-II problem, and (3) fina...
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...
Article
Full-text available
In this work, we consider the shift design problem and we define a novel, complex formulation arising from practical cases. In addition, we propose a new search method based on a fast Simulated Annealing, that, differently from previous approaches, solves the overall problem as a single-stage procedure. The core of the method is a composite neighbo...
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
In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II). First, we describe the problem formulation, which, differently from INRC-I, is a multi-stage procedure. Second, we illustrate all the necessary infrastructure do be used together with the participant's solver, including the te...
Article
Full-text available
We revisit and extend the patient admission scheduling problem, in order to make it suitable for practical applications. The main novelty is that we consider constraints on the utilisation of operating rooms for patients requiring a surgery. In addition, we propose a more elaborate model that includes a flexible planning horizon, a complex notion o...
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...
Article
Objective: Our goal is to propose and solve a new formulation of the recently-formalized patient admission scheduling problem, extending it by including several real-world features, such as the presence of emergency patients, uncertainty in the length of stay, and the possibility of delayed admissions. Method: We devised a metaheuristic approach...
Thesis
We proposed models and metaheuristic search methods to solve complex real-world problems in the domain of computational logistics. In particular we focused on routing and loading problems, which have several practical applications in transportation, cutting, packing, and scheduling. We extended the problem formulations available in the literature t...
Article
Full-text available
We propose a multi-neighborhood local search procedure to solve a healthcare problem, known as the Patient Admission Scheduling problem. We design and experiment with different combinations of neighborhoods, showing that they have diverse effectiveness for different sets of weights of the cost components that constitute the objective function. We a...
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
Full-text available
Mr. Hamann gave some of the constraints upon the engineer in the automotive industry.
Conference Paper
We propose a complex real-world problem in logistics that integrates routing and packing aspects. It can be seen as an extension of the Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) introduced by Gendreau, Ion, Laporte, and Martello (2006). The 3L-CVRP consists in finding a set of routes that satisfies the demand of all cu...
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...
Article
Full-text available
We consider a complex variant of the Container Loading Problem arising from a real-world industrial application. It includes several features such as multiple containers, box rotation, and bearable weight, which are of importance in many practical situations. In addition, it also considers the situation in which boxes have to be delivered to differ...
Conference Paper
We propose a multi-neighborhood local search procedure to solve a healthcare problem, known as the Patient Admission problem. We design and experiment different combinations of neighborhoods, showing that they have diverse effectiveness for different sets of weights of the cost components that constitute the objective function. We also compute some...

Network

Cited By