Abstract
This paper presents a design and analyzes the performance of a hospital assignment and reassignment scheme for emergency rescue services based on minimum cost maximum flow algorithm. It consists of flow graph building, link capacity updating, and allocation discovering steps. The efficiency of the algorithm makes it possible to reallocate hospitals even in case of dynamic changes in the number of patients or hospitals. The performance measurement result obtained from a prototype implementation shows that the proposed scheme can reduce the transport time requirement miss by up to 24%.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have