TY - JOUR
T1 - The Vehicle Routing Problem with Heterogeneous Locker Boxes
AU - Grabenschweiger, Jasmin
AU - Dörner, Karl Franz
AU - Hartl, Richard
AU - Savelsbergh, Martin W P
PY - 2021/3
Y1 - 2021/3
N2 - To achieve logistic efficiency and customer convenience in last-mile delivery processes, a system with alternative delivery points in the form of locker box stations can be used. In such a system, customers can be served either at their home address within a certain time window, or at a locker box station where parcels can be picked up at any time. Customers can get a compensation payment when being served at a locker box. They can have a request of more than one parcel and the parcels can be of different sizes. At a locker box station, a limited number of slots of different sizes is available; we assume that parcels of one customer can be stored together in a slot. We consider the vehicle routing problem with heterogeneous locker boxes, where the total cost-consisting of routing and compensation costs-has to be minimized while taking into account the packing of parcels into locker boxes. We provide a mathematical formulation of the problem and propose a metaheuristic solution method. Instances and results from the literature for the problem with a single parcel and a single slot size are used to benchmark our metaheuristic solution method. For the problem with different sizes, we compare a unit-size model to a multi-size model, packing being considered in the latter. Finally, we analyze how different configurations of locker box stations work for different demand scenarios.
AB - To achieve logistic efficiency and customer convenience in last-mile delivery processes, a system with alternative delivery points in the form of locker box stations can be used. In such a system, customers can be served either at their home address within a certain time window, or at a locker box station where parcels can be picked up at any time. Customers can get a compensation payment when being served at a locker box. They can have a request of more than one parcel and the parcels can be of different sizes. At a locker box station, a limited number of slots of different sizes is available; we assume that parcels of one customer can be stored together in a slot. We consider the vehicle routing problem with heterogeneous locker boxes, where the total cost-consisting of routing and compensation costs-has to be minimized while taking into account the packing of parcels into locker boxes. We provide a mathematical formulation of the problem and propose a metaheuristic solution method. Instances and results from the literature for the problem with a single parcel and a single slot size are used to benchmark our metaheuristic solution method. For the problem with different sizes, we compare a unit-size model to a multi-size model, packing being considered in the latter. Finally, we analyze how different configurations of locker box stations work for different demand scenarios.
KW - city logistics
KW - alternative delivery locations
KW - home delivery
KW - capacity at delivery location
KW - compensation payment
KW - metaheuristics
KW - capacitated bin packing
KW - Metaheuristics
KW - Home delivery
KW - Capacitated bin packing
KW - Alternative delivery locations
KW - Compensation payment
KW - City logistics
KW - Capacity at delivery location
KW - MR
UR - http://www.scopus.com/inward/record.url?scp=85099292493&partnerID=8YFLogxK
U2 - 10.1007/s10100-020-00725-2
DO - 10.1007/s10100-020-00725-2
M3 - Article
SN - 1435-246X
VL - 29
SP - 113
EP - 142
JO - Central European Journal of Operations Research
JF - Central European Journal of Operations Research
IS - 1
ER -