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:2606. 04167v1 Announce Type: cross Abstract: We tackle the Metro Network Expansion Problem (MNEP), a subset of the Transport Network Design Problem (TNDP), which focuses on expanding metro systems to satisfy travel demand.
By Dimitris Michailidis, Sennay Ghebreab, Fernando P. Santos
The paper presents an end‑to‑end framework that uses constraint‑oriented hypergraphs and reinforcement learning to solve vehicle routing problems. It introduces a dynamic hyperedge reconstruction strategy for better hypergraph representation and a double‑pointer attention decoder for iterative solution generation. Experiments on benchmark datasets show that the method removes the need for complex heuristic operators while improving solution quality.
By Zhenwei Wang, Tiehua Zhang, Jing Liu, Heng Yu, Kaizhu Huang, Ruibin Bai
arXiv:2607. 19270v1 Announce Type: cross Abstract: The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning.
By Alessandro Scalese, Santhanakrishnan Narayanan, Constantinos Antoniou
The Traffic Assignment Problem is a fundamental but computationally expensive component of transportation planning. While Graph Neural Networks have emerged as fast, data-driven surrogates, their practical deployment is severely constrained by a spatial generalization gap.
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