In this article, we study an integrated shift scheduling and load assignment optimization problem for attended home delivery. The proposed approach is divided into two phases, each one corresponding to a different planning level: tactical and operational. In the tactical planning, a daily master plan is generated for each courier. This master plan defines the working shifts, the origin–destination pairs to visit, and the number of client requests to serve. In the operational planning, delivery orders are allocated to couriers in real time. The stochastic and dynamic nature of client orders is included in the tactical and operational decision levels, respectively. Experimental results demonstrate that our approach provides robust tactical solutions that easily accommodate fluctuations in client orders, preventing additional costs related to the underutilization of couriers and to the use of external couriers to satisfy all delivery requests, when compared with an approach using the mean demand value. Moreover, these results also indicate that the failure to incorporate robust tactical solutions in the operational planning results in infeasible operational plans that are inadmissible regarding the couriers’ working time (e.g., minimum and maximum numbers of working hours) and work regulations (e.g., allocation of consecutive working hours to the couriers).
The software and data in this repository are a snapshot of the software and data that were used in the research reported on in the paper On the Use of Regular Languages to Model Personnel Scheduling Problems by G. Ghienne, O. Bellenguez, G. Massonnet and M.I. Restrepo.
We describe an optimal linear time complexity method for extracting patterns from sliding windows of multivariate time series that depends only on the length of the time series. The method is implemented as an open-source Java library and is used to detect anomalies in multivariate time series.