Abstract Unmanned aerial vehicles (or drones) are expected to free urban areas from the negative impacts of traditional last-mile delivery by trucks and vans. To overcome one of the major operational challenges of drones, their limited range, existing concepts propose to launch them either from decentralized depots or trucks moving through the city center. Both solutions have drawbacks, so recent ideas suggest using river barges as mobile launch platforms. These ships act as linearly moving depots for drone launches, and this paper investigates the resulting routing problem when serving a given set of customers. First, we formulate the basic optimization problem and derive some structural properties through an in-depth computational complexity analysis. Based on these insights, we derive appropriate methods to attain exact, $$\rho $$ ρ -approximative, or heuristic solutions, and apply them to evaluate the potential savings of delivery vans (benchmarked as a standalone delivery option and as a van-drone tandem) if, instead, drones are launched from ships or trains. Graphic abstract
Boysen, Nils, Sedding, Helmut. Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot. // Journal of Scheduling. – 2026. – DOI: 10.1007/s10951-026-00879-y. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00879-y
Boysen, Nils, Sedding, & Helmut (2026). Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot. Journal of Scheduling. https://doi.org/10.1007/s10951-026-00879-y
Boysen, et al. “Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot.” Journal of Scheduling, 2026. doi:10.1007/s10951-026-00879-y.
@article{Boysen2026,
title = {Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot},
author = {Boysen and Nils and Sedding and Helmut},
journal = {Journal of Scheduling},
year = {2026},
doi = {10.1007/s10951-026-00879-y},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10951-026-00879-y}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...