Pickup and delivery problems with autonomous vehicles on rings - Archive ouverte HAL Access content directly
Journal Articles European Journal of Operational Research Year : 2021

Pickup and delivery problems with autonomous vehicles on rings


In this paper we introduce a new class of Pickup and Delivery problems on circles (or rings). These problems arise in the field of public transportation systems where autonomous (i.e. driverless) vehicles travel on circular networks. We consider a set of stations arranged in a circle and a set of transportation requests. Each request asks for the transportation of a certain quantity from a pickup station to a delivery station. A fleet of capacitated vehicles is available at the depot. In the first part of the paper we propose a classification scheme for these problems. In the second part, we address the variants in which the vehicles are allowed to move in a single direction of the circle (either clockwise or counterclockwise) and the objective is to minimize the number of tours on the ring while serving all the requests. We provide a complexity analysis for this class of problems. We develop polynomial time algorithms for the variants that are polynomially solvable and proofs of NP-hardness for the variants that are NP-hard. In addition, for the latter, we provide mathematical formulations and perform computational tests that show the effectiveness of these formulations. Finally, we compare optimal solutions with those obtained using a straightforward greedy algorithm.
Fichier principal
Vignette du fichier
WP EMSE CMP-SFL 2021-2.pdf (584.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03136655 , version 1 (09-02-2021)



Manuel Trotta, Claudia Archetti, Dominique Feillet, Alain Quilliot. Pickup and delivery problems with autonomous vehicles on rings. European Journal of Operational Research, In press, ⟨10.1016/j.ejor.2021.07.050⟩. ⟨hal-03136655⟩
577 View
288 Download



Gmail Facebook Twitter LinkedIn More