Scheduling last-mile deliveries with truck-based autonomous robots

被引:168
作者
Boysen, Nils [1 ]
Schwerdfeger, Stefan [2 ]
Weidinger, Felix [1 ]
机构
[1] Friedrich Schiller Univ Jena, Lehrstuhl Operat Management, Carl Zeiss Str 3, D-07743 Jena, Germany
[2] Friedrich Schiller Univ Jena, Lehrstuhl Management Sci, Carl Zeiss Str 3, D-07743 Jena, Germany
关键词
Scheduling; Transportation; City logistics; Autonomous robots; POLYNOMIAL ALGORITHM; SALESMAN;
D O I
10.1016/j.ejor.2018.05.058
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
To reduce the negative impact of excessive traffic in large urban areas, many innovative concepts for intelligent transportation of people and freight have recently been developed. One of these concepts relies on autonomous delivery robots launched from trucks. A truck loads the freight dedicated to a set of customers in a central depot and moves into the city center. Also on board are small autonomous robots which each can be loaded with the freight dedicated to a single customer and launched from the truck. Then, the autonomous robots move to their dedicated customers and, after delivery, autonomously return to some robot depot in the city center. The truck can replenish robots at these decentralized depots to launch further of them until all its customers are supplied. To assess the potential of this innovative concept, this paper develops scheduling procedures which determine the truck route along robot depots and drop-off points where robots are launched, such that the weighted number of late customer deliveries is minimized. We formulate the resulting scheduling problem, investigate computational complexity, and develop suited solution methods. Furthermore, we benchmark the truck-based robot delivery concept with conventional attended home delivery by truck to assess the potential of this novel last-mile concept. (C) 2018 Elsevier B.V. All rights reserved.
引用
收藏
页码:1085 / 1099
页数:15
相关论文
共 22 条
[1]   THE COMPLEXITY OF THE TRAVELING REPAIRMAN PROBLEM [J].
AFRATI, F ;
COSMADAKIS, S ;
PAPADIMITRIOU, CH ;
PAPAGEORGIOU, G ;
PAPAKOSTANTINOU, N .
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1986, 20 (01) :79-87
[2]  
Agatz N., 2018, TRANSPORTATION SCI
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[4]   APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM [J].
ARKIN, EM ;
HASSIN, R .
DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) :197-218
[5]  
Arslan A, 2016, WORKING PAPER
[6]  
Boysen N., 2017, WORKING PAPER
[7]   A faster polynomial algorithm for the unbalanced Hitchcock transportation problem [J].
Brenner, Ulrich .
OPERATIONS RESEARCH LETTERS, 2008, 36 (04) :408-413
[8]   THE COVERING SALESMAN PROBLEM [J].
CURRENT, JR ;
SCHILLING, DA .
TRANSPORTATION SCIENCE, 1989, 23 (03) :208-213
[9]  
Daimler, 2017, VANS ROB PAK 2 0
[10]   Synchronization in Vehicle Routing-A Survey of VRPs with Multiple Synchronization Constraints [J].
Drexl, Michael .
TRANSPORTATION SCIENCE, 2012, 46 (03) :297-316