Francesco Stranieri

Dr. Francesco Stranieri

Control and Computer Engineering (DAUIN), Polytechnic University of Turin, Turin, Piedmont, Italy
+1
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 November 2023 in International Journal of Production Economics
Verified
Journal Article
Open access
Francesco StranieriFrancesco Stranieri
Francesco Stranieri
EFEDOARDO FADDA
EDOARDO FADDA
Fabio StellaFabio Stella
Fabio Stella

9 December 2020 in Algorithms
Verified
Journal Article
Open access
PDF file
Andrea RuggieriAndrea Ruggieri
Andrea Ruggieri
Francesco StranieriFrancesco Stranieri
Francesco Stranieri
Fabio StellaFabio Stella
Fabio Stella
MSMarco Scutari
Marco Scutari
Incomplete data are a common feature in many domains, from clinical trials to industrial applications. Bayesian networks (BNs) are often used in these domains because of their graphical and causal interpretations. BN parameter learning from incomplete data is usually implemented with the Expectation-Maximisation algorithm (EM), which computes the relevant sufficient statistics (“soft EM”) using belief propagation. Similarly, the Structural Expectation-Maximisation algorithm (Structural EM) learns the network structure of the BN from those sufficient statistics using algorithms designed for complete data. However, practical implementations of parameter and structure learning often impute missing data (“hard EM”) to compute sufficient statistics instead of using belief propagation, for both ease of implementation and computational speed. In this paper, we investigate the question: what is the impact of using imputation instead of belief propagation on the quality of the resulting BNs? From a simulation study using synthetic data and reference BNs, we find that it is possible to recommend one approach over the other in several scenarios based on the characteristics of the data. We then use this information to build a simple decision tree to guide practitioners in choosing the EM algorithm best suited to their problem.


20 September 2024 in Progress in Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
AAAlberto Archetti
Alberto Archetti
Francesco StranieriFrancesco Stranieri
Francesco Stranieri
MMMatteo Matteucci
Matteo Matteucci

18 January 2025 in arXiv
Verified
Preprint
Open access
PDF file
Francesco StranieriFrancesco Stranieri
Francesco Stranieri
CKChaaben Kouki
Chaaben Kouki
WJWillem van Jaarsveld
Willem van Jaarsveld
FSFabio Stella
Fabio Stella
We study inventory control policies for pharmaceutical supply chains, addressing challenges such as perishability, yield uncertainty, and non-stationary demand, combined with batching constraints, lead times, and lost sales. Collaborating with Bristol-Myers Squibb (BMS), we develop a realistic case study incorporating these factors and benchmark three policies--order-up-to (OUT), projected inventory level (PIL), and deep reinforcement learning (DRL) using the proximal policy optimization (PPO) algorithm--against a BMS baseline based on human expertise. We derive and validate bounds-based procedures for optimizing OUT and PIL policy parameters and propose a methodology for estimating projected inventory levels, which are also integrated into the DRL policy with demand forecasts to improve decision-making under non-stationarity. Compared to a human-driven policy, which avoids lost sales through higher holding costs, all three implemented policies achieve lower average costs but exhibit greater cost variability. While PIL demonstrates robust and consistent performance, OUT struggles under high lost sales costs, and PPO excels in complex and variable scenarios but requires significant computational effort. The findings suggest that while DRL shows potential, it does not outperform classical policies in all numerical experiments, highlighting 1) the need to integrate diverse policies to manage pharmaceutical challenges effectively, based on the current state-of-the-art, and 2) that practical problems in this domain seem to lack a single policy class that yields universally acceptable performance.

17 November 2023 in arXiv
Verified
Preprint
Open access
PDF file
Francesco StranieriFrancesco Stranieri
Francesco Stranieri
FSFabio Stella
Fabio Stella
In this study, we analyze and compare the performance of state-of-the-art deep reinforcement learning algorithms for solving the supply chain inventory management problem. This complex sequential decision-making problem consists of determining the optimal quantity of products to be produced and shipped across different warehouses over a given time horizon. In particular, we present a mathematical formulation of a two-echelon supply chain environment with stochastic and seasonal demand, which allows managing an arbitrary number of warehouses and product types. Through a rich set of numerical experiments, we compare the performance of different deep reinforcement learning algorithms under various supply chain structures, topologies, demands, capacities, and costs. The results of the experimental plan indicate that deep reinforcement learning algorithms outperform traditional inventory management strategies, such as the static (s, Q)-policy. Furthermore, this study provides detailed insight into the design and development of an open-source software library that provides a customizable environment for solving the supply chain inventory management problem using a wide range of data-driven approaches.