Containers Allocation and Recycle Transportation Problem with an Improved Branch-and-price Algorithm

被引：0
|
作者：
Wen B.-B. [1 ]
He S.-W. [2 ]
Chi J.-S. [2 ]
Jin F.-C. [1 ]
机构：
[1] Institute of Computing Technology, China Academy of Railway Sciences Corporation Limited, Beijing
[2] Key Lab. of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Beijing Jiaotong University, Beijing
来源：
Jiaotong Yunshu Xitong Gongcheng Yu Xinxi/Journal of Transportation Systems Engineering and Information Technology | 2023年 / 23卷 / 03期
基金：
中国国家自然科学基金;
关键词：
branch-and-price algorithm; container unitized; containers circulation allocation and recycle; logistics engineering; pickup and delivery vehicle routing;
D O I：
10.16097/j.cnki.1009-6744.2023.03.024
中图分类号：
学科分类号：
摘要：
Considering the drawback of high cost and poor flexibility of equipment transportation under containerization of logistics, a transportation mode of circular allocation and recovery of containers was proposed. In this transportation mode, the container transportation problem belongs to Unpaired Supply-Demand and Split Pickup and Delivery Vehicle Routing Problem (USDSPDVRP). With an accurate problem description, a two-stage model was proposed. And an improved branch pricing algorithm was designed to solve the USDSPDVRP model. The model is decomposed into a main problem of resolving the number of transport schemes used and a sub-problem model of generating new transport schemes based on the results of the main problem by Dantzig- Wolfe decomposition. To solve complex sub-problems efficiently, an appropriate path reduction strategy is designed. Results show that the proposed algorithm is effective. Compared with the result of the Gurobi solver, the average computational time is reduced by 83.9%, and the average gap between the feasible solution and the optimal solution is 2.8%. At the same time, a comparative analysis of cyclic dispatch transportation and direct transportation proves that the cyclic dispatch transportation can reduce the cost and the number of vehicles, and increase the load rating of vehicles. © 2023 Science Press. All rights reserved.
引用
收藏
页码：223 / 234
页数：11
相关论文
共 15 条
  • [1] BRINDLEY C., Position is everything: Rising transport costs make pallet logistics more critical for success, Pallet EnLerprise, 50, 6, pp. 24-28, (2011)
  • [2] MAK S I, WONG Y M, HO K C, Et al., Contemporary green soluLions for the logistics and transportation industry: With case illustration of a leading global 3PL based in Hong Kong, Sustainability, 14, 14, (2022)
  • [3] MOCK K W, CHIN J F, ZARIRAH K W., Implementing milkrun in lean production, HBRP Publication, 3, 1, pp. 1-17, (2020)
  • [4] WU D, WU C., Research on the time-dependent split delivery green vehicle routing problem for fresh agricultural products with multiple time windows, Agriculture, 12, 6, (2022)
  • [5] CHEN Q, LI K, LIU Z., Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads, Transportation Research Part E: Logistics and Transportation Review, 69, 9, pp. 218-235, (2014)
  • [6] XU D, LI K, ZOU X., An unpaired pickup and deliver [J] vehicle routing problem with multi-visit, Transportation Research Part E: Logistics and Transportation Review, 103, 7, pp. 218-247, (2017)
  • [7] XU D Y, LI K P, ZHEN P, Et al., The optimization research of multi-category unpaired supply-demand and arbitrary split pickup and delivery vehicle routing problem with multi-depot and multi-type truckskl, Chinese Journal of Management, 17, 7, pp. 1086-1095, (2020)
  • [8] FAN H M, ZHANG X, REN X X, Et al., Optimization of multi- depot open split delivery vehicle routing problem with simultaneous delivery and pick-up, System Engineering-Theory & Practice, 41, 6, pp. 1521-1534, (2021)
  • [9] ET Y., A selective many-to-many pickup and delivery problem with handling cost in the omni-channel last-mile delivery, IEEE Access, 10, pp. 111284-111296, (2022)
  • [10] BEN T H, ABSI N, FEILLET D, Et al., A branch-and-price algorithm lor the vehicle routing problem with time windows on a road network, Networks, 73, 4, pp. 401-417, (2018)
12