GeoPAR is a geometry-guided parallel autoregressive reinforcement learning framework designed for large-scale multi-agent combinatorial optimization. It introduces a projection-window sparse geometry mechanism, sparse edge-biased attention, and cache-guided conflict-aware assignment to better model local geometric structures and reduce duplicate task selections. Experiments on heterogeneous vehicle routing and multi-depot pickup-and-delivery problems demonstrate improved zero-shot generalization, fewer rollout steps, and efficient inference.
By Wenjian Wu, Zesheng Jia, Jiaying Tang, Benyuan Yang, Jin Wang
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
By Han Fang, Paul Weng, Yutong Ban
arXiv:2509. 23413v3 Announce Type: replace Abstract: Multi-task neural routing solvers have emerged as a promising paradigm for their ability to solve multiple vehicle routing problems (VRPs) using a single model.
By Changliang Zhou, Canhong Yu, Shunyu Yao, Xi Lin, Zhenkun Wang, Yu Zhou, Qingfu Zhang
arXiv:2608.24859v1 Announce Type: new
Abstract: Multi-task vehicle routing problem (VRP) solvers seek to handle multiple VRP variants within a single unified model, avoiding the need to train a separ...
By Arthur Corr\^ea, Paulo Nascimento, Samuel Moniz
arXiv:2606. 06219v1 Announce Type: cross Abstract: End-to-end autonomous driving models often struggle to balance multi-modal maneuver generation with real-time inference constraints.
By Yining Xing, Zehong Ke, Zhiyuan Liu, Yanbo Jiang, Wenhao Yu, Jianqiang Wang
arXiv:2608. 00270v2 Announce Type: replace Abstract: Neural Combinatorial Optimization (NCO) techniques have emerged as a highly efficient alternative to traditional exact algorithms for solving routing problems such as the Traveling Salesman Problem (TSP).
By David Aguado, Daniel Fuertes, Carlos R. del-Blanco, Fernando Jaureguizar