动态路径网络上离散加权集合流的 Minsum 问题
Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
AI总结:
针对紧急疏散中群体需共同移动且重要性不同的问题,本文将动态路径网络上的 minsum 流扩展为离散加权集合流,并给出均匀容量下的2-近似伪多项式时间算法。
摘要:
在本研究中,我们考察动态路径网络中的 minsum 流问题,其中流被表示为离散且加权的集合。minsum 流问题因其与在地震等紧急情况下寻找疏散路线的相关性而得到广泛研究。然而,以往方法通常假设个体是可分离且相同的,这无法充分说明如下事实:某些人群(例如家庭)需要一起移动,而且某些群体可能比其他群体更重要。为解决这些局限,我们修改了 minsum 流问题,以支持表示为离散且加权集合的流。我们还提出了一种 2-近似伪多项式时间算法,用于在容量一致的路径网络上求解该修改后的问题。
英文摘要:
In this research, we examine the minsum flow problem in dynamic path networks where flows are represented as discrete and weighted sets. The minsum flow problem has been widely studied for its relevance in finding evacuation routes during emergencies such as earthquakes. However, previous approaches often assume that individuals are separable and identical, which does not adequately account for the fact that some groups of people, such as families, need to move together and that some groups may be more important than others. To address these limitations, we modify the minsum flow problem to support flows represented as discrete and weighted sets. We also propose a 2-approximation pseudo-polynomial time algorithm to solve this modified problem for path networks with uniform capacity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。