Speeding up Local Optimization in Vehicle Routing with Tensor-based GPU Acceleration
Zhenyu Lei, Jin-Kao Hao, Qinghua Wu

TL;DR
This paper introduces a tensor-based GPU acceleration method for local search in vehicle routing problems, significantly improving computational efficiency and broadening applicability across VRP variants.
Contribution
The study presents a novel tensor-based GPU acceleration technique for local search in VRP, enabling faster computations and greater flexibility compared to traditional CPU methods.
Findings
Substantial speedups over CPU implementations.
Effective across multiple VRP variants.
Insight into method's strengths and limitations.
Abstract
Local search plays a central role in many effective heuristic algorithms for the vehicle routing problem (VRP) and its variants. However, neighborhood exploration is known to be computationally expensive and time consuming, especially for large instances or problems with complex constraints. In this study, we explore a promising direction to address this challenge by introducing an original tensor-based GPU acceleration method designed to speed up the commonly used local search operators in vehicle routing. By using an attribute-based representation, the method offers broad extensibility, making it applicable to different VRP variants. Its low-coupling architecture, with intensive computations completely offloaded to the GPU, ensures seamless integration in various local search-based algorithms and frameworks, leading to significant improvements in computational efficiency and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
