An iterative two‐step heuristic for the parallel drone scheduling traveling salesman problem

Saleu, Raïssa G. Mbiadou; Deroussi, Laurent; Feillet, Dominique; Grangeon, Nathalie; Quilliot, Alain

doi:10.1002/net.21846

Cited by 84 publications

(20 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of Reference [23] proposed solving the problem of PDSTSP, introduced in Reference [20], with an original iterative two-step heuristic, composed of: a coding step that transforms a solution into a customer sequence and a decoding step that decomposes the customer sequence into a tour for the vehicle and series of trips for the drone(s). The authors conducted experiments on benchmark instances from the literature and they confirmed the efficiency of their approach.…”

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

125

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

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

125

View full text Add to dashboard Cite

show abstract

“…The formulated the problem mathematically and two algorithms including from TSP with local search (TSP-LS) and Greedy Randomized Adaptive Search Procedure (GRASP), is based on a new split procedure that optimally splits any TSP tour into a TSP-D solution, which sequentially improved through local search operators are used at the solution stage. Saleu et al (2018) proposed a heuristic solution of the parallel drone scheduling traveling salesman problem, which aims to minimize completion time. They proposed an iterative two-step heuristic, composed of: a coding step that transforms a solution into a customer sequence, and a decoding step that decomposes the customer sequence into a tour for the vehicle and trips for the drones.…”

Section: Introductionmentioning

confidence: 99%

Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem

Özoğlu¹,

Çakmak²,

Koç³

2019

European Journal of Science and Technology

View full text Add to dashboard Cite

Over the past few years, drones also known as unmanned aerial vehicles (UAV), have been adopted as a part of transportation activities in logistic sector. This paper investigates a new version of traveling salesman problem called as flying sidekick traveling salesman problem(FSTSP) in which trucks and drones serve the customers in coordination with the objective of minimizing the total delivery distance of trucks at the depot after completing the deliveries. Clarke & Wright's savings algorithm is a well-known heuristics approach in literature, which gives better solution for classical vehicle routing problem. In this paper, a hybrid approach based on Clarke & Wright's savings algorithm and genetic algorithm is proposed for solving the new version of travelling salesman problem. In the proposed hybrid algorithm, which is the sequential use of genetic algorithm and Clarke & Wright's savings algorithm, is used for assignment of the truck, drone or both of them to serve the customer. The solution of the genetic algorithm, which is the well-known metaheuristic approach, is enhanced with Clarke & Wright's savings algorithm. The aim of the problem is to minimize the total delivery distance according to the assignment decisions. This is the first hybrid approach in the literature including Clarke & Wright's savings algorithm and genetic algorithm that applies for FSTSP problem. The hypothetical experiments conducted on various instances and results confirm the efficiency of the approach and give some insights on this drone delivery system.

show abstract

“…Additionally, Mbiadou et al. (2018) designed an iterative two‐step heuristic to solve the PDSTSP problem as well. On the other hand, Schermer et al.…”

Section: Classificationmentioning

confidence: 99%

“…Some further adaptations and studies are carried out by Mbiadou et al. (2018), Ulmer and Thomas (2018), Ham (2018), and Oruc and Kara (2018).…”

Section: Classificationmentioning

confidence: 99%

Unmanned aerial vehicles/drones in vehicle routing problems: a literature review

Viloria

Solano-Charris

Muñoz-Villamizar

et al. 2020

Int Trans Operational Res

191

View full text Add to dashboard Cite

During recent years, advances in drone technologies have made them applicable in various fields of industry, and their popularity continues to grow. In this paper, the academic contributions on drones routing problems are analyzed between 2005 and 2019 to identify the main characteristics of these types of problems, as well as the research trends and recent improvements. The literature is classified according to the objectives optimized, solution methods, applications, constraints, and whether they use a complementary vehicle or not. Finally, a discussion for trends and future research is presented.

show abstract

An iterative two‐step heuristic for the parallel drone scheduling traveling salesman problem

Cited by 84 publications

References 18 publications

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

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

Clarke & Wright's Savings Algorithm and Genetic Algorithms Based Hybrid Approach for Flying Sidekick Traveling Salesman Problem

Unmanned aerial vehicles/drones in vehicle routing problems: a literature review

Contact Info

Product

Resources

About