A multi-period ambulance location and allocation problem in the disaster

Jian Wang (), Yin Wang and Mingzhu Yu ()
Additional contact information
Jian Wang: Huazhong University of Science and Technology, Key Laboratory of Image Processing and Intelligent Control, Ministry of Education
Yin Wang: Huazhong University of Science and Technology, Key Laboratory of Image Processing and Intelligent Control, Ministry of Education
Mingzhu Yu: Shenzhen University

Journal of Combinatorial Optimization, No 0, 24 pages

Abstract: Abstract To achieve quick response in the disaster, this paper addresses the issue of ambulance location and allocation, as well as the location problem of temporary medical centers. Considering budget and capacity limitations, a multi-period mixed integer programming model is proposed and two hybrid heuristic algorithms are designed to solve this complex problem. The proposed model and algorithm are further verified in a real case study, and the numerical experiments demonstrate the effectiveness of our proposed model. Specifically, we obtain several findings based on the computational results: (1) The best locations of ambulance stations should change in each period because the demand rate changes over time. (2) Involving temporary medical centers is necessary to reduce the average waiting time of injured people. (3) It may not be optimal to allocate ambulances from the nearest ambulance stations because of potentially limited station capacity.

Keywords: Ambulance station location; Ambulance allocation; Disaster response (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00610-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00610-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00610-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().