arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.20472math.OC
收藏

带有 O/D 割选择方法的“屏蔽线计数器位置问题”的英文版本

English version of "Screen-line counter location problem with O/D cut selection approach"

Satoshi Sugiura

AI总结:

本文针对屏蔽线计数器位置问题(SCLP)提出基于图割的高效求解方法,通过扩展最大权闭包问题解决链路数量优化,并在 Sioux-Falls 网络上验证了其快速获得最优解的能力。

摘要:

本文为屏蔽线计数器位置问题(SCLP)提供了一种高效的求解方法,该问题是一种带有约束的计数器位置问题,要求 OD 对之间的交通流量必须至少被观测一次。本文使用图割方法对 SCLP 进行建模,该方法包括割的枚举和割选择问题。这些问题可以简化为一个简洁的公式,该公式扩展了最大权闭包问题,适用于两个问题:寻找能观测所有 OD 对的最小链路数量,以及在链路数量受预算约束的情况下寻找被观测 OD 对的最大数量。对割特征的深入理解为寻找能观测所有 OD 对的最小链路数量的问题提供了优越的上界。所提出的方法在 Sioux-Falls 网络上进行了评估。结果表明,在非常短的计算时间内,能够推导出与先前研究中找到的最优解等效的解决方案。

英文摘要:

This paper provides an efficient solution approach to the screen-line counter location problem (SCLP), which is a counter location problem with the constraint that the traffic between OD pairs must be observed at least once. This paper formulates the SCLP using a graph cut approach, which consists of an enumeration of cuts and a cut selection problem. These problems can be reduced to a concise formulation that extends the maximum weight closure problem for two problems: finding the minimum number of links that observe all OD pairs and finding the maximum number of observed OD pairs with a budget-constrained number of links. Insights into the characteristics of cuts give superior upper bounds on the problem of finding the minimum number of links that observe all OD pairs. The proposed method is evaluated on the Sioux-Falls network. It shows that it is possible to derive a solution equivalent to the optimal solution found in previous studies in a very short computation time.

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

↑