Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420487 | Discrete Applied Mathematics | 2009 | 13 Pages |
In this paper, we consider the evacuation problem in a network which consists of a directed graph with capacities and transit times on its arcs. This problem can be solved by the algorithm of Hoppe and Tardos [B. Hoppe, É. Tardos, The quickest transshipment problem, Math. Oper. Res. 25(1) (2000) 36–62] in polynomial time. However their running time is high-order polynomial, and hence is not practical in general. Thus, it is necessary to devise a faster algorithm for a tractable and practically useful subclass of this problem. In this paper, we consider a network with a sink ss such that (i) for each vertex v≠sv≠s the sum of the transit times of arcs on any path from vv to ss takes the same value, and (ii) for each vertex v≠sv≠s the minimum vv-ss cut is determined by the arcs incident to ss whose tails are reachable from vv. This class of networks is a generalization of grid networks studied in the paper [N. Kamiyama, N. Katoh, A. Takizawa, An efficient algorithm for evacuation problem in dynamic network flows with uniform arc capacity, IEICE Trans. Infrom. Syst. E89-D (8) (2006) 2372–2379]. We propose an efficient algorithm for this network problem.