Optimizing Ambulance Allocation in Dynamic Urban Environments: A Historic Data-Driven Approach

Citations

WEB OF SCIENCE

2

초록

In this study, we present a methodology to solve the multi-period ambulance relocation problem based on historical data. We present a methodology to convert historical data in latitude-longitude coordinates into cell-based network data. Then, we propose a mixed-integer programming model that utilizes the converted data for the concomitant problem. Patient incidence is highly uncertain. Rather than simply covering historical demand, we propose a methodology that allows ambulances to reach as many locations as possible at any given time within a limited amount of time, the golden time. We experimented with real data from Seoul, South Korea, and show that the proposed mathematical model can derive an efficient ambulance operation policy with fewer ambulances.

키워드

ambulance relocation problem; integer programming; maximal expected covering location problem; multi-period problem; COVERING LOCATION MODEL; REDEPLOYMENT
제목
Optimizing Ambulance Allocation in Dynamic Urban Environments: A Historic Data-Driven Approach
저자
Kang, Seongho; Cheong, Taesu
DOI
10.3390/app132111671
발행일
2023-11
유형
Article
저널명
Applied Sciences (Switzerland)
권
13
호
21