[2I5-OS-9b] AIと制約プログラミング

[2I5-OS-9b-04] Enumerating efficient and exhaustive routes for publicity cars at the time of disaster using ZDDs

〇Sora Harada¹, Masakazu Ishihata² (1. National Institute of Technology, Kisarazu College, 2. NTT Communication Science Laboratories)

Keywords:ZDD, Routes enumeration, Graph Algorithms, Frontier-based Search

Conveying information to residents at the time of disaster plays an important role. When communication infrastructure is damaged by a disaster, rudimentary ways are attempted such as door-to-door canvass. In Typhoon Faxai (2019), the local government provided information using publicity cars due to damaged communication and power network. In an emergency, Conveying information required efficiency and comprehensiveness that can be communicated to all residents.
This study aims to enumerate efficient and comprehensive routes for publicity cars. At first, we defined a mathematical problem that enumerated routes for publicity cars. then, we proposed method enumerating routes using ZDDs and frontier-based search.