Roberto Maria Rosati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Roberto Maria Rosati has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Andrea Schaerf
University of Udine, udine, Italy
10 shared publications - Luca Di Gaspero
University of Udine Italy
7 shared publications - Sara Ceschia
Polytechnic Department of Engineering and Architecture, University of Udine, Udine, Italy
5 shared publications - Christian Blum
Artificial Intelligence Research Institute (IIIA-CSIC), Bellaterra, Spain
3 shared publications - Roberto Montemanni
Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, 42122 Reggio Emilia, Italy
2 shared publications - Salim Bouamama
University Sétif 1 - Ferhat Abbas, Sétif, Algeria
2 shared publications
Latest Publications
- Open Access
- 7 October 2026
- Published by Elsevier in European Journal of Operational Research
A metaheuristic algorithm for locomotive rescheduling in freight transportation under disruptions
- 7 October 2026
- Published by Elsevier in European Journal of Operational Research
Open AccessA metaheuristic algorithm for locomotive rescheduling in freight transportation under disruptions
- Open Access
- 7 July 2026
- Published by Elsevier in SSRN Electronic Journal
Combining Stochastic Local Search and Mathematical Programming for Bus Driver Scheduling
Bus driver scheduling involves assigning drivers to scheduled shifts while satisfying legal, operational, and contractual constraints. We study a recently-proposed variant, which features a complex break structure and is evaluated on a highly challenging dataset of realistic benchmark instances.For this setting, we propose two solution approaches. The first is a Multi-Neighborhood Simulated Annealing that uses five neighborhoods tailored to the problem within a stochastic local search framework. The second is a hybrid method that combines local search with mathematical programming through trajectory-driven shift generation: promising shifts encountered during the search are collected and periodically used to solve a set partitioning model.Computational results show that the local search achieves performance comparable to state-of-the-art metaheuristics, while the hybrid approach attains new best-known results, particularly for the largest instances.These results highlight the value of hybridizing stochastic local search with exact optimization for highly constrained workforce scheduling problems. The proposed method advances the state of the art for this problem and suggests a general strategy that may be applicable to other large-scale scheduling problems.
- 7 July 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCombining Stochastic Local Search and Mathematical Programming for Bus Driver Scheduling
Bus driver scheduling involves assigning drivers to scheduled shifts while satisfying legal, operational, and contractual constraints. We study a recently-proposed variant, which features a complex break structure and is evaluated on a highly challenging dataset of realistic benchmark instances.For this setting, we propose two solution approaches. The first is a Multi-Neighborhood Simulated Annealing that uses five neighborhoods tailored to the problem within a stochastic local search framework. The second is a hybrid method that combines local search with mathematical programming through trajectory-driven shift generation: promising shifts encountered during the search are collected and periodically used to solve a set partitioning model.Computational results show that the local search achieves performance comparable to state-of-the-art metaheuristics, while the hybrid approach attains new best-known results, particularly for the largest instances.These results highlight the value of hybridizing stochastic local search with exact optimization for highly constrained workforce scheduling problems. The proposed method advances the state of the art for this problem and suggests a general strategy that may be applicable to other large-scale scheduling problems.
- Open Access
- 21 May 2026
- Published by Elsevier in SSRN Electronic Journal
An Encoder-Decoder Multi-Neighborhood Search for the AGV Scheduling Problem with Different Charging Policies
The AGV Scheduling Problem with Battery Constraints (ASP-BC) has recently attracted attention in the context of automated warehouses, where automated guided vehicles are required to execute transportation tasks under limited battery capacity while coordinating charging operations. Existing approaches typically focus on specific problem variants, considering either fixed or flexible charging policies. In this paper, we propose a Multi-Neighborhood Search (MNS) metaheuristic for solving both variants of the ASP-BC. The proposed approach is based on an implicit solution representation, a fast decoding procedure, and a set of local search neighborhoods. Extensive computational experiments on benchmark and newly generated instances show that the proposed MNS can find optimal or near-optimal solutions in very short computational times, significantly outperforming existing approaches in scalability and making it particularly well suited to real-world cases, where instance sizes can be very large, and decisions must be taken under tight time constraints. Finally, we provide managerial insights into the impact of charging policies on system performance, identifying scenarios in which simpler fixed policies can be effectively adopted and others in which flexible charging becomes essential.
- 21 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn Encoder-Decoder Multi-Neighborhood Search for the AGV Scheduling Problem with Different Charging Policies
The AGV Scheduling Problem with Battery Constraints (ASP-BC) has recently attracted attention in the context of automated warehouses, where automated guided vehicles are required to execute transportation tasks under limited battery capacity while coordinating charging operations. Existing approaches typically focus on specific problem variants, considering either fixed or flexible charging policies. In this paper, we propose a Multi-Neighborhood Search (MNS) metaheuristic for solving both variants of the ASP-BC. The proposed approach is based on an implicit solution representation, a fast decoding procedure, and a set of local search neighborhoods. Extensive computational experiments on benchmark and newly generated instances show that the proposed MNS can find optimal or near-optimal solutions in very short computational times, significantly outperforming existing approaches in scalability and making it particularly well suited to real-world cases, where instance sizes can be very large, and decisions must be taken under tight time constraints. Finally, we provide managerial insights into the impact of charging policies on system performance, identifying scenarios in which simpler fixed policies can be effectively adopted and others in which flexible charging becomes essential.
- Open Access
- 30 December 2025
- Published by Wiley in International Transactions in Operational Research
A unified formulation for home healthcare routing and scheduling problems
Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently. While various formulations of such a problem—the home healthcare routing and scheduling problem—have been proposed, many fail to include key real‐world features, limiting their applicability in practice. This paper consolidates relevant features from existing models and significantly extends the formulation by Mankowska et al. (2014) to develop a unified framework incorporating as many real‐world aspects as possible. We introduce a new instance generator, a set of real‐world features to describe these instances, and a comprehensive infrastructure for validating and comparing solutions. Furthermore, we extend two state‐of‐the‐art solution methods—simulated annealing and one based on a compact mixed integer linear programming model solved by a state‐of‐the‐art software – to integrate all these features and provide a comparative analysis of their performance. Results show that our general solution methods are able to outperform methods specialized for a specific formulation on many instances.
- 30 December 2025
- Published by Wiley in International Transactions in Operational Research
Open AccessA unified formulation for home healthcare routing and scheduling problems
Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently. While various formulations of such a problem—the home healthcare routing and scheduling problem—have been proposed, many fail to include key real‐world features, limiting their applicability in practice. This paper consolidates relevant features from existing models and significantly extends the formulation by Mankowska et al. (2014) to develop a unified framework incorporating as many real‐world aspects as possible. We introduce a new instance generator, a set of real‐world features to describe these instances, and a comprehensive infrastructure for validating and comparing solutions. Furthermore, we extend two state‐of‐the‐art solution methods—simulated annealing and one based on a compact mixed integer linear programming model solved by a state‐of‐the‐art software – to integrate all these features and provide a comparative analysis of their performance. Results show that our general solution methods are able to outperform methods specialized for a specific formulation on many instances.
- Open Access
- 11 December 2024
- Published by Wiley in International Transactions in Operational Research
Multi‐neighborhood simulated annealing for the home healthcare routing and scheduling problem
Over time, the focus on supportive and geriatric care has shifted from being predominantly provided in institutional settings like nursing or rest homes to be delivered within the homes of the patients. Trained caregivers now provide home healthcare services by visiting patients in their own homes and carrying out specific services based on each patient's individual needs before moving on to the next patient. Planning such a service involves considering the routing aspect and ensuring synchronization between services and designated time windows for patients. To solve the problem, we propose a local search approach that combines different neighborhood operators guided by the simulated annealing metaheuristic. Additionally, we introduce a realistic and diverse dataset and a robust and flexible file format based on JSON. This dataset and format have the potential to facilitate future comparisons and analyses. Our study shows that by appropriately tuning our algorithm in a statistically rigorous manner, it outperforms existing methods on all benchmarks.
- 11 December 2024
- Published by Wiley in International Transactions in Operational Research
Open AccessMulti‐neighborhood simulated annealing for the home healthcare routing and scheduling problem
Over time, the focus on supportive and geriatric care has shifted from being predominantly provided in institutional settings like nursing or rest homes to be delivered within the homes of the patients. Trained caregivers now provide home healthcare services by visiting patients in their own homes and carrying out specific services based on each patient's individual needs before moving on to the next patient. Planning such a service involves considering the routing aspect and ensuring synchronization between services and designated time windows for patients. To solve the problem, we propose a local search approach that combines different neighborhood operators guided by the simulated annealing metaheuristic. Additionally, we introduce a realistic and diverse dataset and a robust and flexible file format based on JSON. This dataset and format have the potential to facilitate future comparisons and analyses. Our study shows that by appropriately tuning our algorithm in a statistically rigorous manner, it outperforms existing methods on all benchmarks.
- 24 August 2024
- Published by Springer Nature in 4OR
- Vol. 23 (1) , 125-126
Multi-neighborhood search for combinatorial optimization
- 24 August 2024
- Published by Springer Nature in 4OR
- Vol. 23 (1) , 125-126
Multi-neighborhood search for combinatorial optimization
- 18 June 2024
- Published by Springer Nature
- p. 373-379
Multi-Neighborhood Search for the Makespan Minimization Problem on Parallel Identical Machines with Conflicting Jobs
- 18 June 2024
- Published by Springer Nature
- p. 373-379
Multi-Neighborhood Search for the Makespan Minimization Problem on Parallel Identical Machines with Conflicting Jobs
- Open Access
- 18 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Multi-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
- 18 June 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 255
Open AccessMulti-Neighborhood Simulated Annealing for the Capacitated Dispersion Problem
- 17 June 2024
- Published by Springer Nature
- p. 164-170
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling
- 17 June 2024
- Published by Springer Nature
- p. 164-170
Enhancing Real-World Applicability in Home Healthcare: A Metaheuristic Approach for Advanced Routing and Scheduling
- 7 June 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 575-591
Which algorithm to select in sports timetabling?
- 7 June 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 575-591
Which algorithm to select in sports timetabling?