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.
By Manish Kolachalam, Rani Malhotra
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:2606. 02016v1 Announce Type: new Abstract: Algorithm Selection (AS) aims to automatically identify the most suitable optimization algorithm for a given problem instance by leveraging measurable problem characteristics and historical performance data.
By Gjorgjina Cenikj, Jakub Kudela, Eva Tuba, Tome Eftimov
arXiv:2607. 00444v1 Announce Type: cross Abstract: Spatiotemporal motion planning, especially in multi-robot settings, requires robots to reason about collision-free regions that change over time, which is challenging in continuous spaces when feasible regions are transient and geometrically constrained.
By Jingtao Tang, Zining Mao, Lufan Yang, Hang Ma
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.
By Andrew Soroka, German Mikhelson, Alexander Mescheryakov, Sergey Gerasimov
arXiv:2412. 13858v2 Announce Type: replace Abstract: We investigate diffusion models to solve the Traveling Salesman Problem.
By Mickael Basson, Philippe Preux