Alberto Santini

About

I am a tenure-track assistant professor and a “Ramon y Cajal” fellow at Universitat Pompeu Fabra in Barcelona, Spain. I am also an affiliate professor at the Barcelona Graduate School of Mathematics and the Data Science Centre of the Barcelona School of Economics.

• Curriculum Vitæ
• Google Scholar Profile
• Github Profile
• Contact: alberto.santini@upf.edu

Publications

• Mandal, M. P., Santini, A., & Archetti, C. (2024). Tactical workforce sizing and scheduling decisions for last-mile delivery.
  • Preprint
  • Repository
• Delle Donne, D., Santini, A., & Archetti, C. (2024). Integrating Public Transport in Sustainable Last-Mile Delivery: Column Generation Approaches.
  • Preprint
  • Supplemental Material
  • Repository
• Santini, A. & Malaguti, E. (2024). The min-Knapsack problem with compactness constraints and applications in statistics. European Journal of Operational Research, 321 (1), pp. 385-397.
  • Preprint
  • Repository
  • Final version
• Santini, A., Schneider, M., Vidal, T., & Vigo, D. (2023). Decomposition strategies for vehicle routing heuristics. INFORMS Journal on Computing, 35.3, pp. 543-559.
  • Preprint
  • Repository
  • Final version
• Santini, A. & Archetti, C. (2023). The Hazardous Orienteering Problem. Networks, 81 (2), pp. 235-252.
  • Preprint
  • Repository
  • Final version
• Delorme, M. & Santini, A. (2022). Energy-efficient automated vertical farms. Omega, 109, Article ID 102611.
  • Preprint
  • Repository
  • Final version
• Santini, A., Viana, A., Klimentova, X., & Pedroso, J.P. (2022). The probabilistic travelling salesman problem with crowdsourcing. Computers & Operations Research, 142, Article ID 105722.
  • Preprint
  • Repository
  • Final version
• Monaci, M., Pike-Burke, C., & Santini, A. (2022). Exact algorithms for the 0-1 time-bomb knapsack problem. Computers & Operations Research, 145, Article ID 105848.
  • Preprint
  • Repository
  • Final version
• Santini, A., Schneider, M., Bartolini, E., & Lemos, V. (2021). The crop growth scheduling problem in vertical farming. European Journal of Operational Research, 294 (1), pp. 377-390.
  • Preprint
  • Repository
  • Final version
• Blum, C., Djukanovic, M., Santini, A., Jiang, H., Li, C.M., Manyà, F., & Raidl, G. (2021). Solving common longest subsequence problems via a transformation to the maximum clique problem. Computers & Operations Research, 125, Article ID 105089.
  • Preprint
  • Final version
• Santini, A. (2021). Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic. Omega, 102, Article ID 102341.
  • Preprint
  • Repository
  • Website
  • Final version
• Cornaz, D., Furini, F., Malaguti, E., & Santini, A. (2019). A note on selective line-graphs and partition colorings. Operations Research Letters, 47 (6), pp. 565–568.
  • Preprint
  • Repository
  • Final version
• Santini, A. (2019). An Adaptive Large Neighbourhood Search Algorithm for the Orienteering Problem. Expert Systems with Applications, 123, pp. 154–167.
  • Preprint
  • Repository
  • Final version
• Santini, A., Ropke, S., & Hvattum, L. (2018). A comparison of acceptance criteria for the Adaptive Large Neighbourhood Search metaheuristic. Journal of Heuristics, 24 (5), pp. 783–815.
  • Preprint
  • Repository
  • Final version
• Malaguti, E., Martello, S., & Santini, A. (2018). The Traveling Salesman Problem with Pickups, Deliveries, and Draft Limits. Omega, 74, pp. 50–58.
  • Preprint
  • Repository
  • Final version
• Furini, F., Malaguti, E., & Santini, A. (2018). An Exact Algorithm for the Partition Coloring Problem. Computers & Operations Research, 92, pp. 170–181.
  • Preprint
  • Repository
  • Final version
• Santini, A., Ropke, S., & Plum, C. (2017). A branch-and-price approach to the Feeder Network Design Problem. European Journal of Operational Research, 264 (2), pp. 607–622.
  • Preprint
  • Repository
  • Final version
• Bettinelli, A., Santini, A., & Vigo, D. (2017). A real-time conflict solution algorithm for the Train Rescheduling Problem. Transportation Research Part B: Methodological, 106, pp. 237–265.
  • Preprint
  • Repository
  • Final version
• Santini, A., Friberg, H., & Ropke, S. (2015). A note on a model for quay crane scheduling with non-crossing constraints. Engineering Optimization, 47 (6), pp. 860–865.
  • Preprint
  • Final version

Scientific organisations I founded

• EUROYoung, a Forum within the Association of European Operational Research Societies (EURO).
• AIROYoung, the youth branch of the Italian Operational Research Association.

Resources

• Companies working in Operational Research in Italy.
• PhD courses in Operational Research at Italian universities.
• Example use of the CPLEX C++ API.
• Example implementation of a Genetic Algorithm in C++.
• Example implementation of the Adaptive Large Neighbourhood Search in C++.
• Example implementation of a Biased Random-Key Genetic Algorithm in C++.
• Notes for the Italian State exam for chartered shipbroker (in Italian).