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: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.
By Siliang Lu, Dan Hu, Lili Wu
The paper introduces an integrated optimization framework that links automated warehouse operations with last‑mile multi‑modal transport for differentiated on‑demand delivery. It employs a deep reinforcement learning approach—MORM‑AGDQN for warehouse scheduling and MRMH‑HCVRP for external routing—to balance service level, cost, and demand. The results demonstrate significant performance gains, including a 100 % on‑time delivery rate, a 29.3 % reduction in average last‑mile delivery time, a 46.4 % cut in total transportation distance, and a high‑priority service rate exceeding 92 % while maintaining cost‑customer satisfaction balance.
By Xiaozhu Sun, Bilal Farooq
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:2602. 07216v2 Announce Type: replace Abstract: Neural combinatorial optimization (NCO) trains fast heuristics for routing problems, but planners often need more than a single solve: they ask which stop to drop, which transition to preserve, or which subset of stops to remove if a route is infeasible.
By Reuben Narad, L\'eonard Boussioux, Michael Wagner
arXiv:2609.08232v1 Announce Type: cross
Abstract: Detailed routing remains a dominant runtime bottleneck in physical design due to increasing complexity of design rules. Modern routers can struggle t...
By Afsara Khan, Austin Rovinski