arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.00814cs.DS
收藏

路径网络上聚集疏散时间的最小最大后悔1-汇

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks

Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh

摘要:

紧急情况下的疏散可以用动态流网络来模拟。之前使用过两个标准:一个是疏散完成时间,另一个是单个疏散人员的累计疏散时间。本文的目的是在最简单的情况下,在网络是一个路径,只有一个疏散中心(称为汇)是要引入的总疏散时间优化。撤离者最初位于顶点,但他们的确切数量是未知的,并给出了上限和下限。在这个假设下,我们计算出最小化最大“后悔”的汇点位置。“我们提出了一个$O(n^2\log n)$时间算法来解决这个问题,改进了以前最快的$O(n^3)$时间算法,其中$n$是顶点的数量。

英文摘要:

Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregate evacuation time of individual evacuees. The aim of this paper is to optimize the aggregate evacuation time in the simplest case, where the network is a path and only one evacuation center (called a sink) is to be introduced. The evacuees are initially located at the vertices, but their precise numbers are unknown, and are given by upper and lower bounds. Under this assumption, we compute the sink location that minimizes the maximum "regret." We present an $O(n^2\log n)$ time algorithm to solve this problem, improving upon the previously fastest $O(n^3)$ time algorithm, where $n$ is the number of vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑