Scholarlink

Abstract <p>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, <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\rho \)</EquationSource> <EquationSource Format="MATHML"><math> <mi>ρ</mi> </math></EquationSource> </InlineEquation>-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.</p> Graphic abstract <p></p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Launching drones from a vessel: routing unmanned aerial vehicles from a linearly moving depot

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年7月30日

查看全文
  • Nils Boysen,
  • Helmut Sedding

摘要

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