Metraipolis › archive › dc_706146aafd08
Drive, Pack, Fly: The Travelling Thief Problem with Drone — arXiv:2608.16435
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.16435
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T17:44:46.575Z
- SHA-256 of the archived text
d68098fb542f66f6bd7679ad37e9df28032a7da308f171d159ce42b6bd30e343- Stable URL of this page
https://metraipolis.com/documento/dc_706146aafd08
How to cite
Drive, Pack, Fly: The Travelling Thief Problem with Drone — arXiv:2608.16435 — arXiv (en), https://arxiv.org/abs/2608.16435 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_706146aafd08 (Metraipolis archive dc_706146aafd08, sha256 d68098fb542f66f6bd7679ad37e9df28032a7da308f171d159ce42b6bd30e343)
BibTeX
@misc{dc706146aafd08,
title = {Drive, Pack, Fly: The Travelling Thief Problem with Drone — arXiv:2608.16435},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.16435},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_706146aafd08; sha256 d68098fb542f66f6bd7679ad37e9df28032a7da308f171d159ce42b6bd30e343},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.16435. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In collection operations, accumulating payload progressively slows the vehicle, imposing a cumulative penalty on routing efficiency. An onboard drone can offset this penalty by retrieving outlying items, thereby shortening the makespan and increasing operational profit. However, travel time remains load-dependent, and each item collected by the ground vehicle shifts the arrival times that govern the drone's launch and rendezvous points. This paper introduces the Travelling Thief Problem with Drone (TTP-D), which maximises the collected profit, net of a time-based rental cost, by jointly optimising item selection, vehicle routing, and flight synchronisation. We formulate a mixed-integer linear program that solves small instances to optimality, and develop both metaheuristics and an attention-based Deep Reinforcement Learning (DRL) policy for larger instances. We further propose a learner-initialised hybrid solver, in which the DRL policy constructs an initial solution that a short annealing run subsequently refines. On two benchmark sets, this hybrid recovers most of the metaheuristic baseline's quality at a fraction of its computational budget, although the largest instances still require the baseline at its full budget. Finally, a sensitivity analysis reveals that the rental ratio is the primary driver of profitability, whereas the fleet parameters affect profit only at the margin. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Neural and Evolutionary Computing (cs.NE); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2608.16435 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T16:29:13.870Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).