Algorithms for Routing an Unmanned Aerial Vehicle in the Presence of Refueling Depots
TLDR
In this article, a single UAV routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot is considered, and an approximation algorithm for the problem is developed.Abstract:
We consider a single Unmanned Aerial Vehicle (UAV) routing problem where there are multiple depots and the vehicle is allowed to refuel at any depot. The objective of the problem is to find a path for the UAV such that each target is visited at least once by the vehicle, the fuel constraint is never violated along the path for the UAV, and the total fuel required by the UAV is a minimum. We develop an approximation algorithm for the problem, and propose fast construction and improvement heuristics to solve the same. Computational results show that solutions whose costs are on an average within 1.4% of the optimum can be obtained relatively fast for the problem involving five depots and 25 targets.read more
Citations
More filters
Journal ArticleDOI
Vehicle Routing Problems for Drone Delivery
TL;DR: In this paper, the authors propose two multi-trip vehicle routing problems (VRPs) specifically for drone delivery scenarios, one minimizes costs subject to a delivery time limit, while the other minimizes the overall delivery time subject to budget constraint.
Journal ArticleDOI
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey
TL;DR: This article describes the most promising aerial drone applications and outline characteristics of aerial drones relevant to operations planning, and provides insights into widespread and emerging modeling approaches to civil applications of UAVs.
Journal ArticleDOI
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams
TL;DR: This paper addresses the task scheduling and path planning problem for a team of cooperating vehicles performing autonomous deliveries in urban environments and proposes two additional algorithms, based on enumeration and a reduction to the traveling salesman problem, for this special case.
Journal ArticleDOI
A drone fleet model for last-mile distribution in disaster relief operations
TL;DR: In this article, the authors considered drone applications in last-mile distribution in humanitarian logistics and presented an optimization model for the delivery of multiple packages of light-weight relief items (e.g. vaccine, water purification tablets, etc.) via drones to a certain number of remote locations within a disaster prone area.
Journal ArticleDOI
Impact of drone delivery on sustainability and cost: Realizing the UAV potential through vehicle routing optimization
TL;DR: A mixed-integer (0–1 linear) green routing model for UAV is proposed to exploit the sustainability aspects of the use of UAVs for last-mile parcel deliveries and it is found that optimally routing and delivering packages with Uavs would save energy and reduce carbon emissions.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Journal ArticleDOI
On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents
Journal ArticleDOI
The multi-depot vehicle routing problem with inter-depot routes
TL;DR: A heuristic combining the adaptative memory principle, a tabu search method for the solution of subproblems, and integer programming is proposed, which indicates the validity of the technique to MDVRPI.
Journal ArticleDOI
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
TL;DR: This work considers the asymmetric traveling salesman problem for which the triangular inequality is satisfied, and constructs examples to show that the worst-case ratio of length of tour found to minimum length tour is (n) for n city problems.
Related Papers (5)
The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery
Chase C. Murray,Amanda G. Chu +1 more