A Data-Driven Three-Layer Algorithm For Split Delivery Vehicle Routing Problem With 3D Container Loa

Authors:
Xijun Li Huawei Noah's Ark Lab
Mingxuan Yuan Huawei Noah's Ark Lab
Di Chen Huawei Noah's Ark Lab
Jianguo Yao Shanghai Jiao Tong University
Jia Zeng Huawei Noah's Ark Lab

Introduction:

This paper studies Split Delivery Vehicle Routing Problem with 3D Loading Constraints (3L-SDVRP) .The paper's solution employs a novel data-driven three-layer search algorithm (DTSA),

Abstract:

Split Delivery Vehicle Routing Problem with 3D Loading Constraints (3L-SDVRP) can be seen as the most important problem in large-scale manufacturing logistics. The goal is to devise a strategy consisting of three NP-hard planning components: vehicle routing, cargo splitting and container loading, which shall be jointly optimized for cost savings. The problem is an enhanced variant of the classical logistics problem 3L-CVRP, and its complexity leaps beyond current studies of solvability. Our solution employs a novel data-driven three-layer search algorithm (DTSA), which we designed to improve both the efficiency and effectiveness of traditional meta-heuristic approaches, through learning from data and from simulation.

You may want to know: