In this paper, we consider a new selective routing problem, where a subset of customers should be serviced by a limited fleet of vehicles with the aim of minimizing the total latency. A service level constraint is added to guarantee that a minimum system performance is achieved. Assuming that the travel times are uncertain, we address the problem through a mean-risk approach. The inclusion of risk in the objective function makes the problem computationally challenging. To solve it, we propose an efficient heuristic, relying on a variable neighbourhood search mechanism, able to strike the balance between service level and latency. A detailed discussion of the model, which includes simulation tests and a sensitivity analysis, is carried out to illustrate the applicability of our approach in a post-disaster scenario, taking as a case study the Haiti earthquake in 2010. Additional computational experiments show that the proposed heuristic is effective for this difficult problem and often matches optimal solutions for small and medium-scale benchmark instances.
The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations / Bruni, M. E.; Khodaparasti, S.; Beraldi, P.. - In: OMEGA. - ISSN 0305-0483. - 92:102154(2020), pp. 1-13. [10.1016/j.omega.2019.102154]
The selective minimum latency problem under travel time variability: An application to post-disaster assessment operations
Bruni M. E.;Khodaparasti S.;
2020
Abstract
In this paper, we consider a new selective routing problem, where a subset of customers should be serviced by a limited fleet of vehicles with the aim of minimizing the total latency. A service level constraint is added to guarantee that a minimum system performance is achieved. Assuming that the travel times are uncertain, we address the problem through a mean-risk approach. The inclusion of risk in the objective function makes the problem computationally challenging. To solve it, we propose an efficient heuristic, relying on a variable neighbourhood search mechanism, able to strike the balance between service level and latency. A detailed discussion of the model, which includes simulation tests and a sensitivity analysis, is carried out to illustrate the applicability of our approach in a post-disaster scenario, taking as a case study the Haiti earthquake in 2010. Additional computational experiments show that the proposed heuristic is effective for this difficult problem and often matches optimal solutions for small and medium-scale benchmark instances.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S030504831930355X-main.pdf
non disponibili
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Non Pubblico - Accesso privato/ristretto
Dimensione
2.53 MB
Formato
Adobe PDF
|
2.53 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2980522