Scale-Net: A Hierarchical U-Net Framework for Cross-Scale Generalization in Multi-Task Vehicle Routing

Authors

  • Suyu Liu College of Computing and Data Science, Nanyang Technological University
  • Zhiguang Cao School of Computing and Information Systems, Singapore Management University
  • Nan Yin Department of Computer Science and Engineering, Hong Kong University of Science and Technology
  • Yew-Soon Ong College of Computing and Data Science, Nanyang Technological University Centre for Frontier AI Research, Institute of High Performance Computing, Agency for Science, Technology and Research

DOI:

https://doi.org/10.1609/aaai.v40i17.38444

Abstract

Neural solvers for Vehicle Routing Problems (VRPs) have shown great advantages in solving various kinds of problem types. However, they also face critical challenges in generalizing from small-scale training to large-scale problems and in identifying the most salient topological information for decision-making. To mitigate these gaps, we introduce ScaleNet, a novel hierarchical framework that integrates a U-Net architecture into a unified, multi-task VRP solver. Scale-Net explicitly captures multi-scale structural patterns by processing a nested hierarchy of input graph instances. This enriched, coarse-to-fine representation is extracted by the encoder and fed directly into the decoder, empowering decoder module with superior topological awareness for routing decisions while simultaneously reducing computational overhead in the encoder. We conducted extensive experiments on 16 VRP variants with instances ranging from 50 to 5,000 nodes. The experimental results show that Scale-Net demonstrates significant performance gains over state-of-the-art baselines across in-distribution, zero-shot, and real-world settings.

Downloads

Published

2026-03-14

How to Cite

Liu, S., Cao, Z., Yin, N., & Ong, Y.-S. (2026). Scale-Net: A Hierarchical U-Net Framework for Cross-Scale Generalization in Multi-Task Vehicle Routing. Proceedings of the AAAI Conference on Artificial Intelligence, 40(17), 14295–14303. https://doi.org/10.1609/aaai.v40i17.38444

Issue

Section

AAAI Technical Track on Constraint Satisfaction and Optimization