The vehicle routing problem with drones: several worst-case results

By Xingyin Wang, Stefan Poikonen, Bruce L. Golden. Optimization Letters, 2016

504 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Building and Construction, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/7248b69423d46a014824abfefdd9cf5ba9584ab0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

In Building and Construction

In Industrial and Manufacturing Engineering

Citations in the corpus

On the Min-cost Traveling Salesman Problem with Drone (2015, methodology): “ Chu [12] in his master’s thesis to solve the 4 FSTSP, proposing an enhancement to the MILP model and solving the problem by a heuristic method based on Simulated Annealing. Additionally, Wang et al. [15], in a recent research, introduced a more 80 general problem that copes with multiple trucks and”
Coordinated Logistics with a Truck and a Drone (2018, background): “Even more recently, [42] describes “worst-case” configurations of input points that minimize the benefit that a UAV can offer in assisting a truck; their analysis further enables one to make “best-case” predictions as well, by establishing that the improvement offered by adding a UAV (or multiple UA”
The vehicle routing problem with drones: Extended models and connections (2017, methodology): “In [15], the drones and the trucks follow the same distance metric.”
Applications and Research avenues for drone-based models in logistics: A classification and review (2021, methodology): “The remaining approaches are theoretical analysis to analyze the maximum possible savings by these drone-based delivery models compared to truck-only delivery models (Wang et al., 2017; Othman et al., 2017; MoshrefJavadi et al., 2020), approximation algorithms using continuous approximation methods ”
Optimization Approaches for the Traveling Salesman Problem with Drone (2016, background): “Wang et al. [2016] derive a number of worst-case results for the vehicle routing problem with drones, in which a ﬂeet of trucks equipped with drones delivers packages to customers.”
Dynamic programming approaches for the traveling salesman problem with drone (2017, unknown): “Wang et al. (2016) and Poikonen et al. (2017) analyze the theoretical beneﬁts of using one or more drones together with one or more delivery vehicles to make deliveries.”
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey (2018, background): “The limited capacity of the energy unit is usually modeled as maximal operation time [274, 292], maximal flying distance [104, 244], or the limited number of addresses a drone can visit during one flight [75, 237].”