arXiv:2606. 23978v1 Announce Type: cross Abstract: We present an offline reinforcement learning (RL) framework for optimizing SLAM throughput control in a warehouse fulfillment environment.
By Tina Dongxu Li, Mouhacine Benosman, Rajat Kumar, Kevin Tan, Ken Meszaros, Trevor Dardik
arXiv:2607. 22356v1 Announce Type: new Abstract: In recent years, the growing complexity of last-mile pickup operations has increased the need for fast and accurate decision-making on logistics platforms.
By Yida Xu, Zhaofang Mao, Yuheng Miao, Jiaxin Zhang, Yiting Sun
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
The paper introduces MEMENTO, a memory‑enhanced neural solver that improves routing problem solutions by using online data from repeated attempts to adjust action distributions during inference. It targets NP‑hard routing tasks such as the Traveling Salesman and Capacitated Vehicle Routing problems, outperforming existing tree‑search and policy‑gradient fine‑tuning methods. MEMENTO demonstrates strong scalability and data efficiency, achieving state‑of‑the‑art results on 11 of 12 evaluated tasks and enabling zero‑shot integration with diversity‑based solvers.
By Felix Chalumeau, Refiloe Shabe, Noah De Nicola, Arnu Pretorius, Thomas D. Barrett, Nathan Grinsztajn
arXiv:2607. 23467v1 Announce Type: new Abstract: We study an integrated pickup-and-delivery problem on sparse, non-Euclidean networks that jointly optimizes cyclic routing, cargo flow allocation, and cross-cycle service.
By Haomiao Sun, Fang He, Congyuan Ji, Xindi Tang
The paper introduces Reinforcement Learning Enhanced LLM Agents (RLEA), a multi‑agent framework that automates the modeling of complex Vehicle Routing Problems (VRPs). RLEA employs a lightweight neural Planner trained with Soft Q‑learning to coordinate LLM‑based agents, and incorporates an evolutionary memory module and retrieval‑augmented generation to leverage experience and external solver knowledge. Experiments on 48 VRP variants show that RLEA outperforms the prior state‑of‑the‑art method, achieving a 16.67% higher success rate and significantly reducing runtime errors.
By Yi Chen, Zikang Yu, Jiahai Wang, Jinbiao Chen, Jianpeng Zhou, Zizhen Zhang
arXiv:2604. 26256v2 Announce Type: replace Abstract: Reinforcement learning (RL) has become a critical paradigm for LLM post-training, yet the rollout phase -- accounting for 50--80% of total step time -- is bottlenecked by skewed generation: long-tailed trajectories indispensable for model performance block the entire training pipeline.
By Tianhao Hu, Xiangcheng Liu, Yuchun Miao, Youshao Xiao, Hongyu Zang, Yang Zheng, Xuan Huang, Jinrui Ding, Yufei Zhang, Yu Yang, Yi-Kai Zhang, Yueqing Sun, Chengcheng Han, Xiandi Ma, Wei Wang, Qi Gu, Yerui Sun, Yuchen Xie, Xunliang Cai
arXiv:2608.24485v1 Announce Type: cross
Abstract: Automated parking commonly assumes marked slots and short approach maneuvers. Delivery and service vehicles, however, may need to reach an operator-s...
By Zihan Wang, Bai Huang, Yang Guan, Xiao Li, Haoyu Xu, Naizheng Wang, Shengbo Eben Li
arXiv:2503. 03137v3 Announce Type: replace Abstract: Constructive neural combinatorial optimization (NCO) offers a promising paradigm for solving vehicle routing problems (VRPs) by directly learning to construct approximate optimal solutions, thereby reducing reliance on expert knowledge for algorithm design.
By Changliang Zhou, Xi Lin, Zhenkun Wang, Qingfu Zhang
arXiv:2608. 05588v1 Announce Type: cross Abstract: Lifelong Multi-Agent Path Finding (LMAPF) requires repeatedly planning collision-free paths for agents that continuously receive new goals upon reaching their current ones.
By He Jiang, Jingtian Yan, Yulun Zhang, Yimin Tang, Tanishq Duhan, Rishi Veerapaneni, Guillaume Sartoretti, Jiaoyang Li
arXiv:2607. 05272v1 Announce Type: cross Abstract: Inference serving systems must balance throughput and latency under bursty, heterogeneous workloads, yet the industry standard remains static batching policies that require manual tuning and cannot adapt to shifting traffic.
By Ruslan Sharifullin
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.
By Faezeh Ardali, Gerald M. Knapp