VeLP: Vehicle Loading Plan Learning from Human Behavior in Nationwide Logistics System
Sijing Duan, Feng Lyu, Xin Zhu, Yi Ding, Haotian Wang, Desheng Zhang, Xue Liu, Yaoxue Zhang, Ju Ren
Abstract
For a nationwide logistics transportation system, it is critical to make the vehicle loading plans (i.e., given many packages, deciding vehicle types and numbers) at each sorting and distribution center. This task is currently completed by dispatchers at each center in many logistics companies and consumes a lot of workloads for dispatchers. Existing works formulate such an issue as a cargo loading problem and solve it by combinatorial optimization methods. However, it cannot work in some real-world nationwide applications due to the lack of accurate cargo volume information and effective model design under complicated impact factors as well as temporal correlation. In this paper, we explore a new opportunity to utilize large-scale route and human behavior data (i.e., dispatchers' decision process on planning vehicles) to generate vehicle loading plans (i.e., plans). Specifically, we collect a five-month nationwide operational dataset from JD Logistics in China and comprehensively analyze human behaviors. Based on the data-driven analytics insights, we design a Vehicle Loading Plan learning model, named VeLP, which consists of a pattern mining module and a deep temporal cross neural network, to learn the human behaviors on regular and irregular routes, respectively. Extensive experiments demonstrate the superiority of VeLP, which achieves performance improvement by 35.8% and 50% for trunk and branch routes compared with baselines, respectively. Besides, we deployed VeLP in JDL and applied it in about 400 routes, reducing the time by approximately 20% in creating plans. It saves significant human workload and improves operational efficiency for the logistics company.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 54b86ff4-7bbb-46e9-a630-98b531cc2c9bBuilds on5
- A Hierarchical Reinforcement Learning Based Optimization Framework for Large-scale Dynamic Pickup and Delivery ProblemsYi Ma, Xiaotian Hao, Jianye Hao, Jiawen Lu et al.NeurIPS 2021 · 100 citations
- Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical GuaranteesYuxiang Zeng, Yongxin Tong, Lei ChenVLDB 2020 · 74 citations
- Learning Variational Word Masks to Improve the Interpretability of Neural Text ClassifiersHanjie Chen, Yangfeng JiEMNLP 2020 · 45 citations
- Learning Feature Interactions with Lorentzian Factorization MachineCanran Xu, Ming WuAAAI 2020 · 36 citations
- Memorize, Factorize, or be Naive: Learning Optimal Feature Interaction Methods for CTR PredictionFuyuan Lyu, Xing Tang, Huifeng Guo, Ruiming Tang et al.ICDE 2022 · 18 citations
Related papers
- Multi-Task Learning for Routing Problem with Cross-Problem Zero-Shot GeneralizationFei Liu, Xi Lin, Zhenkun Wang, Qingfu Zhang et al.KDD 2024 · 12 citations
- Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing ProblemsLiang Xin, Wen Song, Zhiguang Cao, Jie ZhangAAAI 2021 · 209 citations
- Learning to Reduce Search Space for Generalizable Neural Routing SolverChangliang Zhou, Xi Lin, Zhenkun Wang, Qingfu ZhangKDD 2026 · 17 citations
- A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-HailingPeng Cheng, Jiabao Jin, Lei Chen, Xuemin Lin et al.VLDB 2021 · 18 citations
- DistrictNet: Decision-aware learning for geographical districtingCheikh Ahmed, Alexandre Forel, Axel Parmentier, Thibaut VidalNeurIPS 2024 · 5 citations
