在衰减树中的平滑路由
Smooth Routing in Decaying Trees
AI总结:
研究在极端事件中如何平滑调度路径以应对连接失效,证明在树结构中该问题NP难,并通过整数线性规划解决撤离时间问题。
摘要:
受洪水或森林火灾等极端事件中撤离场景的启发,我们研究了在连接在特定时间失效的图中平滑调度路径集的问题。平滑调度要求路径不共享边,且顶点同时容纳的路径数不超过给定容量。我们研究了当图是树(特别是星型或路径)时的问题计算复杂性,证明即使在进一步限制容量或失效时间的情况下,问题仍为NP难。我们提供了一个整数线性规划(ILP)来计算撤离的最新可能时间。使用ILP及其松弛形式,我们解决了人工生成(每个图是路径或星型)和半人工实例(图来自德国城市沿河流),研究了运行时间,并比较了ILP与松弛形式的结果。
英文摘要:
Motivated by evacuation scenarios arising in extreme events such as flooding or forest fires, we study the problem of smoothly scheduling a set of paths in graphs where connections become impassable at some point in time. A schedule is smooth if no two paths meet on an edge and the number of paths simultaneously located at a vertex does not exceed its given capacity. We study the computational complexity of the problem when the underlying graph is a tree, in particular a star or a path. We prove that already in these settings, the problem is NP-hard even with further restrictions on the capacities or on the time when all connections ceased. We provide an integer linear program (ILP) to compute the latest possible time to evacuate. Using the ILP and its relaxation, we solve sets of artificial (where each underlying graph forms either a path or star) and semi-artificial instances (where the graphs are obtained from German cities along rivers), study the runtimes, and compare the results of the ILP with those of its relaxation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。