Skip to yearly menu bar Skip to main content


Virtual presentation / poster accept

Generalize Learned Heuristics to Solve Large-scale Vehicle Routing Problems in Real-time

Qingchun Hou · Jingwei Yang · Yiqiang Su · Xiaoqing Wang · Yuming Deng

Keywords: [ Large-scale Vehicle Routing Problem ] [ attention ] [ learning ] [ generalization ] [ combinatorial optimization ] [ vehicle routing problem ] [ reinforcement learning ] [ General Machine Learning ]


Abstract:

Large-scale Vehicle Routing Problems (VRPs) are widely used in logistics, transportation, supply chain, and robotic systems. Recently, data-driven VRP heuristics are proposed to generate real-time VRP solutions with up to 100 nodes. Despite this progress, current heuristics for large-scale VRPs still face three major challenges: 1) Difficulty in generalizing the heuristics learned on small-scale VRPs to large-scale VRPs without retraining; 2) Challenge in generating real-time solutions for large-scale VRPs; 3) Difficulty in embedding global constraints into learned heuristics. We contribute in the three directions: We propose a Two-stage Divide Method (TAM) to generate sub-route sequence rather than node sequence for generalizing the heuristics learned on small-scale VRPs to solve large-scale VRPs in real-time. A two-step reinforcement learning method with new reward and padding techniques is proposed to train our TAM. A global mask function is proposed to keep the global constraints satisfied when dividing a large-scale VRP into several small-scale Traveling Salesman Problems (TSPs). As result, we can solve the small-scale TSPs in parallel quickly. The experiments on synthetic and real-world large-scale VRPs show our method could generalize the learned heuristics trained on datasets of VRP 100 to solve VRPs with over 5000 nodes in real-time while keeping the solution quality better than data-driven heuristics and competitive with traditional heuristics.

Chat is not available.