Mario Benini
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mario Benini has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Alessandro Agnetis
Università degli Studi di Siena
3 shared publications Paolo Detti
3 shared publicationsMarco Pranzo
2 shared publications- Paolo Detti
University of Siena
2 shared publications - Andrea Pacifici
Università di Roma Tor Vergata
1 shared publication Ben Hermans
1 shared publication
Latest Publications
- Open Access
- 20 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Replication and sequencing of unreliable jobs on m parallel machines: New results
- 20 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 183
Open AccessReplication and sequencing of unreliable jobs on m parallel machines: New results
- Open Access
- 25 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (3) , 767-779
Trade-off between utility and fairness in two-agent single-machine scheduling
- 25 January 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 323 (3) , 767-779
Open AccessTrade-off between utility and fairness in two-agent single-machine scheduling
- Open Access
- 21 June 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 159
Solving crop planning and rotation problems in a sustainable agriculture perspective
- 21 June 2023
- Published by Elsevier in Computers & Operations Research
- Vol. 159
Open AccessSolving crop planning and rotation problems in a sustainable agriculture perspective
- 1 March 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 139
Replication and sequencing of unreliable jobs on parallel machines
- 1 March 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 139
Replication and sequencing of unreliable jobs on parallel machines
- Open Access
A vehicle routing problem for biological sample transportation in healthcare: mathematical formulations and a metaheuristic approach
In this paper, a real-world transportation problem is addressed, concerning the collection and the transportation of biological sample tubes from sampling points to a main hospital. Blood and other biological samples are collected in different centers during morning hours. Then, the samples are transported to the main hospital, for their analysis, by a fleet of vehicles located in geographically distributed depots. Each sample has a limited lifetime and must arrive to the main hospital within that time. If a sample cannot arrive to the hospital within the lifetime, either is discarded or must be processed in dedicated facilities called Spoke Centers.Two Mixed Integer Linear Programming formulations and an Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm have been developed for the problem. Computational experiments on different sets of instances based on real-life data provided by the Local Healthcare Authority of Bologna, Italy, are presented. A comparison on small instances with the optimal solutions obtained by the formulations shows the effectiveness of the proposed ALNS algorithm. On real-life instances, different batching policies of the samples are evaluated. The results show that the ALNS algorithm is able to find solutions in which all the samples are delivered on time, while in the real case about the 40% [5] of the samples is delivered late.
Open AccessA vehicle routing problem for biological sample transportation in healthcare: mathematical formulations and a metaheuristic approach
In this paper, a real-world transportation problem is addressed, concerning the collection and the transportation of biological sample tubes from sampling points to a main hospital. Blood and other biological samples are collected in different centers during morning hours. Then, the samples are transported to the main hospital, for their analysis, by a fleet of vehicles located in geographically distributed depots. Each sample has a limited lifetime and must arrive to the main hospital within that time. If a sample cannot arrive to the hospital within the lifetime, either is discarded or must be processed in dedicated facilities called Spoke Centers.Two Mixed Integer Linear Programming formulations and an Adaptive Large Neighborhood Search (ALNS) metaheuristic algorithm have been developed for the problem. Computational experiments on different sets of instances based on real-life data provided by the Local Healthcare Authority of Bologna, Italy, are presented. A comparison on small instances with the optimal solutions obtained by the formulations shows the effectiveness of the proposed ALNS algorithm. On real-life instances, different batching policies of the samples are evaluated. The results show that the ALNS algorithm is able to find solutions in which all the samples are delivered on time, while in the real case about the 40% [5] of the samples is delivered late.