The Flow has not summarised this story yet — read it at arXiv Machine Learning.
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.
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.
arXiv:2610.35032v1 Announce Type: cross Abstract: Self-supervised learning has emerged as a powerful paradigm for Path Representation Learning (PRL) in road networks. PRL aims to learn informative re...
arXiv:2608.24859v1 Announce Type: new Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...
arXiv:2609.21945v1 Announce Type: new Abstract: Urban transportation networks present complex optimization challenges spanning calibration of high-fidelity simulators and real-time operational contro...
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.