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 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.
By Alessandro Scalese, Santhanakrishnan Narayanan, Constantinos Antoniou
arXiv:2608. 19381v1 Announce Type: cross Abstract: Network embedding methods learn low-dimensional representations of graph-structured data to support downstream tasks such as node classification, link prediction, and influence maximization.
By Ella Has, Harshith Kumar Yadav, Gaurav Dixit, Mykola Pechenizkiy, Akrati Saxena
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.
By Kun Zhao, Xu Chen
The paper introduces GREAT, a Graph Edge Attention Network that operates directly on edge space to handle asymmetric energy costs in the Electric Vehicle Routing Problem (EVRP). Integrated into a reinforcement learning framework, GREAT jointly optimizes routing and charging decisions, outperforming a strong HGS-based heuristic by up to 8.78% in energy savings and reducing runtime by a factor of 60. It also shows competitive performance against a custom adaptive large neighborhood search and achieves state‑of‑the‑art results on other asymmetric routing benchmarks such as TSP, CVRP, and Orienteering.
By Attila Lischka, Filip Rydin, Jiaming Wu, Morteza Haghir Chehreghani, Bal\'azs Kulcs\'ar