Traveling Salesman Problem with Multiple Drones

Tú, Phan Anh; Dat, Nguyen Van; Dung, Pham Tien

doi:10.1145/3287921.3287932

Cited by 52 publications

(20 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An MILP formulation is provided, which is tested on instances with up to 10 customers. Tu et al (2018) propose an adaptive large neighborhood search heuristic for a similar problem, the TSP with multiple drones (TSP-mD).…”

Section: Related Literaturementioning

confidence: 99%

The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones

Murray

Raj

2019

SSRN Journal

View full text Add to dashboard Cite

Section: Related Literaturementioning

confidence: 99%

The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones

Murray

Raj

2019

SSRN Journal

View full text Add to dashboard Cite

“…The study in Reference [24] proposes an extension of the TSP-D problem in which a truck travels with m (m > 1) drones (called TSP-mD) instead of one drone in TSP-D. The authors adapted the greedy randomized adaptive search procedure (GRASP) proposed in Reference [19] and proposed an Adaptive Large Neighborhood Search (ALNS) heuristic to the resolution of this problem.…”

Section: Delivery By 1-truck and M-dronesmentioning

confidence: 99%

A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles

Khoufi

Laouiti

Adjih

2019

Drones

117

View full text Add to dashboard Cite

The use of Unmanned Aerial Vehicles (UAVs) is rapidly growing in popularity. Initially introduced for military purposes, over the past few years, UAVs and related technologies have successfully transitioned to a whole new range of civilian applications such as delivery, logistics, surveillance, entertainment, and so forth. They have opened new possibilities such as allowing operation in otherwise difficult or hazardous areas, for instance. For all applications, one foremost concern is the selection of the paths and trajectories of UAVs, and at the same time, UAVs control comes with many challenges, as they have limited energy, limited load capacity and are vulnerable to difficult weather conditions. Generally, efficiently operating a drone can be mathematically formalized as a path optimization problem under some constraints. This shares some commonalities with similar problems that have been extensively studied in the context of urban vehicles and it is only natural that the recent literature has extended the latter to fit aerial vehicle constraints. The knowledge of such problems, their formulation, the resolution methods proposed—through the variants induced specifically by UAVs features—are of interest for practitioners for any UAV application. Hence, in this study, we propose a review of existing literature devoted to such UAV path optimization problems, focusing specifically on the sub-class of problems that consider the mobility on a macroscopic scale. These are related to the two existing general classic ones—the Traveling Salesman Problem and the Vehicle Routing Problem. We analyze the recent literature that adapted the problems to the UAV context, provide an extensive classification and taxonomy of their problems and their formulation and also give a synthetic overview of the resolution techniques, performance metrics and obtained numerical results.

show abstract

“…Phan et al [40] solve the traveling salesman problem with multiple drones , a problem in which one truck is equipped with multiple drones that must serve all the customers in order to minimize the transportation costs of both the truck and the drones. Each node must be visited once and the drones cannot return to their launching point.…”

Section: Related Literaturementioning

confidence: 99%

“…The second variant that we investigate allows the drones to wait on the ground to save energy. This variant has already been considered in the literature (see, e.g., Phan et al [40]) and also for the single drone case (see, e.g., Ponza [32] and Dell'Amico et al [12]). In Figure 13, we provide an example.…”

Section: Other Variants Of the Original Modelmentioning

confidence: 99%

Modeling the flying sidekick traveling salesman problem with multiple drones

2021

View full text Add to dashboard Cite

This article considers a version of the flying sidekick traveling salesman problem in which parcels are delivered to customers by either a truck or a set of identical flying drones. The flights of the drones are limited by the battery endurance and each flight is made of a launch, a service to a customer, and a return: launch and return must happen when the truck is stationary. These operations require time and when multiple drones are launched and/or collected at the same node, their order becomes relevant. The proposed model takes into account the order of these operations as a scheduling problem, because ignoring it could lead to infeasible solutions in the reality due to the possible exceeding of the drones endurance. We propose a set of novel formulations for the problem that can improve the size of the largest instances solved in the literature. We provide a comparison among the formulations, between the multiple drones solutions and the single drone ones, and among different variants of the model.

show abstract

Traveling Salesman Problem with Multiple Drones

Cited by 52 publications

References 11 publications

The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones

The Multiple Flying Sidekicks Traveling Salesman Problem: Parcel Delivery with Multiple Drones

A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles

Modeling the flying sidekick traveling salesman problem with multiple drones

Contact Info

Product

Resources

About