Given a transportation network, a population, and a set of destinations, the goal of Conflict-Free Evacuation Route Planning (CF-ERP) is to produce routes that minimize the evacuation time for the population with no spatiotemporal movement-conflicts. The CF-ERP problem is an essential component of civic emergency preparedness in the wake of man-made or natural disasters (e.g., terrorist acts, hurricanes, or nuclear accidents). This problem is challenging because of the large size of network data, the large number of evacuees, and the need to account for capacity constraints and the conflict-free constraint. Previous work has focused on minimizing the evacuation time on spatiotemporal networks. However, these approaches cannot minimize potential movement-conflicts that cause traffic accidents, congestion, and delays. We propose novel approaches for CF-ERP to meet the conflict-free constraint while minimizing the evacuation time for the population. Experiments using real-world datasets demonstrate that the proposed algorithms produce evacuation routes with no movement-conflicts and have comparable solution quality to related work.

给定一个交通网络，一个人口和一组目的地，无冲突疏散路线计划（CF-ERP）的目标是生产出使人员的疏散时间最短且没有时空运动冲突的路线。CF-ERP问题是人为或自然灾害（例如恐怖行为，飓风或核事故）引起的公民应急准备的重要组成部分。由于网络数据量大，撤离者众多，并且需要考虑容量约束和无冲突约束，因此此问题具有挑战性。先前的工作集中在最大程度地减少时空网络上的疏散时间。但是，这些方法无法最大程度地减少导致交通事故，交通拥堵和延误的潜在运动冲突。我们提出了CF-ERP的新方法，以满足无冲突的约束，同时最大限度地减少了疏散人群的时间。使用现实世界的数据集进行的实验表明，所提出的算法产生的避难路线没有运动冲突，并且解决方案的质量可与相关工作相媲美。