EconPapers    
Economics at your fingertips  
 

The vehicle routing problem with heterogeneous locker boxes

Jasmin Grabenschweiger (), Karl F. Doerner (), Richard F. Hartl () and Martin W. P. Savelsbergh ()
Additional contact information
Jasmin Grabenschweiger: University of Vienna
Karl F. Doerner: University of Vienna
Richard F. Hartl: University of Vienna
Martin W. P. Savelsbergh: Georgia Institute of Technology

Central European Journal of Operations Research, 2021, vol. 29, issue 1, No 6, 113-142

Abstract: Abstract 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.

Keywords: City logistics; Alternative delivery locations; Home delivery; Capacity at delivery location; Compensation payment; Metaheuristics; Capacitated bin packing (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10100-020-00725-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:cejnor:v:29:y:2021:i:1:d:10.1007_s10100-020-00725-2

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10100

DOI: 10.1007/s10100-020-00725-2

Access Statistics for this article

Central European Journal of Operations Research is currently edited by Ulrike Leopold-Wildburger

More articles in Central European Journal of Operations Research from Springer, Slovak Society for Operations Research, Hungarian Operational Research Society, Czech Society for Operations Research, Österr. Gesellschaft für Operations Research (ÖGOR), Slovenian Society Informatika - Section for Operational Research, Croatian Operational Research Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:cejnor:v:29:y:2021:i:1:d:10.1007_s10100-020-00725-2