Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

TL;DR

The paper presents elsarticle.cls, a LaTeX document class designed to streamline submissions to Elsevier LT&A journals by preserving kernel compatibility while integrating widely-used packages. It contrasts elsarticle.cls with the older elsart.cls, emphasizing reduced package clashes and expanded formatting options (preprint, final, two-column, etc.) to better support diverse author needs. The document outlines dependencies (e.g., natbib, geometry, hyperref) and provides installation guidance via Elsevier resources and CTAN, including source-based generation of the class and TeX database updates. This work facilitates consistent, publication-ready formatting and improves interoperability for authors preparing manuscripts for Elsevier journals.

Abstract

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization.