The Multi-Period Location Routing Problem with Locker Boxes (2024)

Grabenschweiger, J., Dörner, K. F. (2022). The Multi-Period Location Routing Problem with Locker Boxes. Logistics Research, 15(1), [8]. https://doi.org/10.23773/2022_8

Grabenschweiger, Jasmin ; Dörner, Karl Franz ; Hartl, Richard. / The Multi-Period Location Routing Problem with Locker Boxes. in: Logistics Research. 2022 ; Band 15, Nr. 1.

@article{b4bfb217b6424974828cabd65f8c426c,

title = "The Multi-Period Location Routing Problem with Locker Boxes",

abstract = "When optimal parcel delivery plans have to be made, a logistic system with locker boxes as alternative delivery locations can greatly increase efficiency. An important decision in such a system is where to locate the locker box stations. Hence, we extend the vehicle routing problem with locker boxes to a location routing problem with multiple planning periods. In every period, decisions have to be made about which customers are served at home and which are served at locker boxes as well as how the used delivery locations are routed. On the other hand, the decision of which stations are opened is made only once. The objective function is minimizing total cost, which comprises travel costs, costs for compensating locker box customers, and site costs for realized stations. We provide a mixed integer programming formulation of the problem and propose a metaheuristic solution method. We use self-generated instances to compare the performance of the two approaches and can show that the metaheuristic method yields, on average, very good solutions – in most cases, the optimal solution – in a short computational time. We present and test different strategies for distributing the locker box stations, including based on customer clusters obtained by k-means, which works very well for a variety of geographic customer settings. Moreover, we analyze the utilization of locker box delivery in relation to the length of customer time windows and observe that tight time windows lead to a higher utilization.",

keywords = "Locker boxes, Location routing problem, Metaheuristics",

author = "Jasmin Grabenschweiger and D{\"o}rner, {Karl Franz} and Richard Hartl",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2022.",

year = "2022",

month = jul,

day = "29",

doi = "10.23773/2022_8",

language = "English",

volume = "15",

journal = "Logistics Research",

issn = "1865-035X",

number = "1",

}

Grabenschweiger, J, Dörner, KF 2022, 'The Multi-Period Location Routing Problem with Locker Boxes', Logistics Research, Jg. 15, Nr. 1, 8. https://doi.org/10.23773/2022_8

The Multi-Period Location Routing Problem with Locker Boxes. / Grabenschweiger, Jasmin; Dörner, Karl Franz (Korresp. Autor*in); Hartl, Richard.

in: Logistics Research, Band 15, Nr. 1, 8, 29.07.2022.

Veröffentlichungen: Beitrag in Fachzeitschrift › Artikel › Peer Reviewed

TY - JOUR

T1 - The Multi-Period Location Routing Problem with Locker Boxes

AU - Grabenschweiger, Jasmin

AU - Dörner, Karl Franz

AU - Hartl, Richard

N1 - Publisher Copyright:© The Author(s) 2022.

PY - 2022/7/29

Y1 - 2022/7/29

N2 - When optimal parcel delivery plans have to be made, a logistic system with locker boxes as alternative delivery locations can greatly increase efficiency. An important decision in such a system is where to locate the locker box stations. Hence, we extend the vehicle routing problem with locker boxes to a location routing problem with multiple planning periods. In every period, decisions have to be made about which customers are served at home and which are served at locker boxes as well as how the used delivery locations are routed. On the other hand, the decision of which stations are opened is made only once. The objective function is minimizing total cost, which comprises travel costs, costs for compensating locker box customers, and site costs for realized stations. We provide a mixed integer programming formulation of the problem and propose a metaheuristic solution method. We use self-generated instances to compare the performance of the two approaches and can show that the metaheuristic method yields, on average, very good solutions – in most cases, the optimal solution – in a short computational time. We present and test different strategies for distributing the locker box stations, including based on customer clusters obtained by k-means, which works very well for a variety of geographic customer settings. Moreover, we analyze the utilization of locker box delivery in relation to the length of customer time windows and observe that tight time windows lead to a higher utilization.

AB - When optimal parcel delivery plans have to be made, a logistic system with locker boxes as alternative delivery locations can greatly increase efficiency. An important decision in such a system is where to locate the locker box stations. Hence, we extend the vehicle routing problem with locker boxes to a location routing problem with multiple planning periods. In every period, decisions have to be made about which customers are served at home and which are served at locker boxes as well as how the used delivery locations are routed. On the other hand, the decision of which stations are opened is made only once. The objective function is minimizing total cost, which comprises travel costs, costs for compensating locker box customers, and site costs for realized stations. We provide a mixed integer programming formulation of the problem and propose a metaheuristic solution method. We use self-generated instances to compare the performance of the two approaches and can show that the metaheuristic method yields, on average, very good solutions – in most cases, the optimal solution – in a short computational time. We present and test different strategies for distributing the locker box stations, including based on customer clusters obtained by k-means, which works very well for a variety of geographic customer settings. Moreover, we analyze the utilization of locker box delivery in relation to the length of customer time windows and observe that tight time windows lead to a higher utilization.

KW - Locker boxes

KW - Location routing problem

KW - Metaheuristics

UR - http://www.scopus.com/inward/record.url?scp=85141130234&partnerID=8YFLogxK

U2 - 10.23773/2022_8

DO - 10.23773/2022_8

M3 - Article

VL - 15

JO - Logistics Research

JF - Logistics Research

SN - 1865-035X

IS - 1

M1 - 8

ER -

Grabenschweiger J, Dörner KF, Hartl R. The Multi-Period Location Routing Problem with Locker Boxes. Logistics Research. 2022 Jul 29;15(1):8. doi: 10.23773/2022_8