Constructing location models for evacuation planning

• Project/Area Number: 17K12641
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Theory of informatics
• Research Institution: University of Hyogo (2018-2019); Chuo University (2017)
• Principal Investigator: Higashikawa Yuya 兵庫県立大学, 社会情報科学部, 准教授 (20749486)
• Project Period (FY): 2017-04-01 – 2020-03-31
• Project Status: Completed (Fiscal Year 2019)
• Budget Amount: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000); Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000); Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
• Keywords: 動的フローネットワーク / 施設配置問題 / アルゴリズム / 最大後悔最小化 / 避難計画 / 組合せ最適化 / 避難計画問題

Outline of Final Research Achievements

It is known that when the Tohoku-Pacific Ocean Earthquake occurred in Japan on March 11, 2011, many people failed to evacuate due to traffic congestion and lost their lives. Therefore, from the viewpoint of disaster prevention, it has now become extremely important to establish how to determine where evacuation shelters are located in cities. In order to model the delay of evacuation time, we introduce "dynamic flow networks" which is well-known in the literature on theoretical computer science. In the research project, we considered several criteria based on the evacuation time in dynamic flow networks, and developed efficient algorithms for each criterion.

Academic Significance and Societal Importance of the Research Achievements

本研究の特色は，交通渋滞を考慮した避難施設配置が可能な理論モデルを扱い，大規模な一般のネットワークに適用可能な高速アルゴリズムの構築を掲げている点にある．本研究において，対象のネットワーククラスを十分一般化出来たとは言えないが，本研究の成果は，現実の避難計画に理論的保証を与える上で非常に大きな社会的意義を持つと考えられる．

Research Products

• [Int'l Joint Research] Simon Fraser University/University of Lethbridge(カナダ)
• [Int'l Joint Research] Simon Fraser University(カナダ)
• [Int'l Joint Research] 香港科技大学(中国)
• [Int'l Joint Research] Simon Fraser University/University of Lethbridge(カナダ)
• [Int'l Joint Research] 香港科技大学(香港)
• [Journal Article] Minsum k-Sink Problem on Path Networks (2020)
  • Author(s): Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
  • Journal Title: Theoretical Computer Science Volume: 806 Pages: 388-401
  • DOI: 10.1016/j.tcs.2019.05.047
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] A Survey on Facility Location Problems in Dynamic Flow Networks (2019)
  • Author(s): Yuya Higashikawa, Naoki Katoh
  • Journal Title: The Review of Socionetwork Strategies Volume: 13(2) Issue: 2 Pages: 163-208
  • DOI: 10.1007/s12626-019-00047-z
  • Peer Reviewed / Open Access
• [Journal Article] Minmax-Regret Evacuation Planning for Cycle Networks (2019)
  • Author(s): Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
  • Journal Title: Proceedings of The 15th Annual Conference on Theory and Applications of Models of Computation Volume: - Pages: 42-58
  • DOI: 10.1007/978-3-030-14812-6_4
  • ISBN: 9783030148119, 9783030148126
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] The Mixed Evacuation Problem (2017)
  • Author(s): Y. Hanawa, Y. Higashikawa, N. Kamiyama, N. Katoh and A. Takizawa
  • Journal Title: Journal of Combinatorial Optimization Volume: 印刷中 Issue: 4 Pages: 1299-1314
  • DOI: 10.1007/s10878-017-0237-7
  • NAID: 120006998855
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Minimax Regret 1-Median Problem in Dynamic Path Networks (2017)
  • Author(s): Y. Higashikawa, S. W. Cheng, T. Kameda, N. Katoh and S. Saburi
  • Journal Title: Theory of Computing Systems Volume: 印刷中 Issue: 6 Pages: 1349-1350
  • DOI: 10.1007/s00224-018-9861-6
  • Peer Reviewed / Int'l Joint Research
• [Presentation] 避難者数が媒介変数に依存する最大後悔最小化1-シンク配置問題 (2020)
  • Author(s): 戸國友貴，加藤直樹，東川雄哉，照山順一，藤江哲也
  • Organizer: 2020年春季研究発表会 (日本オペレーションズ・リサーチ学会)
• [Presentation] 避難者数が媒介変数に依存する最大後悔最小化1-シンク配置問題 (2020)
  • Author(s): 戸國友貴，加藤直樹，東川雄哉，照山順一，藤江哲也
  • Organizer: コンピュテーション研究会 (電子情報通信学会)
• [Presentation] Minmax-Regret Evacuation Planning for Cycle Networks (2019)
  • Author(s): R. Benkoczi, B. Bhattacharya, Y. Higashikawa, T. Kameda and N. Katoh
  • Organizer: The 15th Annual Conference on Theory and Applications of Models of Computation (TAMC 2019)
  • Int'l Joint Research
• [Presentation] An Improved Algorithm for Minsum k-Sink Problems on Dynamic Flow Path Networks (2019)
  • Author(s): Y. Higashikawa, N. Katoh and J. Teruyama
  • Organizer: The 30th European Conference on Operational Research (EURO 2019)
  • Int'l Joint Research
• [Presentation] An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks (2018)
  • Author(s): Yuya HIgashikawa
  • Organizer: The 29th International Symposium on Algorithms and Computation (ISAAC 2018)
  • Int'l Joint Research
• [Presentation] Minsum k-Sink Problem on Dynamic Flow Path Networks (2018)
  • Author(s): Naoki Katoh
  • Organizer: The 29th International Workshop on Combinatorial Algorithms (IWOCA 2018)
  • Int'l Joint Research
• [Presentation] 媒介変数表示される重みに対する最大後悔最小化1-センター問題 (2018)
  • Author(s): 大勝章平
  • Organizer: コンピュテーション研究会 (電子情報通信学会)
• [Presentation] Minsum k-Sink Problem on Dynamic Flow Path Networks (2018)
  • Author(s): Y. Higashikawa
  • Organizer: The 29th International Workshop on Combinatorial Algorithms (IWOCA 2018)
  • Int'l Joint Research
• [Presentation] Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks (2017)
  • Author(s): Y. Higashikawa
  • Organizer: The 15th Workshop on Algorithms and Data Structures (WADS 2017)
  • Int'l Joint Research