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).
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.
arXiv:2607. 00064v1 Announce Type: new Abstract: As technology advances, many path-planning algorithms have been proposed for Air Traffic Management, yet their operational adoption in tactical control remains limited, revealing a misalignment between algorithmic design priorities and air traffic controllers' needs.
arXiv:2607. 16891v1 Announce Type: cross Abstract: A truckload carrier must accept or reject each load tender within seconds.
arXiv:2607. 00064v2 Announce Type: replace Abstract: As technology advances, various algorithms have been proposed for air traffic management, yet their operational adoption in tactical control remains limited.
arXiv:2608.29397v1 Announce Type: new Abstract: Tool-use benchmarks generally evaluate whether an agent completes a workflow using appropriate tools and valid arguments. However, feasibility alone is...
arXiv:2410.08875v3 Announce Type: replace Abstract: Designing a network (e.g., a telecommunication or transport network) is mainly done offline, in a planning phase, prior to the operation of the net...
The paper presents DORA, an online learning algorithm for robot navigation that uses Dijkstra’s algorithm as an exact planning engine under a weaker condition than usual causality—specifically, nonnegativity of a reduced cost on a determinized map. DORA calls a shortest‑path oracle a fixed number of times per episode, avoids estimating transition kernels, and incorporates a logarithmic survival weight to keep contact probabilities with dynamic obstacles within a budget. Experiments on grid‑world, directional drilling, and drone surveillance benchmarks show that DORA matches optimistic value iteration with the true transition kernel while performing 4.5 to 19.3 times less planner work, reduces contacts by a factor of seventeen compared to determinize‑and‑replan, and maintains contact rates within wide budget ranges.
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.
The paper "Counterfactual Routing Using Integer Programming with Constraint Generation" presents a solution to the IJCAI 2025 Counterfactual Routing Competition. The authors model the problem as an integer program and iteratively add constraints until an exact solution is found. In evaluation on held‑out test instances, their method ranked fourth in solution quality and was the fastest, averaging 9.0 seconds versus 118.8 seconds for the next‑fastest submission.
arXiv:2606. 01987v1 Announce Type: cross Abstract: We show that the Vehicle Routing Problem (VRP) can be reformulated as a Graph Edit Distance (GED) maximization problem.
arXiv:2607. 09755v1 Announce Type: new Abstract: Urban rail fare systems may be non-additive: the fare of a single paid journey from an origin to a destination can differ from the sum of fares over multiple legally separated journey legs.
The deployment of Vision-Language Models (VLMs) in autonomous driving (AD) systems is constrained by on-board computing power, restricting vehicles to small VLMs (SVLMs) with limited perception and reasoning capabilities. Infrastructure-assisted AD alleviates this resource constraint by enabling collaboration with large VLMs (LVLMs) at edge servers.