Learning Urban Access Costs from Origin-Destination Flows via Inverse Optimal Transport

• URL: http://arxiv.org/abs/2606.14157v1
• Date: Fri, 12 Jun 2026 06:29:48 GMT
• Title: Learning Urban Access Costs from Origin-Destination Flows via Inverse Optimal Transport
• Abstract summary: We study school choice in the Philippines, where the country's largest national education subsidy is intended to redirect learners from congested public schools to participating private schools.<n>Treating school-to-school enrollment flows as an entropic optimal transport plan, we recover latent choice costs using two complementary inverse optimal transport models.<n>Case demonstrates how administrative origin-destination data can be transformed into interpretable planning metrics for accessibility-aware subsidy design, facility siting, and urban service allocation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cities deliver basic services through mixed public-private facility networks, including schools, clinics, transit providers, and subsidized service points. In these systems, planners often observe where households go, but not the latent cost function through which they trade off factors such as distance, price, and institutional access. We study this urban problem through school choice in the Philippines, where the country's largest national education subsidy is intended to redirect learners from congested public schools to participating private schools. Treating school-to-school enrollment flows as an entropic optimal transport plan, we recover latent choice costs using two complementary inverse optimal transport models: an interpretable distance-banded model with a subsidy term, and a neural cost model trained through a differentiable Sinkhorn forward pass. Applied to 283{,}016 learner trips across 23{,}820 observed flows in the most populated region, the framework estimates a subsidy-equivalent distance, $λ^{(k)}$, interpreted as the kilometers of perceived travel cost offset by the subsidy. The case demonstrates how administrative origin-destination data can be transformed into interpretable planning metrics for accessibility-aware subsidy design, facility siting, and urban service allocation.

Related papers

• Student Flow Modeling for School Decongestion via Stochastic Gravity Estimation and Constrained Spatial Allocation [0.0]
  School congestion is a major challenge in low- and middle-income countries.<n>Subsidies that transfer students from public to private schools offer a mechanism to alleviate congestion without capital-intensive construction.<n>This paper introduces a computational framework for modeling student flow patterns.
  arXiv  Detail & Related papers  (2026-02-20T03:57:45Z)
• Inequality in Congestion Games with Learning Agents [49.16654883862325]
  We show that disparities arise not only from the structure of the network but also from differences in how commuters adapt to it.<n>To capture potential efficiency-fairness tradeoffs, we introduce the Price of Learning (PoL), a measure of inefficiency during learning.<n>Our simulations show that network expansions can simultaneously increase efficiency and amplify inequality.
  arXiv  Detail & Related papers  (2026-01-28T13:16:25Z)
• Bilevel subsidy-enabled mobility hub network design with perturbed utility coalitional choice-based assignment [3.836506019632274]
  We develop a bilevel MH platform design model that treats MHs as control levers.<n>The upper level maximizes revenue or flow by setting subsidies to incentivize last-mile operators.<n>The lower level captures joint traveler-operator decisions with a link-based Perturbed Utility Route Choice assignment.
  arXiv  Detail & Related papers  (2025-08-18T16:34:15Z)
• Mahalanobis Distance-based Multi-view Optimal Transport for Multi-view Crowd Localization [50.69184586442379]
  We propose a novel Mahalanobis distance-based multi-view optimal transport loss specifically designed for multi-view crowd localization. Experiments demonstrate the advantage of the proposed method over density map-based or common Euclidean distance-based optimal transport loss.
  arXiv  Detail & Related papers  (2024-09-03T09:10:51Z)
• Enhancing Accessibility of Rural Populations through Vehicle-based Services [0.9217021281095907]
  Mobile clinics offer a cost-effective solution to enhance spatial accessibility for the rural population. Our integrated approach utilizes GIS data and an accessibility scaling factor to assess spatial accessibility for rural populations. This approach aids decision-makers, including fleet operators, policymakers, and public authorities in Sub-Saharan Africa, during project evaluation and planning for mobile facilities.
  arXiv  Detail & Related papers  (2024-02-02T09:28:17Z)
• Congestion Pricing for Efficiency and Equity: Theory and Applications to the San Francisco Bay Area [4.771971685916733]
  We propose a new class of congestion pricing schemes that minimize total travel time and incorporate an equity objective. We evaluate our pricing schemes in the calibrated freeway network of the San Francisco Bay Area.
  arXiv  Detail & Related papers  (2024-01-30T09:35:02Z)
• Fair collaborative vehicle routing: A deep multi-agent reinforcement learning approach [49.00137468773683]
  Collaborative vehicle routing occurs when carriers collaborate through sharing their transportation requests and performing transportation requests on behalf of each other. Traditional game theoretic solution concepts are expensive to calculate as the characteristic function scales exponentially with the number of agents. We propose to model this problem as a coalitional bargaining game solved using deep multi-agent reinforcement learning.
  arXiv  Detail & Related papers  (2023-10-26T15:42:29Z)
• A sequential transit network design algorithm with optimal learning under correlated beliefs [4.8951183832371]
  This study proposes an artificial intelligence-driven algorithm that combines sequential transit network design with optimal learning to address the operation under limited data. An operator gradually expands its route system to avoid risks from inconsistency between designed routes and actual travel demand. For validation, a new route system is designed on an artificial network based on public use microdata areas in New York City.
  arXiv  Detail & Related papers  (2023-05-16T14:14:51Z)
• TransPath: Learning Heuristics For Grid-Based Pathfinding via Transformers [64.88759709443819]
  We suggest learning the instance-dependent proxies that are supposed to notably increase the efficiency of the search. The first proxy we suggest to learn is the correction factor, i.e. the ratio between the instance independent cost-to-go estimate and the perfect one. The second proxy is the path probability, which indicates how likely the grid cell is lying on the shortest path.
  arXiv  Detail & Related papers  (2022-12-22T14:26:11Z)
• Neural Optimal Transport with General Cost Functionals [66.41953045707172]
  We introduce a novel neural network-based algorithm to compute optimal transport plans for general cost functionals. As an application, we construct a cost functional to map data distributions while preserving the class-wise structure.
  arXiv  Detail & Related papers  (2022-05-30T20:00:19Z)
• Online Multimodal Transportation Planning using Deep Reinforcement Learning [2.0088802641040604]
  We propose a Deep Reinforcement Learning approach to solve a multimodal transportation planning problem. While traditional planning methods work "offline" (i.e., they take decisions for a batch of containers before the transportation starts), the proposed approach is "online" Planning transportation online helps to effectively respond to unforeseen events that may affect the original transportation plan.
  arXiv  Detail & Related papers  (2021-05-18T09:01:44Z)
• End-to-end Interpretable Neural Motion Planner [78.69295676456085]
  We propose a neural motion planner (NMP) for learning to drive autonomously in complex urban scenarios. We design a holistic model that takes as input raw LIDAR data and a HD map and produces interpretable intermediate representations. We demonstrate the effectiveness of our approach in real-world driving data captured in several cities in North America.
  arXiv  Detail & Related papers  (2021-01-17T14:16:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.