arXiv AI

Customizable and Jointly Optimized Route Planning: A Deep Architecture Enabling Differentiable Shortest-Path Search

The paper introduces a deep architecture that jointly optimizes cost functions and a route-ranking model to accommodate diverse user preferences in route planning. It first generates a complete set of Pareto‑optimal routes using a multi‑objective Dijkstra algorithm, then employs a neural network that emulates shortest‑path search and ranking in an end‑to‑end differentiable framework. A novel loss function treats route preference as a constrained optimization problem, allowing a single objective to be optimized while other attributes remain constrained, and experiments on real‑world data show significant improvements over existing methods.

Hugging Face Trending Papers
Jul 29

Neural Architecture Search for Traffic Prediction: A Survey of Methods, Challenges, and Future Directions

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 Machine Learning
Jul 1

Capturing Context-Aware Route Choice Semantics for Trajectory Representation Learning

arXiv:2510. 14819v3 Announce Type: replace-cross Abstract: Trajectory representation learning (TRL) aims to encode raw trajectory data into low-dimensional embeddings for downstream tasks such as travel time estimation, mobility prediction, and trajectory similarity analysis.

By Ji Cao, Yu Wang, Tongya Zheng, Jie Song, Qinghong Guo, Zujie Ren, Canghong Jin, Gang Chen, Mingli Song
arXiv Machine Learning
Aug 5

Beyond Solving: Prescriptive Probing for Neural Routing Solvers

arXiv:2602. 07216v2 Announce Type: replace Abstract: Neural combinatorial optimization (NCO) trains fast heuristics for routing problems, but planners often need more than a single solve: they ask which stop to drop, which transition to preserve, or which subset of stops to remove if a route is infeasible.

By Reuben Narad, L\'eonard Boussioux, Michael Wagner
arXiv AI
5d ago

JointMatch: A Unified Heterogeneous Graph Neural Solver for Large-Scale Ride-Sharing Matching

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
arXiv AI
Jul 21

A Deep Reinforcement Learning Algorithm for the Vehicle Routing Problem with Stochastic Demands and Outsourcing

arXiv:2607. 16875v1 Announce Type: cross Abstract: We introduce the vehicle routing problem with stochastic demands and outsourcing options (VRP-SDO), in which a logistics service provider partitions customer requests into customers outsourced to a common carrier and customers committed to its fixed fleet.

By Mohsen Dastpak, Fausto Errico, Ola Jabali