Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909145120112640 |
|---|---|
| author | Mucke, Tom Renneke, Alexander Seesemann, Finn Engelhardt, Felix |
| author_facet | Mucke, Tom Renneke, Alexander Seesemann, Finn Engelhardt, Felix |
| contents | This paper aims to improve the average response time for naval accidents in the North and Baltic Sea. To do this we optimize the strategic distribution of the vessel fleet used by the Deutsche Gesellschaft zur Rettung Schiffbrüchiger (German Maritime Search and Rescue Service) (DGzRS) across several home stations. Based on these locations, in case of an incoming distress call the vessel with the lowest response time is dispatched. A particularity of the region considered is the fact that due to low tide, at predictable times some vessels and stations are not operational. In our work, we build a corresponding mathematical model for the allocation of rescue crafts to multiple stations. Thereafter, we show that the problem is NP-hard. Next, we provide an Integer Programming (IP) formulation. Finally, we propose several methods of simplifying the model and do a case study to compare their effectiveness. For this, we generate test instances based on real-world data. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_14556 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea Mucke, Tom Renneke, Alexander Seesemann, Finn Engelhardt, Felix Optimization and Control Computational Complexity Discrete Mathematics 03D15, 90C10, 90C15, 90C90 This paper aims to improve the average response time for naval accidents in the North and Baltic Sea. To do this we optimize the strategic distribution of the vessel fleet used by the Deutsche Gesellschaft zur Rettung Schiffbrüchiger (German Maritime Search and Rescue Service) (DGzRS) across several home stations. Based on these locations, in case of an incoming distress call the vessel with the lowest response time is dispatched. A particularity of the region considered is the fact that due to low tide, at predictable times some vessels and stations are not operational. In our work, we build a corresponding mathematical model for the allocation of rescue crafts to multiple stations. Thereafter, we show that the problem is NP-hard. Next, we provide an Integer Programming (IP) formulation. Finally, we propose several methods of simplifying the model and do a case study to compare their effectiveness. For this, we generate test instances based on real-world data. |
| title | Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea |
| topic | Optimization and Control Computational Complexity Discrete Mathematics 03D15, 90C10, 90C15, 90C90 |
| url | https://arxiv.org/abs/2403.14556 |