TY - GEN

T1 - The mixed evacuation problem

AU - Hanawa, Yosuke

AU - Higashikawa, Yuya

AU - Kamiyama, Naoyuki

AU - Katoh, Naoki

AU - Takizawa, Atsushi

N1 - Funding Information:
This research was the result of the joint research with CSIS, the University of Tokyo (No. 573) and used the following data: Digital Road Map Database extended version 2013 provided by Sumitomo Electric Industries, Ltd and Zmap TOWN II 2008/09 Shapefile Wakayama prefecture provided by Zenrin Co. Ltd. Y. Higashikawa, N. Katoh and A. Takizawa?This work was partially supported by JSPS Grant-in-Aid for Scientific Research(A) (25240004). N. Kamiyama?This work was supported by JST, PRESTO.
Publisher Copyright:
© Springer International Publishing AG 2016.

PY - 2016

Y1 - 2016

N2 - A dynamic network introduced by Ford and Fulkerson is a directed graph with capacities and transit times on its arcs. The quickest transshipment problem is one of the most fundamental problems in dynamic networks. In this problem, we are given sources and sinks. Then, the goal of this problem is to find a minimum time limit such that we can send exactly the right amount of flow from sources to sinks. In this paper, we introduce a variant of this problem called the mixed evacuation problem. This problem models an emergent situation in which people can evacuate on foot or by car. The goal is to organize such a mixed evacuation so that an efficient evacuation can be achieved. In this paper, we study this problem from the theoretical and practical viewpoints. In the first part, we prove the polynomial-time solvability of this problem in the case where the number of sources and sinks is not large, and also prove the polynomial-time solvability and computational hardness of its variants with integer constraints. In the second part, we apply our model to the case study of Minabe town in Wakayama prefecture, Japan.

AB - A dynamic network introduced by Ford and Fulkerson is a directed graph with capacities and transit times on its arcs. The quickest transshipment problem is one of the most fundamental problems in dynamic networks. In this problem, we are given sources and sinks. Then, the goal of this problem is to find a minimum time limit such that we can send exactly the right amount of flow from sources to sinks. In this paper, we introduce a variant of this problem called the mixed evacuation problem. This problem models an emergent situation in which people can evacuate on foot or by car. The goal is to organize such a mixed evacuation so that an efficient evacuation can be achieved. In this paper, we study this problem from the theoretical and practical viewpoints. In the first part, we prove the polynomial-time solvability of this problem in the case where the number of sources and sinks is not large, and also prove the polynomial-time solvability and computational hardness of its variants with integer constraints. In the second part, we apply our model to the case study of Minabe town in Wakayama prefecture, Japan.

UR - http://www.scopus.com/inward/record.url?scp=85007210070&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85007210070&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-48749-6_2

DO - 10.1007/978-3-319-48749-6_2

M3 - Conference contribution

AN - SCOPUS:85007210070

SN - 9783319487489

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 18

EP - 52

BT - Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings

A2 - Li, Minming

A2 - Wang, Lusheng

A2 - Chan, T-H. Hubert

PB - Springer Verlag

T2 - 10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016

Y2 - 16 December 2016 through 18 December 2016

ER -