The multi-fleet delivery problem combined with trucks, tricycles, and drones for last-mile logistics efficiency requirements under multiple budget constraints

被引:10
作者
Chen, Enming [1 ]
Zhou, Zhongbao [1 ]
Li, Ruiyang [1 ]
Chang, Zhongxiang [2 ]
Shi, Jianmai [3 ]
机构
[1] Hunan Univ, Sch Business Adm, Changsha 410082, Peoples R China
[2] Changsha Univ Sci & Technol, Sch Traff & Transport Engn, Changsha 410114, Peoples R China
[3] Natl Univ Def Technol, Coll Syst Engn, Changsha 410073, Peoples R China
关键词
Last-mile logistics; Heterogeneous-vehicle collaboration; Multiple budget constraints; Mixed integer linear programming; Adaptive large neighborhood search algorithm; LARGE NEIGHBORHOOD SEARCH; TRAVELING SALESMAN PROBLEM; VEHICLE-ROUTING-PROBLEMS; OPTIMIZATION; MARKET;
D O I
10.1016/j.tre.2024.103573
中图分类号
F [经济];
学科分类号
02 ;
摘要
In the increasingly competitive urban logistics delivery business field, enhancing last-mile logistics efficiency with constrained budgets is crucial for logistics companies. With the increasing adoption of emerging vehicles in last-mile logistics, neglecting the capacity of traditional vehicles may be uneconomical. This paper introduces the multi-fleet delivery problem combined with Trucks, Tricycles, and Drones (MFDP-TTD) for last-mile logistics efficiency requirements under multiple budget constraints, which represents a novel variant of the Two-Echelon Vehicle Routing Problem. Compared to the truck-drone mode, truck-tricycle mode, and the Two-Echelon Vehicle Routing Problem, by adding the collaboration of an emerging delivery vehicle (drones) and a traditional delivery vehicle (tricycle), the MFDP-TTD improves the speed of delivery of last-mile logistics more cost-efficiently. To tackle this intricate issue, this paper devises a Mixed Integer Linear Programming (MILP) model, taking into account fixed cost-related budgets and operating cost-related budgets. The model allows for the integration of diverse numbers of tricycles and drones across various fleets, with larger vehicles accommodating smaller ones to moving. In addition, some valid inequalities based on the properties of the problem are presented to accelerate the solution process. To solve this problem efficiently on a large scale, the paper proposes a multi-start improved adaptive large neighborhood search algorithm (MS-IALNS) that combines the advantages of an adaptive large neighborhood search algorithm and an ant colony algorithm. In addition, four fast feasibility-checking strategies designed based on valid inequalities are proposed. Extensive computational experiments demonstrate the validity of the MILP model and valid inequalities and the advantages of the MS-IALNS. Compared to the multi-fleet delivery problem with Trucks and Tricycles, the Two-Echelon Vehicle Routing Problem, the two-echelon city delivery mode with mobile satellites, and other potential multi-fleet collaborative delivery modes, the MFDP-TTD exhibits clear advantages in integrated time costs under same multiple budget constraints. In addition, a balanced mix of numbers of tricycles and drones within the fleet, an appropriate increase in the fixed cost-related budgets, and retrofitting of trucks and tricycles to accommodate smaller vehicles and to carry batteries for replacement are recommended.
引用
收藏
页数:42
相关论文
共 54 条
[1]   Fine-tuning of algorithms using fractional experimental designs and local search [J].
Adenso-Díaz, B ;
Laguna, M .
OPERATIONS RESEARCH, 2006, 54 (01) :99-114
[2]   Optimization Approaches for the Traveling Salesman Problem with Drone [J].
Agatz, Niels ;
Bouman, Paul ;
Schmidt, Marie .
TRANSPORTATION SCIENCE, 2018, 52 (04) :965-981
[3]   A robust ant colony metaheuristic for urban freight transport scheduling using passenger rail network [J].
Behiri, Walid ;
Belmokhtar-Berraf, Sana ;
Chu, Chengbin .
EXPERT SYSTEMS WITH APPLICATIONS, 2023, 213
[4]   Dynamic programming approaches for the traveling salesman problem with drone [J].
Bouman, Paul ;
Agatz, Niels ;
Schmidt, Marie .
NETWORKS, 2018, 72 (04) :528-542
[5]   Worst-case demand distributions in vehicle routing [J].
Carlsson, John Gunnar ;
Behroozi, Mehdi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 256 (02) :462-472
[6]   Truck driver reported unrealistically tight delivery schedules linked to their opinions of maximum speed limits and hours-of-service rules and their compliance with these safety laws and regulations [J].
Chen, Guang X. ;
Sieber, W. Karl ;
Collins, James W. ;
Hitchcock, Edward M. ;
Lincoln, Jennifer E. ;
Pratt, Stephanie G. ;
Sweeney, Marie H. .
SAFETY SCIENCE, 2021, 133
[7]   A survey on two-echelon routing problems [J].
Cuda, R. ;
Guastaroba, G. ;
Speranza, M. G. .
COMPUTERS & OPERATIONS RESEARCH, 2015, 55 :185-199
[8]   Electric vehicles in the last mile of urban freight transportation: A sustainability assessment of postal deliveries in Rio de Janeiro-Brazil [J].
de Mello Bandeira, Renata Albergaria ;
Goes, George Vasconcelos ;
Schmitz Goncalves, Daniel Neves ;
D'Agosto, Marcio de Almeida ;
de Oliveira, Cintia Machado .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2019, 67 :491-502
[9]   Algorithms based on branch and bound for the flying sidekick traveling salesman problem [J].
Dell'Amico, Mauro ;
Montemanni, Roberto ;
Novellani, Stefano .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
[10]   2-echelon lastmile delivery with lockers and occasional couriers [J].
Dos Santos, Andre Gustavo ;
Viana, Ana ;
Pedroso, Joao Pedro .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2022, 162