Maria I. Restrepo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Maria I. Restrepo has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Alexandre Dolgui
IMT Atlantique
1 shared publication - Arnold Hien
IMT Atlantique, LS2N, UMR CNRS 6004, Nantes, France
1 shared publication Bernard Gendron
Université de Montréal
1 shared publication- Claude-Guy Quimper
Université Laval
1 shared publication - David Lemoine
IMT Atlantique, LS2N, UMR 6004 CNRS, Nantes, France
1 shared publication Fabien Lehuédé
1 shared publication
Latest Publications
- Open Access
- 22 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Small and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem
- 22 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Open AccessSmall and large neighborhood search for the on-demand bus routing problem: A bus stop assignment and transportation problem
- 9 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for On the Use of Regular Languages to Model Personnel Scheduling Problems
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.
- 9 June 2026
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for On the Use of Regular Languages to Model Personnel Scheduling Problems
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.
- Open Access
- 3 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (1) , 15
Special Issue on Scheduling Theory and Algorithms for Sustainable Manufacturing
The following Special Issue was initiated at the 10th IFAC triennial conference MIM 2022 (https://hub
- 3 January 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (1) , 15
Open AccessSpecial Issue on Scheduling Theory and Algorithms for Sustainable Manufacturing
The following Special Issue was initiated at the 10th IFAC triennial conference MIM 2022 (https://hub
- 28 June 2024
- Published by Springer Nature
- p. 227-257
Decomposition-Based Algorithms for Mixed-Integer Linear Programs with Integer Subproblems
- 28 June 2024
- Published by Springer Nature
- p. 227-257
Decomposition-Based Algorithms for Mixed-Integer Linear Programs with Integer Subproblems
- Open Access
- 7 July 2023
- Published by MDPI AG in Engineering Proceedings
- Vol. 39 (1) , 65
Automata Based Multivariate Time Series Analysis for Anomaly Detection over Sliding Time Windows
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.
- 7 July 2023
- Published by MDPI AG in Engineering Proceedings
- Vol. 39 (1) , 65
Open AccessAutomata Based Multivariate Time Series Analysis for Anomaly Detection over Sliding Time Windows
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.
- 1 July 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (4) , 1150-1174
Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery
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).
- 1 July 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 53 (4) , 1150-1174
Integrated Shift Scheduling and Load Assignment Optimization for Attended Home Delivery
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).