Pickup and delivery with lockers

33Citations
Citations of this article
62Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Dell’Amico, M., Montemanni, R., & Novellani, S. (2023). Pickup and delivery with lockers. Transportation Research Part C: Emerging Technologies, 148. https://doi.org/10.1016/j.trc.2023.104022

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free