Pickup and delivery with lockers

被引:14
作者
Dell'Amico, M. [1 ,2 ]
Montemanni, R. [1 ,2 ]
Novellani, S. [3 ]
机构
[1] Univ Modena & Reggio Emilia, Dept Sci & Methods Engn, Via Amendola 2, I-42122 Reggio Emilia, Italy
[2] Univ Modena & Reggio Emilia, Interdept Ctr En&Tech, Capannone 19 Tecnopolo,Piazzale Europa 1, I-42124 Reggio Emilia, Italy
[3] Univ Bologna, Dept Math, Cesena Campus,Via Univ 50, I-47522 Cesena, Italy
关键词
Last-mile; Lockers; Branch-and-cut; Formulations; Pickup & delivery; Routing; VEHICLE-ROUTING PROBLEM; TRAVELING SALESMAN PROBLEM; PARCEL DELIVERY; E-COMMERCE;
D O I
10.1016/j.trc.2023.104022
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
We define a pickup and delivery routing problem with time windows that arises in last-mile delivery. A customer can be served either directly at home, by one of the available capacitated trucks, or via lockers, that allow a self-service option. On the same route, the couriers must deliver the parcels and collect the packages that the customers intend to return. The returned parcels can be picked up directly at the customers' homes or at a locker. Customers can select home service, self-service at one of the nearby lockers with a discount, or let the logistics company decide. All services must be performed within a given time window. We propose three formulations, two branch-and-cut algorithms, and some valid inequalities. We also investigate the case with a single vehicle, with different types of time windows, including no time windows. Moreover, we show how to accommodate simultaneous pickup and delivery and multiple requests from a customer.
引用
收藏
页数:27
相关论文
共 41 条
[1]  
2ndKitchen, 2022, US
[2]  
Amazon, 2022, AM HUB US
[3]  
Bug P, 2018, SPR SER FASH BUS, P139, DOI 10.1007/978-981-10-7007-5_9
[4]   Last mile deliveries with lockers: formulations and algorithms [J].
Buzzega, Giovanni ;
Novellani, Stefano .
SOFT COMPUTING, 2023, 27 (18) :12843-12861
[5]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[6]  
Dell'Amico M., 2011, 2011 IEEE Forum on Integrated and Sustainable Transportation Systems (FISTS 2011), P132, DOI 10.1109/FISTS.2011.5973626
[7]   AN OPTIMAL ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM WITH TIME WINDOWS [J].
DUMAS, Y ;
DESROSIERS, J ;
GELINAS, E ;
SOLOMON, MM .
OPERATIONS RESEARCH, 1995, 43 (02) :367-371
[8]   A large neighborhood search approach to the vehicle routing problem with delivery options [J].
Dumez, Dorian ;
Lehuede, Fabien ;
Peton, Olivier .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 144 :103-132
[9]   INTEGER PROGRAMMING APPROACH TO VEHICLE SCHEDULING PROBLEM [J].
FOSTER, BA ;
RYAN, DM .
OPERATIONAL RESEARCH QUARTERLY, 1976, 27 (02) :367-384
[10]   A generalized insertion heuristic for the traveling salesman problem with time windows [J].
Gendreau, M ;
Hertz, A ;
Laporte, G ;
Stan, M .
OPERATIONS RESEARCH, 1998, 46 (03) :330-335