PFaRA: a Platoon Forming and Routing Algorithm for Same-Day Deliveries
S\^inziana-Maria Sebe, J\"org P. M\"uller

TL;DR
This paper introduces PFaRA, a novel algorithm for forming and routing heterogeneous platoons of autonomous electric delivery vehicles in urban environments, improving utility for service providers.
Contribution
The paper presents PFaRA, a new platoon forming and routing algorithm that accounts for vehicle heterogeneity and preferences, enhancing urban delivery efficiency.
Findings
PFaRA achieves comparable routing performance to simple route-matching methods.
The algorithm improves utility values for vehicles and logistics service providers.
Platoons formed are viable and beneficial for all participating vehicles.
Abstract
Platoons, vehicles that travel very close together acting as one, promise to improve road usage on freeways and city roads alike. We study platoon formation in the context of same-day delivery in urban environments. Multiple self-interested logistic service providers (LSP) carry out same-day deliveries by deploying autonomous electric vehicles that are capable of forming and traveling in platoons. The novel aspect that we consider in our research is heterogeneity of platoons in the sense that vehicles are equipped with different capabilities and constraints, and belong to different providers. Our aim is to examine how these platoons can form and their potential properties and benefits. We present a platoon forming and routing algorithm, called PFaRA, that finds longest common routes for multiple vehicles, while also respecting vehicle preferences and constraints. PFaRA consists of two…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
