Author
Listed:
- Ostermeier, Manuel
- Huf, Tobias
Abstract
The increasing number of home deliveries paired with various delivery modes and channels require retailers to establish efficient delivery networks. Integrating retailers into delivery networks of third-party logistics service providers (3PLs) is one way to address this challenge. In this regard, the innovative truck-and-robot concept is a promising alternative to standard truck deliveries. The concept relies on autonomous robots carried and released by trucks to serve customers in predefined time windows. We extend this concept by integrating pickup locations and corresponding delivery requests for direct customer supply. This setup combines the first and the last mile, giving rise to a novel concept where different delivery modes are established that provide robots as a service to pick up and deliver goods to customers. The problem is formalized as the Truck-and-Robot Pickup-and-Delivery Problem (TnR-PDP), integrating pickups and introducing four different delivery modes for home deliveries. We solve the problem using a specialized heuristic, the Adaptive Genetic Algorithm (AGA). The AGA is based on a recombination-based search framework but tailored to the problem specifics (e.g., no or multiple visits per location) using specialized recombination operators and an adaptive search strategy for location and operator selection. Our numerical experiments show that our algorithm works efficiently, outperforming a benchmark approach concerning runtime by up to 79 % while improving solution quality. Furthermore, an in-depth analysis shows a savings potential of 81 % when integrating pickups into the concept compared with alternative approaches, highlighting the benefits of the newly introduced delivery modes.
Suggested Citation
Ostermeier, Manuel & Huf, Tobias, 2026.
"The truck-and-robot routing problem with pickups and deliveries,"
European Journal of Operational Research, Elsevier, vol. 333(1), pages 174-191.
Handle:
RePEc:eee:ejores:v:333:y:2026:i:1:p:174-191
DOI: 10.1016/j.ejor.2025.11.034
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:333:y:2026:i:1:p:174-191. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.