Alberto Santini
About
I am an associate professor of Operational Research 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. During 2025-2027, I am coordinating the Transportation group of the Spanish O.R. Society.
Publications
- Santini, A., & Vaze, V. (2025). Integrated Schedule Planning for Regional Airlines Using Column Generation.
- Delle Donne, D., Santini, A., & Archetti, C. (2025). Integrating Public Transport in Sustainable Last-Mile Delivery: Column Generation Approaches. Available on-line (in advance) in the European Journal of Operational Research.
Citation
@article{delledonne2025fot, title={Integrating Public Transport in Sustainable Last-Mile Delivery: Column Generation Approaches}, author={{Delle Donne}, Diego and Santini, Alberto and Archetti, Claudia}, journal={European Journal of Operational Research}, year=2025, note={Available (in advance)}, doi={10.1016/j.ejor.2024.12.047} }
- Mandal, M. P., Santini, A., & Archetti, C. (2025). Tactical workforce sizing and scheduling decisions for last-mile delivery. European Journal of Operational Research, 323 (1), pp. 153-169.
Citation
@article{mandal2025stability, title={Tactical workforce sizing and scheduling decisions for last-mile delivery}, author={Mandal, Minakshi Punam and Santini, Alberto and Archetti, Claudia}, journal={European Journal of Operational Research}, year=2025, volume=323, issue=1, pages={153--169}, doi={10.1016/j.ejor.2024.12.006} }
- Santini, A. (2025). Destination selection and flight scheduling for regional airlines at slot-constrained airports. International Transactions in Operational Research, 32 (3), pp. 1400-1421.
Citation
@article{santini2025regional, title={Destination selection and flight scheduling for regional airlines at slot-constrained airports}, author={Santini, Alberto}, journal={International Transactions in Operational Research}, year=2025, volume=32, issue=3, pages={1400--1421}, doi={10.1111/itor.13505} }
- 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.
Citation
@article{santini2024minknapsack, title={The min-Knapsack Problem with Compactness Constraints and Applications in Statistics}, author={Santini, Alberto and Malaguti, Enrico}, journal={European Journal of Operational Research}, year=2024, volume=312, issue=1, pages={385--397}, doi={10.1016/j.ejor.2023.07.020} }
- Santini, A., Schneider, M., Vidal, T., & Vigo, D. (2023). Decomposition strategies for vehicle routing heuristics. INFORMS Journal on Computing, 35.3, pp. 543-559.
Citation
@article{santini2023decomposition, title={Decomposition strategies for vehicle routing heuristics}, author={Santini, Alberto and Schneider, Michael and Vidal, Thibaut and Vigo, Daniele}, journal={INFORMS Journal on Computing}, doi={10.1287/ijoc.2023.1288}, year=2023, volume=35, number=3, pages={543--559} }
- Santini, A. & Archetti, C. (2023). The Hazardous Orienteering Problem. Networks, 81 (2), pp. 235-252.
Citation
@article{santini2023hazardous, title={The hazardous orienteering problem}, author={Santini, Alberto and Archetti, Claudia}, journal={Networks}, doi={10.1002/net.22129}, year=2023, volume=81, issue=2, pages={235--252} }
- Delorme, M. & Santini, A. (2022). Energy-efficient automated vertical farms. Omega, 109, Article ID 102611.
Citation
@article{delorme2022elevator, title={Energy-efficient automated vertical farms}, author={Delorme, Maxence and Santini, Alberto}, journal={Omega}, volume=109, doi={10.1016/j.omega.2022.102611}, year=2022, note={{Article ID 102611}} }
- Santini, A., Viana, A., Klimentova, X., & Pedroso, J.P. (2022). The probabilistic travelling salesman problem with crowdsourcing. Computers & Operations Research, 142, Article ID 105722.
Citation
@article{santini2022crowd, title={The probabilistic {Travelling Salesman Problem} with crowdsourcing}, author={Santini, Alberto and Viana, Ana and Klimentova, Xenia and Pedroso, João Pedro}, journal={{Computers \& Operations Research}}, volume=142, doi={10.1016/j.cor.2022.105722}, year=2022, note={{Article ID 105722}} }
- 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.
Citation
@article{monaci2022tbkp, title={Exact algorithms for the 0--1 time-bomb knapsack problem}, author={Monaci, Michele and Pike-Burke, Ciara and Santini, Alberto}, journal={{Computers \& Operations Research}}, volume=145, doi={10.1016/j.cor.2022.105848}, year=2022, note={{Article ID 105848}} }
- Santini, A., Schneider, M., Bartolini, E., & Lemos, V. (2021). The crop growth planning problem in vertical farming. European Journal of Operational Research, 294 (1), pp. 377-390.
Citation
@article{santini2021vf, title={The crop growth planning problem in vertical farming}, author={Santini, Alberto and Schneider, Michael and Bartolini, Enrico and Greco de Lemos, Vinicius}, journal={{European Journal of Operational Research}}, year=2021, volume=294, issue=1, pages={377--390}, doi={10.1016/j.ejor.2021.01.034} }
- 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.
Citation
@article{blum2021commonss, title={Solving common longest subsequence problems via a transformation to the maximum clique problem}, author={Blum, Christian and Djukanovic, Marko and Santini, Alberto and Jiang, Hua and Li, Chu-Min and Manyà, Felip and Raidl, Günter}, journal={{Computers \& Operations Research}}, volume=125, year=2021, doi={10.1016/j.cor.2020.105089}, note={{Article ID 105089}} }
- Santini, A. (2021). Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic. Omega, 102, Article ID 102341.
Citation
@article{santini2021covid, title={Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic}, author={Santini, Alberto}, journal={Omega}, year=2021, volume=102, doi={10.1016/j.omega.2020.102341}, note={{Article ID 102341}} }
- 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.
Citation
@article{cornaz2019selective, title={A note on selective line-graphs and partition colorings}, author={Cornaz, Denis and Furini, Fabio and Malaguti, Enrico and Santini, Alberto}, journal={{Operations Research Letters}}, year=2019, volume=47, issue=6, pages={565--568}, doi={10.1016/j.orl.2019.08.005} }
- Santini, A. (2019). An Adaptive Large Neighbourhood Search Algorithm for the Orienteering Problem. Expert Systems with Applications, 123, pp. 154–167.
Citation
@article{santini2019op, title={An {Adaptive Large Neighbourhood Search} algorithm for the {Orienteering Problem}}, author={Santini, Alberto}, journal={{Expert Systems with Applications}}, volume=123, year=2019, pages={154--167}, doi={10.1016/j.eswa.2018.12.050} }
- 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.
Citation
@article{santini2018measuring, title={A comparison of acceptance criteria for the {Adaptive Large Neighbourhood Search} metaheuristic}, author={Santini, Alberto and Ropke, Stefan and Hvattum, Lars Magnus}, journal={{Journal of Heuristics}}, volume=24, issue=5, pages={783--815}, year=2018, doi={10.1007/s10732-018-9377-x} }
- Malaguti, E., Martello, S., & Santini, A. (2018). The Traveling Salesman Problem with Pickups, Deliveries, and Draft Limits. Omega, 74, pp. 50–58.
Citation
@article{malaguti2018travelling, title={The {Traveling Salesman Problem} with Pickups, Deliveries, and Draft Limits}, author={Malaguti, Enrico and Martello, Silvano and Santini, Alberto}, journal={{Omega}}, volume=74, pages={50--58}, year=2018, doi={10.1016/j.omega.2017.01.005} }
- Furini, F., Malaguti, E., & Santini, A. (2018). An Exact Algorithm for the Partition Coloring Problem. Computers & Operations Research, 92, pp. 170–181.
Citation
@article{furini2018branch, title={An Exact Algorithm for the {Partition Coloring Problem}}, author={Furini, Fabio and Malaguti, Enrico and Santini, Alberto}, journal={{Computers \& Operations Research}}, pages={170--181}, volume=92, year=2018, doi={10.1016/j.cor.2017.12.019} }
- 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.
Citation
@article{santini2017feeder, title={A branch-and-price approach to the {Feeder Network Design Problem}}, author={Santini, Alberto and Ropke, Stefan and Plum, Christian E.M.}, journal={{European Journal of Operational Research}}, pages={607--622}, volume=264, issue=2, year=2017, doi={10.1016/j.ejor.2017.06.063} }
- 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.
Citation
@article{bettinelli2017realtime, title={A real-time conflict solution algorithm for the {Train Rescheduling Problem}}, author={Bettinelli, Andrea and Santini, Alberto and Vigo, Daniele}, journal={{Transportation Research Part B: Methodological}}, pages={237--265}, volume=106, year=2017, doi={10.1016/j.trb.2017.10.005} }
- 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.
Citation
@article{santini2015note, title={A note on a model for quay crane scheduling with non-crossing constraints}, author={Santini, Alberto and Friberg, Henrik Alsing and Ropke, Stefan}, journal={{Engineering Optimization}}, volume=47, number=6, pages={860--865}, year=2015, doi = {10.1080/0305215X.2014.958731} }
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).