Effect of En-route Reassignment of Hospitals for Ambulances

This paper proposes a hospital assignment scheme for ambulances transporting patients, aiming at efficiently re-matching both parties even in the case of a demand surge. Built on top of the minimum cost maximum flow model, the allocation process adjusts link connectivity in the flow graph according to whether a patient can be cured at a hospital, reach within a deadline, and be reallocated to another hospital even while on the move. The prototype implementation using the Java language shows that the proposed scheme can reallocate patients with stable reassignment overhead, with the total moving distance being managed below 4.3 %.