Operational Research Community
- Companies working in Operational Research in Italy.
- PhD courses in Operational Research at Italian universities.
About
I am a tenure-track assistant professor at Pompeu Fabra University in Barcelona, Spain. I am also an affiliated professor at the Barcelona Graduate School of Mathematics and Barcelona Graduate School of Economics.
I founded AIROYoung and EUROYoung, two chapters bringing together young Operational Research scientists in Italy and Europe, respectively. I also sit on the board of directors of AIRO, the Italian Operational Research Association.
Contacts
Departament d'Economia i Empresa
Carrer Ramon Trias-Fargas, 25-27
08005 Barcelona, Spain
Tel: +34 935 42 14 94
Email: alberto.santini@upf.edu Assistant (only if urgent):
Modou Fofana
Tel: +34 935 42 27 14
Highlights
Publications
Solving common longest subsequence problems via a transformation to the maximum clique problem
| Authors | C. Blum, M. Djukanovic, A. Santini, H. Jiang, C.M. Li, F. Manyà, G. Raidl | |
| Year | 2021 | |
| Journal | Computers & Operations Research, 125, 2021 |
Optimising the assignment of swabs and reagents for PCR testing during a viral epidemic
| Authors | A. Santini | |
| Year | 2020 | |
| Journal | Omega (in press) | |
| Code & data |
|
The Crop Growth Planning Problem in Vertical Farming
| Authors | A. Santini, E. Bartolini, M. Schneider, V. Greco de Lemos | |
| Year | 2020 | |
| Journal | Submitted to the European Journal of Operational Research | |
| Code & data |
|
The probabilistic travelling salesman problem with crowdsourcing
| Authors | A. Santini, A. Viana, X. Klimentova, J.P. Pedroso | |
| Year | 2020 | |
| Journal | Submitted to Transportation Research Part B: Methodological | |
| Data |
|
An Adaptive Large Neighbourhood Search Algorithm for the Orienteering Problem
| Authors | A. Santini | |
| Year | 2019 | |
| Journal | Expert Systems with Applications, 123:154-167, 2019 | |
| Code & data |
|
A note on Selective line-graphs and partition colorings
| Authors | D. Cornaz, F. Furini, E. Malaguti, A. Santini | |
| Year | 2019 | |
| Journal | Operations Research Letters, 47(6):565-568, 2019 | |
| Code & data |
|
The Travelling Salesman Problem with Pickups, Deliveries, and Draught Limits
| Authors | E. Malaguti, S. Martello, A. Santini | |
| Year | 2018 | |
| Journal | Omega, 74:50-58, 2018 | |
| Code & data |
|
A Comparison of Acceptance Criteria for the Adaptive Large Neighbourhood Search Metaheuristic
| Authors | A. Santini, S. Ropke, L. M. Hvattum | |
| Year | 2018 | |
| Journal | Journal of Heuristics, 24:783-815, 2018 |
An Exact Algorithm for the Partition Colouring Problem
| Authors | F. Furini, E. Malaguti, A. Santini | |
| Year | 2018 | |
| Journal | Computers & OR, 92:170-181, 2018 | |
| Code & data |
|
A Branch-and-Price Approach to the Feeder Network Design Problem
| Authors | A. Santini, C. E. M. Plum, S. Ropke | |
| Year | 2017 | |
| Journal | European Journal of Operational Research, 264:607-622, 2017 | |
| Code & data |
|
A Real-Time Conflict Solution Algorithm for the Train Rescheduling Problem
| Authors | D. Bettinelli, A. Santini, D. Vigo | |
| Year | 2017 | |
| Journal | Transportation Research Part B: Methodological, 106:237-265, 2017 | |
| Code & data |
|
A note on a model for quay crane scheduling with non-crossing constraints
| Authors | A. Santini, H. A. Friberg, S. Ropke | |
| Year | 2015 | |
| Journal | Engineering Optimization, 47:860-865, 2015 |
Resources
Tutorials
Software
- Selective Graph Colouring solver using maximum cliques.
- ALNS-based heuristic solver for the Orienteering Problem.
- Simple implementation of the ALNS metaheuristic framework.
- Exact solver for the Selective Graph Colouring problem, based on branch-and-price.
- Exact solver for a maritime Vehicle Routing Problem, based on branch-and-price.
- Simple implementation of the Biased Random-Key Genetic Algorithm metaheuristic framework.
- Exact and heuristic solvers for the black-and-white Knapsack Problem.
- A branch-and-cut solver for the Travelling Salesman Problem with draught limits.
- Exact and heuristic solvers for the Probabilistic TSP Problem with Crowdsourcing.