Paradiso, R., Roberti, R., Lagana, D. and Dullaert, W. (2020). An exact solution framework for multitrip vehicle-routing problems with time windows Operations Research, 68(1):180--198.
Roberto Roberti
University
Vrije Universiteit Amsterdam
E-mail
Research field
Supply Chain Analytics
Website
Biography
Roberto Roberti is Associate Professor at the Department of Innovation, Logistics and Information at the School of Business and Economics, VU Amsterdam.
Roberto received a Master Degree in Computer Science (2008) and a PhD in Control System Engineering and Operational Research (2012) from the University of Bologna (Italy). After completing his PhD, Roberto has served as Post-Doc research fellow in Operations Research at the University of Bologna and as Assistant Professor in Transport Optimization at the Technical University of Denmark (Denmark).
Roberto’s main research focus is on exact and heuristic algorithms for solving combinatorial optimization problems arising in transportation and logistics. His research outcomes have been published in major international journals, such as Management Science, Operations Research, and Transportation Science.
Key publications
Roberti, R., Bartolini, E. and Mingozzi, A. (2015). The fixed charge transportation problem: An exact algorithm based on a new integer programming formulation Management Science, 61(6):1275--1291.
Buson, E., Roberti, R. and Toth, P. (2014). A reduced-cost iterated local search heuristic for the fixed-charge transportation problem Operations Research, 62(5):1095--1106.
Baldacci, R., Mingozzi, A., Roberti, R. and Calvo, R. (2013). An exact algorithm for the two-echelon capacitated vehicle routing problem Operations Research, 61(2):298--314.
Baldacci, R., Mingozzi, A. and Roberti, R. (2011). New route relaxation and pricing strategies for the vehicle routing problem Operations Research, 59(5):1269--1283.
Publications
Chiussi, A., Orlis, C., Roberti, R. and Dullaert, W. (2021). ATM cash replenishment under varying population coverage requirements The Journal of the Operational Research Society, :.
Glize, E., Roberti, R., Jozefowiez, N. and Ngueveu, S.U. (2020). Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems European Journal of Operational Research, 283(3):812--824.
Paradiso, R., Roberti, R., Lagana, D. and Dullaert, W. (2020). An exact solution framework for multitrip vehicle-routing problems with time windows Operations Research, 68(1):180--198.
Fonseca, J.P., van der Hurk, E., Roberti, R. and Larsen, A. (2018). A matheuristic for transfer synchronization through integrated timetabling and vehicle scheduling Transportation Research. Part B, Methodological, 109(March):128--149.
Besinovic, N., Goverde, R., Quaglietta, E. and Roberti, R. (2016). An integrated micro–macro approach to robust railway timetabling Transportation Research. Part B, Methodological, 87(May):14--32.
Roberti, R., Bartolini, E. and Mingozzi, A. (2015). The fixed charge transportation problem: An exact algorithm based on a new integer programming formulation Management Science, 61(6):1275--1291.
Buson, E., Roberti, R. and Toth, P. (2014). A reduced-cost iterated local search heuristic for the fixed-charge transportation problem Operations Research, 62(5):1095--1106.
Baldacci, R., Mingozzi, A., Roberti, R. and Calvo, R. (2013). An exact algorithm for the two-echelon capacitated vehicle routing problem Operations Research, 61(2):298--314.
Mingozzi, A., Roberti, R. and Toth, P. (2013). An exact algorithm for the multitrip vehicle routing problem INFORMS Journal on Computing, 25(2):193--207.
Baldacci, R., Mingozzi, A. and Roberti, R. (2012). New state-space relaxations for solving the traveling salesman problem with time windows INFORMS Journal on Computing, 24(3):356--371.
Baldacci, R., Mingozzi, A. and Roberti, R. (2012). Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints European Journal of Operational Research, 218(1):1--6.
Baldacci, R., Mingozzi, A. and Roberti, R. (2011). New route relaxation and pricing strategies for the vehicle routing problem Operations Research, 59(5):1269--1283.