Capacitated Refuge Assignment for Speedy and Reliable Evacuation

Abstract

When a large-scale disaster occurs, each evacuee should move to an appropriate refuge in a speedy and safe manner. Most of the existing studies on the refuge assignment consider the speediness of evacuation and refuge capacity while the safety of evacuation is not taken into account. In this paper, we propose a refuge assignment scheme that considers both the speediness and safety of evacuation under the refuge capacity constraint. We first formulate the refuge assignment problem as a two-step integer linear program (ILP). Since the two-step ILP requires route candidates between evacuees and their possible refuges, we further propose a speedy and reliable route selection scheme as an extension of the existing route selection scheme. Through numerical results using the actual data of Arako district of Nagoya city in Japan, we show that the proposed scheme can improve the average route reliability among evacuees by 13.6% while suppressing the increase of the average route length among evacuees by 7.3%, compared with the distance-based route selection and refuge assignment. In addition, we also reveal that the current refuge capacity is not enough to support speedy and reliable evacuation for the residents.

Path reachability including distance-constrained detours

“…Figure 11 shows the road network of 2 , 640 [ m ] × 1 , 690 [ m ] Arako area of Nagoya city in Japan. 46 This area is further divided into three refuge areas using the existing refuge assignment scheme 47 : Area 1 ( 1 , 220 [ m ] × 960 [ m ] green area), Area 2 ( 540 [ m ] × 740 [ m ] red area), and Area 3 ( 1 , 680 [ m ] × 1 , 500 [ m ] blue area). We also show the availability p e of each link e .…”

“…Figure11shows the road network of 2, 640 ½m 3 1, 690 ½m Arako area of Nagoya city in Japan 46. This area is further divided into three refuge areas using the existing refuge assignment scheme47 : Area 1 (1, 220½m 3 960 ½m green area), Area 2 (540 ½m 3 740 ½m red area), and Area 3 (1, 680 ½m 3 1, 500 ½m blue area). We also show the availability p e of each link e.In each area a 2 f1, 2, 3g, we prepare three evacuation situations where an evacuee moves from a certain position s = s a, i (i 2 f1, 2, 3g) (a green point) to the corresponding refuge t = t a (a blue point), as shown in Figures12(a), 13, and 14(a) for Area 1, Figures from 15(a) through 17(a) for Area 2, and Figures from 18(a) through 20(a) for Area 3.…”