LegalFarePlan：非加法票价规则下票价透明的城市轨道交通线路规划标签设定框架
LegalFarePlan: A Label-Setting Framework for Fare-Transparent Urban Rail Route Planning under Non-Additive Fare Rules
浏览论文内容
中文总结 AI 辅助
研究非加法票价规则下城市轨道交通线路规划问题，提出LegalFarePlan框架，将合法进出站建模为约束条件，通过多种算法实现可解释线路规划，在半合成基准测试中取得一定票价降低成果，展示方法行为与可重复性。
中文摘要 AI 辅助
城市轨道交通票价系统可能是非加法的：从起点到终点的单次付费行程票价可能不同于多个合法分离行程段的票价总和。本文提出了LegalFarePlan，这是一个票价透明的线路规划框架，将合法的出站和重新进站操作建模为明确的、可审计的约束条件。给定一个公交网络、票价函数、换乘规则、车站级出站/重新进站成本、额外时间预算和分割限制，规划者可以计算付费行程段上可解释的线路规划。该工件实现了Dijkstra最短时间和直接线路规划基线、贪婪分割启发式、有界精确标签设定和帕累托前沿搜索。评估使用受控合成数据和一个有57个车站、360个OD对的半合成基准。在半合成基准上，有界精确搜索为71.11%的OD对识别出正的建模票价降低，在45分钟的额外时间预算下，平均降低3.78，最大降低9.0合成票价单位。这些结果展示了方法行为和可重复性；它们不是关于港铁或任何公交运营商的实证结论。
英文摘要
Urban rail fare systems may be non-additive: the fare of a single paid journey from an origin to a destination can differ from the sum of fares over multiple legally separated journey legs. This paper presents LegalFarePlan, a fare-transparent route-planning framework that models legal exit-and-reentry operations as explicit, auditable constraints. Given a transit network, fare function, transfer rules, station-level exit/re-entry costs, an extra-time budget, and a split limit, the planner computes explainable route plans over paid journey segments. The artifact implements Dijkstra shortest-time and direct route-planner baselines, a greedy split heuristic, bounded exact label-setting, and Pareto-frontier search. Evaluation uses controlled synthetic data and a 57-station semi-synthetic benchmark with 360 OD pairs. On the semi-synthetic benchmark, bounded exact search identifies positive modeled fare reductions for 71.11% of OD pairs, with mean reduction 3.78 and maximum reduction 9.0 synthetic fare units under a 45-minute extra-time budget. These results demonstrate method behavior and reproducibility; they are not empirical conclusions about MTR or any transit operator.
