IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v196y2025ics1366554525000730.html
   My bibliography  Save this article

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

Author

Listed:
  • Wang, Yong
  • Wei, Yuanfan
  • Wei, Yuanhan
  • Zhen, Lu
  • Deng, Shejun

Abstract

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 k-nearest 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 the network with and without split load strategies shows that the TOC and ALR in each depot are improved by $2,128, $905, $1,265, $796, and 40.47%, 34.67%, 21.98%, 36.91%, respectively. The findings offer essential insights for promoting a digitally-intelligent and resource-efficient urban logistics system.

Suggested Citation

  • Wang, Yong & Wei, Yuanfan & Wei, Yuanhan & Zhen, Lu & Deng, Shejun, 2025. "Collaborative multidepot split delivery network design with three-dimensional loading constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).
  • Handle: RePEc:eee:transe:v:196:y:2025:i:c:s1366554525000730
    DOI: 10.1016/j.tre.2025.104032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525000730
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2025.104032?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:196:y:2025:i:c:s1366554525000730. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.