Next Article in Journal
A Truly Robust Signal Temporal Logic: Monitoring Safety Properties of Interacting Cyber-Physical Systems under Uncertain Observation
Previous Article in Journal
Point Cloud Upsampling Algorithm: A Systematic Review
Previous Article in Special Issue
Swarm Robots Cooperative and Persistent Distribution Modeling and Optimization Based on the Smart Community Logistics Service Framework
Article

Computational Approaches for Grocery Home Delivery Services

1
Department of Mathematics, University of Klagenfurt, 9020 Klagenfurt, Austria
2
Department of Operations, Energy, and Environmental Management, University of Klagenfurt, 9020 Klagenfurt, Austria
3
MANSIO Karl Popper Kolleg, University of Klagenfurt, 9020 Klagenfurt, Austria
*
Author to whom correspondence should be addressed.
Academic Editors: Roberto Carballedo Morillo and Eneko Osaba
Algorithms 2022, 15(4), 125; https://doi.org/10.3390/a15040125
Received: 8 March 2022 / Revised: 4 April 2022 / Accepted: 7 April 2022 / Published: 9 April 2022
The steadily growing popularity of grocery home-delivery services is most likely based on the convenience experienced by its customers. However, the perishable nature of the products imposes certain requirements during the delivery process. The customer must be present when the delivery arrives so that the delivery process can be completed without interrupting the cold chain. Therefore, the grocery retailer and the customer must mutually agree on a time window during which the delivery can be guaranteed. This concept is referred to as the attended home delivery (AHD) problem in the scientific literature. The phase during which customers place orders, usually through a web service, constitutes the computationally most challenging part of the logistical processes behind such services. The system must determine potential delivery time windows that can be offered to incoming customers and incrementally build the delivery schedule as new orders are placed. Typically, the underlying optimization problem is a vehicle routing problem with a time windows. This work is concerned with a case given by an international grocery retailer’s online shopping service. We present an analysis of several efficient solution methods that can be employed to AHD services. A framework for the operational planning tools required to tackle the order placement process is provided. However, the basic framework can easily be adapted to be used for many similar vehicle routing applications. We provide a comprehensive computational study comparing several algorithmic strategies, combining heuristics utilizing local search operations and mixed-integer linear programs, tackling the booking process. Finally, we analyze the scalability and suitability of the approaches. View Full-Text
Keywords: attended home delivery; grocery home delivery; vehicle routing problem with time windows attended home delivery; grocery home delivery; vehicle routing problem with time windows
Show Figures

Figure 1

MDPI and ACS Style

Truden, C.; Maier, K.; Jellen, A.; Hungerländer, P. Computational Approaches for Grocery Home Delivery Services. Algorithms 2022, 15, 125. https://doi.org/10.3390/a15040125

AMA Style

Truden C, Maier K, Jellen A, Hungerländer P. Computational Approaches for Grocery Home Delivery Services. Algorithms. 2022; 15(4):125. https://doi.org/10.3390/a15040125

Chicago/Turabian Style

Truden, Christian, Kerstin Maier, Anna Jellen, and Philipp Hungerländer. 2022. "Computational Approaches for Grocery Home Delivery Services" Algorithms 15, no. 4: 125. https://doi.org/10.3390/a15040125

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop