arXiv:2606. 01046v1 Announce Type: new Abstract: The development of Large Language Models (LLMs) has significantly improved travel planning applications, yet evaluating such models is limited by existing benchmarks' limitations: 1) overemphasis on constraint compliance, neglecting multi-dimensional qualities like spatio-temporal cost; 2) datasets lacking real-world authenticity and coverage in key areas (e.
By Weiyi Chen, Shuaixiong Wang, Ziyun Gao, Kaichun Hu, Wangze Ni, Shimin Di, Chen Jason Zhang, Lei Chen
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).
By Florian Rascoussier
arXiv:2606. 14582v1 Announce Type: new Abstract: Efficient route optimization play a vital role in ensuring both safety and punctuality in railway operations.
By Pollob Chandra Ray, Sabah Binte Noor, Fazlul Hasan Siddiqui
arXiv:2601. 04884v3 Announce Type: replace Abstract: Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents.
By Issa Hanou, Eric Kemmeren, Devin Wild Thomas, Mathijs de Weerdt
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.
By Dani\"el Vos, Sterre Lutz
arXiv:2510.09373v2 Announce Type: replace
Abstract: Constraint Programming (CP) offers an intuitive, declarative framework for modeling Vehicle Routing Problems (VRP). While classical successor-based...
By Augustin Delecluse, Pierre Schaus, Pascal Van Hentenryck
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.
By Rui Zhao, Chao Chen, Longfei Xu, Chenguang Ji, Hengbin Cui, Kaikui Liu, Xiaolong Li
arXiv:2606. 02287v1 Announce Type: cross Abstract: Urban trajectory generation is a fundamental task for transportation simulation, urban planning, and mobility analytics.
By Shibo Zhu, Xiaodan Shi, Dayin Chen, Yuntian Chen, Haoran Zhang, Tianhao Wu, Jinyue Yan
arXiv:2608.30512v1 Announce Type: cross
Abstract: Large-scale industrial robot fleets share constrained physical infrastructure, making vehicle travel times dependent on safety separation, intersecti...
By Cheng Gu, Qiusheng Zhao, Anbang Liu, Shaochong Lin, Max Z. J. Shen
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?
By Jungmin Seo, Jaesik Park
arXiv:2609.22951v1 Announce Type: cross
Abstract: Enterprise agentic systems that route every trajectory step to a frontier model waste 60-80% of their inference budget on subtasks that smaller model...
By Rudrendu Kumar Paul, Sourav Nandy
arXiv:2606. 14157v1 Announce Type: cross Abstract: Cities deliver basic services through mixed public-private facility networks, including schools, clinics, transit providers, and subsidized service points.
By Paula Joy B. Martinez