Collaborative multidepot split delivery network design with three-dimensional loading constraints

被引:0
|
作者
Wang, Yong [1 ,2 ]
Wei, Yuanfan [1 ]
Wei, Yuanhan [3 ]
Zhen, Lu [4 ]
Deng, Shejun [5 ]
机构
[1] Chongqing Jiaotong Univ, Sch Econ & Management, Chongqing 400074, Peoples R China
[2] Chongqing Jiaotong Univ, Chongqing Key Lab Intelligent Logist Network, Chongqing 400074, Peoples R China
[3] Dalian Univ Technol, Sch Econ & Management, Dalian 116024, Liaoning, Peoples R China
[4] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
[5] Yangzhou Univ, Coll Civil Sci & Engn, Yangzhou 225009, Peoples R China
基金
中国国家自然科学基金;
关键词
Multidepot vehicle routing problem; adaptive non-dominated sorting genetic algo-; rithm-III; Three-dimensional loading; Split delivery; Vehicle compartment partition; VEHICLE-ROUTING PROBLEM; LARGE NEIGHBORHOOD SEARCH; TIME WINDOWS; TABU SEARCH; ALGORITHM; PICKUP; FORMULATION; PREDICTION; MODELS; PRICE;
D O I
10.1016/j.tre.2025.104032
中图分类号
F [经济];
学科分类号
02 ;
摘要
The growing demand for bulky goods has spurred logistics firms to explore how to effectively manage and optimize multidepot delivery networks that consider three-dimensional loading constraints. The ability to divide customer demands and adaptively adjust vehicle compartments has significantly enhanced delivery efficiency and vehicle resource utilization. This study develops a collaborative multidepot vehicle routing problem that accommodates split deliveries and three-dimensional loading constraints. It begins by formulating a multi-objective mathematical model that aims to minimize total operating costs (TOC) and the number of vehicles used (NV) while maximizing the average loading rate (ALR). A novel hybrid algorithm combining an improved k-nearest neighbor clustering algorithm with an adaptive non-dominated sorting genetic algorithm-III (ANSGA-III) is developed to find Pareto optimal solutions. The improved knearest neighbor clustering algorithm is applied for the reallocation of customers. The ANSGA-III incorporates elite alteration and adaptive information feedback mechanisms to enhance the solution quality and algorithm convergence. Strategies for split loads and vehicle compartment partition are integrated into the ANSGA-III, facilitating the improvement of vehicle resource configuration efficiency. The superiority of the proposed algorithm is verified by comparison with those of the CPLEX solver for small-scale problems and against multi-objective particle swarm optimization, multi-objective evolutionary algorithms, and multi-objective ant colony optimization for medium-to-large problems. Additionally, the proposed model and algorithm are applied to a real-world case study in Chongqing city, China, and the result comparison from the initial network to optimized network shows that the TOC and NV reduced by 43.57% and 32.14%, respectively, while the ALR is improved by 33.51%. Furthermore, this study discusses the optimized results under varying the vehicle compartment partition strategies, contributing to the superiority of proposed approach in improving vehicle resource utilization efficiency. This represents significant cost savings of $2,934 and a reduction of six vehicles, along with a notable 23.35%% improvement in ALR compared to the scenario without compartment division. We also discuss various scenarios involving the split load strategies and different loading capacity schemes, and the computational results demonstrate that the proposed approach improves vehicle loading rates and reduces logistics operating costs. Specifically, the result comparison between
引用
收藏
页数:33
相关论文
共 50 条
  • [1] The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints
    Bortfeldt, Andreas
    Yi, Junmin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (02) : 545 - 558
  • [2] The Split Delivery Vehicle Routing Problem with Three-Dimensional Loading and Time Windows Constraints
    Chen, Zongyi
    Yang, Mingkang
    Guo, Yijun
    Liang, Yu
    Ding, Yifan
    Wang, Li
    SUSTAINABILITY, 2020, 12 (17)
  • [3] THE SPLIT DELIVERY VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND THREE-DIMENSIONAL LOADING CONSTRAINTS
    Yan, Miao
    Chu, Liang-Yong
    Wu, Xin-Cheng
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (02) : 786 - 807
  • [4] The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery-A Case Study
    Yi, Junmin
    Bortfeldt, Andreas
    OPERATIONS RESEARCH PROCEEDINGS 2016, 2018, : 351 - 356
  • [5] The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
    Rajaei, Maryam
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (02) : 706 - 721
  • [6] A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints
    Wang, Yong
    Wei, Yuanhan
    Wang, Xiuwen
    Wang, Zheng
    Wang, Haizhong
    APPLIED SOFT COMPUTING, 2023, 133
  • [7] Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban
    Maennel, Dirk
    Bortfeldt, Andreas
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 264 (01) : 119 - 137
  • [8] A Double Traveling Salesman Problem With Three-Dimensional Loading Constraints for Bulky Item Delivery
    Ruan, Minzhi
    Shen, Chunyue
    Tang, Jianqiang
    Qi, Chao
    Qiu, Shuang
    IEEE ACCESS, 2021, 9 : 13052 - 13063
  • [9] An Improved Hybrid Heuristic Algorithm for Pickup and Delivery Problem with Three-Dimensional Loading Constraints
    Wu, Jiangqing
    Zheng, Ling
    Huang, Can
    Cai, Sifan
    Feng, Shaorong
    Zhang, Defu
    2019 IEEE 31ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2019), 2019, : 1607 - 1612
  • [10] Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints
    Zhang, Yinggui
    Sheng, Lining
    SUSTAINABILITY, 2023, 15 (11)