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 条
  • [21] Vehicle routing problem with three-dimensional loading constraints: Experimentations and evaluation
    Meliani, Youssef
    Hani, Yasmina
    Elhaq, Saad Lissane
    El Mhamedi, Abderrahman
    IFAC PAPERSONLINE, 2021, 54 (01): : 104 - 109
  • [22] A HYBRID GENETIC ALGORITHM FOR THE VEHICLE ROUTING PROBLEM WITH THREE-DIMENSIONAL LOADING CONSTRAINTS
    Miao, Lixin
    Ruan, Qingfang
    Woghiren, Kevin
    Ruo, Qi
    RAIRO-OPERATIONS RESEARCH, 2012, 46 (01) : 63 - 82
  • [23] A hybrid matheuristic approach for the vehicle routing problem with three-dimensional loading constraints
    Acosta Rodriguez, Diego Alejandro
    Alvarez Martinez, David
    Willmer Escobar, John
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2022, 13 (03) : 421 - 434
  • [24] A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
    Bortfeldt, Andreas
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (09) : 2248 - 2257
  • [25] Solving capacitated vehicle routing problem with three-dimensional loading and relocation constraints
    Chi, Jushang
    He, Shiwei
    Song, Rui
    COMPUTERS & OPERATIONS RESEARCH, 2025, 173
  • [26] An optimization model for the vehicle routing problem with practical three-dimensional loading constraints
    Junqueira, Leonardo
    Oliveira, Jose F.
    Carravilla, Maria Antonia
    Morabito, Reinaldo
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2013, 20 (05) : 645 - 666
  • [27] Three-dimensional container loading models with cargo stability and load bearing constraints
    Junqueira, Leonardo
    Morabito, Reinaldo
    Yamashita, Denise Sato
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (01) : 74 - 85
  • [28] The Split Three-Dimensional Crystallographic Groups
    Farley, Daniel Scott
    Ortiz, Ivonne Johanna
    ALGEBRAIC K-THEORY OF CRYSTALLOGRAPHIC GROUPS: THE THREE-DIMENSIONAL SPLITTING CASE, 2014, 2113 : 41 - 43
  • [29] An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
    Ferreira, Kamyla Maria
    de Queiroz, Thiago Alves
    Bragion Toledo, Franklina Maria
    COMPUTERS & OPERATIONS RESEARCH, 2021, 136
  • [30] Research on Three-Dimensional Integrated Guidance and Control Design with Multiple Constraints
    Fu, Zhenhua
    Zhang, Kuanqiao
    Yang, Suochang
    INTERNATIONAL JOURNAL OF AEROSPACE ENGINEERING, 2022, 2022