The purpose of the present work is the Helicopter Rescue optimization in the Lombardy region in collaboration with AREU (Azienda Regionale Emergenza Urgenza). The main topic is the development of an analytical method with the goal of minimizing the flight time during the mission of the Helicopter Rescue. The purpose of the Helicopter Rescue mission is to reach one or more patients in a precise demand point as quick as possible. The problem of the quickest path has been defined in order to model the helicopter flight in a manner that is extremely realistic. To solve this problem, an appropriate algorithm is implemented: the Helicopter Quickest Path Algorithm (HQPA), based on Dijkstra algorithm and its variant A*. In particular, the work is based on a graph representing the whole Lombardy region whose nodes are real recorded points, characterized by geographical coordinates and elevation. Seven meaningful scenarios, in which some Helicopter Rescue missions have been simulated on the territory, have been considered in order to test HQPA. The results obtained in the previous scenarios are then compared to the exact solution of mathematical programming formulation, performed by the Gurobi 7.0.0 solver. Then, two types of comparison are performed using information resulting from the statistical analysis on the real data for the years 2015 and 2016: the first one is between the real flight time and the theoretical one, obtained by HQPA, the latter is between the last one and the flight time calculated in the previous thesis, using the ArcGIS software. The purposes of both analyses is to provide a qualitative interpretation of the results, highlighting the main differences. Finally, only for night-time missions, the strategy performed by AREU about the helicopter activation choice is verified analysing three cases in which the demand points are located halfway between the two H24 HEMS (Helicopter Emergency Medical Service) bases in Brescia and Como.
Il presente lavoro di tesi riguarda l’ottimizzazione del servizio di elisoccorso nella regione Lombardia, effettuato in collaborazione con l’AREU (Azienda Regionale Emergenza Urgenza). Il tema cardine è lo sviluppo di un metodo analitico che abbia l’obiettivo di minimizzare il tempo di volo durante le missioni di elisoccorso. Lo scopo di queste è raggiungere uno o più pazienti in un preciso punto di richiesta (demand point) nel minor tempo possibile. Si è definito un problema di cammino minimo per modellare il volo dell’elicottero in modo più aderente possibile alla realtà. Per risolvere tale problema, si è implementato un algoritmo apposito, l’Helicopter Quickest Path Algorithm (HQPA), basato sull’algoritmo di Dijkstra e la sua variante A*. In particolare, si è lavorato su un grafo rappresentante l’intera regione Lombardia, i cui nodi sono dei punti realmente censiti, caratterizzati da coordinate geografiche ed elevazione. Al fine di testare l’algoritmo HQPA, sono stati considerati sette scenari significativi nei quali si sono simulate delle missioni di elisoccorso sul territorio. Successivamente, si è confrontato quanto ottenuto con la soluzione esatta, fornita dal solutore Gurobi 7.0.0, della formulazione di programmazione matematica, implementata in linguaggio AMPL. In seguito, utilizzando informazioni derivanti dall’analisi statistica basata sui dati reali degli anni 2015 e 2016, sono stati effettuati due tipi di confronto: rispettivamente, tra il tempo di volo reale e quello teorico ottenuto tramite HQPA e tra quest’ultimo con il tempo calcolato nei precedenti lavori di tesi, tramite il software ArcGIS. Lo scopo di entrambe le analisi è fornire un’interpretazione qualitativa dei risultati, facendo emergere le principali differenze. Infine, per le sole missioni notturne, è stata verificata la metodologia utilizzata dall’AREU circa la decisione su quale elicottero far intervenire analizzando tre casi in cui i demand points sono situati in una zona intermedia tra le due basi HEMS (Helicopter Emergency Medical Service) di Brescia e Como, operative H24.
Problema di cammino minimo per il volo dell'elicottero e sue applicazioni al servizio di elisoccorso
MIELE, ANDREA;LOZUPONE, NICOLA
2016/2017
Abstract
The purpose of the present work is the Helicopter Rescue optimization in the Lombardy region in collaboration with AREU (Azienda Regionale Emergenza Urgenza). The main topic is the development of an analytical method with the goal of minimizing the flight time during the mission of the Helicopter Rescue. The purpose of the Helicopter Rescue mission is to reach one or more patients in a precise demand point as quick as possible. The problem of the quickest path has been defined in order to model the helicopter flight in a manner that is extremely realistic. To solve this problem, an appropriate algorithm is implemented: the Helicopter Quickest Path Algorithm (HQPA), based on Dijkstra algorithm and its variant A*. In particular, the work is based on a graph representing the whole Lombardy region whose nodes are real recorded points, characterized by geographical coordinates and elevation. Seven meaningful scenarios, in which some Helicopter Rescue missions have been simulated on the territory, have been considered in order to test HQPA. The results obtained in the previous scenarios are then compared to the exact solution of mathematical programming formulation, performed by the Gurobi 7.0.0 solver. Then, two types of comparison are performed using information resulting from the statistical analysis on the real data for the years 2015 and 2016: the first one is between the real flight time and the theoretical one, obtained by HQPA, the latter is between the last one and the flight time calculated in the previous thesis, using the ArcGIS software. The purposes of both analyses is to provide a qualitative interpretation of the results, highlighting the main differences. Finally, only for night-time missions, the strategy performed by AREU about the helicopter activation choice is verified analysing three cases in which the demand points are located halfway between the two H24 HEMS (Helicopter Emergency Medical Service) bases in Brescia and Como.File | Dimensione | Formato | |
---|---|---|---|
2017_12_Miele_Lozupone.pdf
accessibile in internet solo dagli utenti autorizzati
Descrizione: Testo della tesi
Dimensione
6.46 MB
Formato
Adobe PDF
|
6.46 MB | Adobe PDF | Visualizza/Apri |
I documenti in POLITesi sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/10589/138688