The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
Bike-sharing systems are an important component of low-carbon urban mobility, but continued expansion creates challenges in both cold-start prediction and equitable resource allocation. Newly deployed...
The paper introduces FairGIN, a fairness-aware graph neural network designed to predict demand for expanding bike‑sharing systems while addressing cold‑start challenges and equity concerns. It combines expansion‑simulated incremental training, attention‑based knowledge transfer, and income‑stratified regularization to improve predictive accuracy and reduce income‑based disparities. Experiments on NYC and Seattle show that FairGIN outperforms existing methods and supports more inclusive station placement without sacrificing overall efficiency.
Traffic prediction is a core task in intelligent transportation systems, supporting applications such as adaptive signal control, route guidance, and ride-hailing dispatch. Deep learning models, including graph convolutional networks, recurrent networks, and Transformers, achieve strong results on standard benchmarks, but their architectures are designed by hand, requiring significant expert effort and producing models that often generalize poorly across cities and datasets.
arXiv:2607. 26467v1 Announce Type: new Abstract: Traffic prediction is a core task in intelligent transportation systems, supporting applications such as adaptive signal control, route guidance, and ride-hailing dispatch.
arXiv:2607. 23467v1 Announce Type: new Abstract: We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service.
arXiv:2607. 24885v1 Announce Type: cross Abstract: Predicting traffic flow is crucial to optimizing transportation systems and improving urban mobility.
arXiv:2509. 07123v2 Announce Type: replace-cross Abstract: Generalized extreme value models capture dependence among choice alternatives in discrete choice modeling, but require this dependence to be predefined, symmetric, and shared uniformly across individuals.
arXiv:2607. 20554v1 Announce Type: new Abstract: Reliable and low-latency NR-V2X communications are essential for smart mobility in dense urban environments.
JointMatch is a learning-based framework that simultaneously handles request pairing and vehicle assignment for ride‑sharing using a single, sparsified heterogeneous graph neural network. By scoring all candidate decisions in one forward pass, it scales linearly with the number of vehicles and requests, outperforming classical heuristics and two‑stage GNN baselines on New York City Yellow Taxi data. The model achieves significant speedups—over 20× faster per dispatch epoch at city scale—and further improves revenue through supervised training and policy‑gradient fine‑tuning.
arXiv:2608. 14177v1 Announce Type: cross Abstract: Deep spatiotemporal models integrating graph convolutions and attention mechanisms have demonstrated excellent performance in network-level traffic flow prediction, owing to their exceptional ability to capture complex spatiotemporal dependencies.
As electric vehicle (EV) adoption increases, ensuring efficient and well-distributed charging infrastructure has become a critical challenge. While many EV charging station location problem (CSLP) stu...