SearcharxivSearch

arXiv subjects

Andrea Mor

Publications and source records attributed to Andrea Mor.

4 recordsLinked to original sources

The impact of machine learning forecasting on strategic decision-making for Bike Sharing Systems

In this paper, machine learning techniques are used to forecast the difference between bike returns and withdrawals at each station of a bike sharing system. The forecasts are integrated into a simulation framework that is used to support long-term decisions and model the daily dynamics, including the relocation of bikes. We assess the quality of the machine learning-based forecasts in two ways. Firstly, we compare the forecasts with alternative prediction methods. Secondly, we analyze the impact of the forecasts on the quality of the output of the simulation framework. The evaluation is based on real-world data of the bike sharing system currently operating in Brescia, Italy.

math.OC

Evaluating deep learning models for fault diagnosis of a rotating machinery with epistemic and aleatoric uncertainty

Uncertainty-aware deep learning (DL) models recently gained attention in fault diagnosis as a way to promote the reliable detection of faults when out-of-distribution (OOD) data arise from unseen faults (epistemic uncertainty) or the presence of noise (aleatoric uncertainty). In this paper, we present the first comprehensive comparative study of state-of-the-art uncertainty-aware DL architectures for fault diagnosis in rotating machinery, where different scenarios affected by epistemic uncertainty and different types of aleatoric uncertainty are investigated. The selected architectures include sampling by dropout, Bayesian neural networks, and deep ensembles. Moreover, to distinguish between in-distribution and OOD data in the different scenarios two uncertainty thresholds, one of which is introduced in this paper, are alternatively applied. Our empirical findings offer guidance to practitioners and researchers who have to deploy real-world uncertainty-aware fault diagnosis systems. In particular, they reveal that, in the presence of epistemic uncertainty, all DL models are capable of effectively detecting, on average, a substantial portion of OOD data across all the scenarios. However, deep ensemble models show superior performance, independently of the uncertainty threshold used for discrimination. In the presence of aleatoric uncertainty, the noise level plays an important role. Specifically, low noise levels hinder the models' ability to effectively detect OOD data. Even in this case, however, deep ensemble models exhibit a milder degradation in performance, dominating the others. These achievements, combined with their shorter inference time, make deep ensemble architectures the preferred choice.

cs.LG

A simulation framework for the design of a station-based bike sharing system

Many cities and towns offer to citizens a Bike-Sharing System (BSS). When a company starts the service, multiple decisions have to be taken at strategic, tactical, and operational level. When the service is in place, it is often necessary to adapt these decisions to changed conditions. In this paper, starting from the experience gained in the real-case of Bicimia in Brescia, Italy, we present a simulation framework to support decisions in the design or revision of a BSS, including the shifts of the operators, the number of vehicles and their capacity, the sizing of the stations, and the sizing of the fleet of bikes.

math.OC

The Bi-objective Long-haul Transportation Problem on a Road Network

In this paper we study a long-haul truck scheduling problem where a path has to be determined for a vehicle traveling from a specified origin to a specified destination. We consider refueling decisions along the path, while accounting for heterogeneous fuel prices in a road network. Furthermore, the path has to comply with Hours of Service (HoS) regulations. Therefore, a path is defined by the actual road trajectory traveled by the vehicle, as well as the locations where the vehicle stops due to refueling, compliance with HoS regulations, or a combination of the two. This setting is cast in a bi-objective optimization problem, considering the minimization of fuel cost and the minimization of path duration. An algorithm is proposed to solve the problem on a road network. The algorithm builds a set of non-dominated paths with respect to the two objectives. Given the enormous theoretical size of the road network, the algorithm follows an interactive path construction mechanism. Specifically, the algorithm dynamically interacts with a geographic information system to identify the relevant potential paths and stop locations. Computational tests are made on real-sized instances where the distance covered ranges from 500 to 1500 km. The algorithm is compared with solutions obtained from a policy mimicking the current practice of a logistics company. The results show that the non-dominated solutions produced by the algorithm significantly dominate the ones generated by the current practice, in terms of fuel costs, while achieving similar path durations. The average number of non-dominated paths is 2.7, which allows decision makers to ultimately visually inspect the proposed alternatives.

math.OC