AGENTIC-SYSTEMSJuly 14, 20261 min read1 views

LegalFarePlan: A Label-Setting Framework for Fare-Transparent Urban Rail Route Planning under Non-Additive Fare Rules

Researchers have proposed LegalFarePlan, a route-planning framework that optimizes urban rail fares by leveraging non-additive fare rules through legal exit-and-reentry operations.

Computer Science > Artificial Intelligence

Title:LegalFarePlan: A Label-Setting Framework for Fare-Transparent Urban Rail Route Planning under Non-Additive Fare Rules

View PDF HTML (experimental)Abstract: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.

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Source: arXiv cs.AI Recent

More in this category

agentic-systems

BatteryLake: Agentic, Physics-Grounded Curation of Heterogeneous Battery Aging Data and Benchmarking

Researchers have introduced BatteryLake, a governed data lakehouse that automates the curation of heterogeneous battery aging data using LLM agents and physics-grounded rules. This framework aims to accelerate research in battery health management (SOH and RUL) by providing a standardized benchmark of 41 datasets.

agentic-systems

Task-Conditioned Synthetic Data Generation for Improving Machine Learning Performance in Agricultural Prediction Tasks

Researchers have proposed Task-Conditioned Synthetic Data Generation (TCSDG), a novel algorithm that addresses data scarcity in agricultural machine learning. By combining Bayesian Networks with transformer-based models, TCSDG significantly improves the accuracy of crop yield prediction and crop type classification.

NOW LET US Related – A Dynamic Scene Interaction Reasoning Framework for Scene-level Lane-Change Intention and Trajectory Prediction of Multiple Interacting Vehicles

agentic-systems

A Dynamic Scene Interaction Reasoning Framework for Scene-level Lane-Change Intention and Trajectory Prediction of Multiple Interacting Vehicles

Researchers have proposed DSiGAT, a novel dynamic scene graph attention framework that predicts both the lane-change intentions and future trajectories of multiple interacting vehicles simultaneously, significantly improving autonomous driving safety.

agentic-systems

Scaffolding the Strategist: Architecture-Dependent Reasoning Interventions in Hotelling Spatial Markets

A new study reveals a significant crossover interaction between reasoning scaffolding and LLM architecture, showing that interventions helping standard models can degrade reasoning-optimized models.

agentic-systems

Coresets Before Score Sets: Evaluation-Unsupervised Prompt Subset Selection for LLM Benchmarks

Researchers propose an evaluation-unsupervised prompt subset selection method to compress massive LLM benchmarks while preserving evaluation accuracy, significantly reducing computation costs.

agentic-systems

AGM-like Paraconsistent Partial Meet Abductive Expansion Operation

A new paper introduces a paraconsistent AGM-like abductive expansion operation capable of assimilating contradictory explanatory hypotheses without trivialization, marking a significant milestone in belief revision literature.