arXiv:2607. 06066v1 Announce Type: new Abstract: The Vehicle Routing Problem (VRP) and its variants represent some of the most practically consequential optimization challenges in modern logistics and urban mobility.
arXiv:2608. 06668v1 Announce Type: new Abstract: As an important component of the supply chain industry, transportation has experienced rapid development in the past decade with the assistance of digital platforms and intelligent algorithms.
arXiv:2607. 23116v1 Announce Type: cross Abstract: KAYROS is an open-source solver for duration-minimization time-dependent vehicle routing problems, with or without time windows (TDVRPTW, TDVRP).
The paper introduces Anticipatory Generative Modeling, a new graph-constrained approach for generating road‑network trajectories that focuses on behavior modeling rather than simple location simulation. It presents Foresight, a probabilistic model that iteratively anticipates, selects, updates, and re‑anticipates future transitions to produce realistic routes that stay on the road network. Experiments show that Foresight outperforms existing state‑of‑the‑art generative methods.
arXiv:2606. 06618v1 Announce Type: cross Abstract: How can we plan long-horizon routes that reach designated goals, visit required waypoints, and remain short when only short-horizon offline trajectories are available?
arXiv:2608. 13799v1 Announce Type: new Abstract: This paper presents an event-driven learning and benchmarking framework for the Dynamic Multi-Depot Vehicle Routing Problem with progressively revealed requests and evolving vehicle states.
arXiv:2609.35443v2 Announce Type: replace Abstract: Large-scale routing problems are difficult to solve efficiently as their search spaces grow rapidly with problem size. Existing approaches primaril...
arXiv:2610.14792v1 Announce Type: new Abstract: Online, same-day delivery requires operators to constantly update their routes, and the routing cost for deliveries increases with the number of custom...
HLSR is a selective hybrid live‑forecast vehicle rerouting framework designed to reduce urban traffic congestion. It combines live edge speeds with short‑horizon forecasts, using dual‑threshold congestion detection, calibrated upstream selection, and driver‑tailored travel‑time prediction. The method introduces approaching‑vehicle expansion, travel‑time‑weighted k‑shortest‑path generation, and a horizon‑dependent hybrid live‑forecast segment speed for multi‑cost route allocation.
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.
Building an ALNS heuristic in Python for vehicle routing, time windows, capacity constraints, and mandatory driver breaks. The post Los Movimientos, Part II: Solving Large Pickup-and-Delivery Problems with Adaptive Large Neighborhood Search appeared first on Towards Data Science .
arXiv:2608. 14140v1 Announce Type: new Abstract: The problem of route optimization with realistic constraints is becoming extremely relevant in the face of global urban population growth.