HALO: Heterogeneous Allocation Via Localized Observations for the Vehicle Routing Problem

arXiv:2609.38760 · cs.RO, cs.MA · Submitted 2026-09-30 · Read on arXiv

cs.RO, cs.MA

Submitted: 2026-09-30

Updated: 2026-09-30

Terminology

• Heterogeneous Graph — 12× in this paper · explained in 2 episodes
• Reinforcement Learning — 9× in this paper · explained in 4 episodes
• Vehicle Routing Problem — 7× in this paper
• Embeddings — 6× in this paper · explained in 2 episodes
• Multiple Traveling Salesman Problem — 4× in this paper
• Attention Mechanism — 3× in this paper · explained in 3 episodes
• Benchmark — 3× in this paper · explained in 2 episodes
• Generalization — 2× in this paper · explained in 13 episodes
• Graph Construction — 2× in this paper · explained in 3 episodes
• Latent Space — 2× in this paper · explained in 7 episodes
• AI Foundation Model — 1× in this paper · explained in 1 episode
• Adam — 1× in this paper · explained in 2 episodes
• Aggregation — 1× in this paper · explained in 1 episode
• Catastrophic Forgetting — 1× in this paper · explained in 5 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Core — 1× in this paper · explained in 2 episodes
• Defense Advanced Research Projects Agency — 1× in this paper
• Fidelity — 1× in this paper · explained in 2 episodes
• Foundation Model — 1× in this paper · explained in 3 episodes
• Graph Isomorphism Network — 1× in this paper
• Graph Neural Network (GNN) — 1× in this paper · explained in 3 episodes
• Hybrid Architectures — 1× in this paper · explained in 3 episodes
• Pruning — 1× in this paper · explained in 4 episodes

Sources

• DAN: Decentralized Attention-based Neural Network for the MinMax Multiple Traveling Salesman Problem
• iMTSP: Solving Min-Max Multiple Traveling Salesman Problem with Imperative Learning
• Graph Attention Networks
• Solving the Min-Max Multiple Traveling Salesmen Problem via Learning-Based Path Generation and Optimal Splitting
• Construct, Merge, Solve & Adapt with Reinforcement Learning for the min-max Multiple Traveling Salesman Problem
• PyG 2.0: Scalable Learning on Real World Graphs

Related papers

• FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
• MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
• RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
• HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
• APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies
• Fine-tuning is Not Enough: A Parallel Framework for Collaborative Imitation and Reinforcement Learning in End-to-end Autonomous Driving