Authors: | Schaudt, Stefan Clausen, Uwe Klein, Nicklas |
Title: | A Branch-and-Price Algorithm for Optimal Routing of Delivery Robots |
Language (ISO): | en |
Abstract: | Increasing parcel volumes, environmental challenges, and customer expectations have made innovative delivery concepts for last-mile logistics essential in recent years. Autonomous delivery vehicles such as delivery robots or drones are tested worldwide. In this work, we examine the use of electrical delivery robots to optimize a last-mile network. The network consists of a fleet of homogeneous single-unit capacity robots, depots equipped with recharging stations, and customers. Each customers is defined by a time window and a profit. The goal is to find a set of tours that maximizes the total collected profit. These tours have to respect the customers' time windows and battery constraints of the robots. We present a branch-and-price algorithm to solve this combinatorial optimization problem exactly. Within this algorithm, the problem of finding feasible tours arises. To decide on the feasibility of a tour, we present a polynomial dynamic program and prove its correctness. The computational studies on modified benchmark instances show that the algorithm can solve instances that have realistic time window lengths and up to 144 customers in a reasonable time. |
Subject Headings: | branch-and-price team orienteering vehicle routing problem multiple depots partial recharging electric vehicle routing problem exact algorithm delivery robots dynamic program last-mile |
Subject Headings (RSWK): | Branch-and-Price-Methode Mehrdepotproblem Beladen Algorithmus Serviceroboter Mobiler Roboter Logistik City-Logistik |
URI: | http://hdl.handle.net/2003/40889 http://dx.doi.org/10.17877/DE290R-22746 |
Issue Date: | 2022-05-01 |
Appears in Collections: | Institut für Transportlogistik |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A Branch-and-Price Algorithm for Optimal Routing of Delivery Robots - Preprint.pdf | DNB | 679.18 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is protected by original copyright rightsstatements.org