A hybrid genetic algorithm for the traveling salesman problem with drone

Ha, Quang Minh; Deville, Yves; Pham, Quang Dung; Hà, Minh Hoàng

doi:10.1007/s10732-019-09431-y

Cited by 140 publications

(104 citation statements)

References 15 publications

Supporting

Mentioning

103

Contrasting

Unclassified

Order By: Relevance

“…Instances with up to 20 customers are solved. Ha et al [32] also use the name TSP-D, albeit in this case nodes cannot be visited multiple times and launch and rendezvous of a sortie are not allowed to happen at the same vertex. The authors declare that the considered problem shared the FSTSP characteristics, but they called it TSP-D. To highlight the difference between the two problems we call this problem TSP-D*.…”

Section: Related Literaturementioning

confidence: 99%

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

2019

View full text Add to dashboard Cite

In this paper we consider a problem related to deliveries assisted by an unmanned aerial vehicle, so-called drone. In particular we consider the Flying Sidekick Traveling Salesman Problem, where a truck and a drone cooperate to delivery parcels to customers minimizing the completion time. In the following we improve the formulation found in the related literature. We propose three-indexed and two-indexed formulations and a set of inequalities that can be implemented in a branch-and-cut fashion. We could find the optimal solutions for most of the literature instances. Moreover, we consider two versions of the problem: one in which the drone is allowed to wait at the customers, as in the literature, and one where waiting is allowed only in flying mode. The solving methodologies are adapted to both versions. A comparison between the two versions is provided.

show abstract

Section: Related Literaturementioning

confidence: 99%

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

2019

View full text Add to dashboard Cite

show abstract

“…The authors of Reference [21] introduced a new Hybrid Genetic Algorithm (HGA) with adaptive diversity control to effectively solve the TSP-D under both min-cost and min-time objectives. HGA is a combination of the genetic algorithm and local search technique together with a population management, diversity control and a penalization mechanism to balance the search between feasible and unfeasible search spaces.…”

Section: Delivery By 1-truck 1-dronementioning

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

124

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

“…There are also some researches about Traveling Salesman Problem with Drone (TSP-D), such as Agatz et.al [5] and Ha et.al [6,7]. In their problems, the cooperated system of GV and UAV is applied on the city logistics.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Ha et.al [6] Ha et.al [7] Dorling et.al [9] multi-circulation 1-segment Wang et.al [10] Murray and Chu [4] 1-circulation 1-segment "polygon routes"…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Cooperated Routing Problem for Ground Vehicle and Unmanned Aerial Vehicle: The Application on Intelligence, Surveillance and Reconnaissance Missions

Liu¹,

Luo²,

Liu³

et al. 2019

Preprint

View full text Add to dashboard Cite

In this paper, we present a novel Two-Echelon Ground Vehicle and Its Mounted Unmanned Aerial Vehicle Cooperated Routing Problem (2E-GUCRP). The 2E-GUCRP arises in the field of Unmanned Aerial Vehicle (UAV) Routing Problem such as those encountered in the context of city logistics. In a typical cooperated system, the UAV is launched from the Ground Vehicle (GV) and automatically flies to the designated target. Meanwhile, acting as a mobile base station, the GV can charge or change the UAV’s battery on the designated landing points to enable the UAV to continue its mission. The objective is to design efficient GV and UAV routes to minimize the total mission time while meeting the operational constraints. A Mixed Integer Programming (MIP) model, which could be solved by commercial software, is constructed to describe this problem. In order to quickly solve the medium-scale problems, two existing heuristics to solve 2E-VRP are improved. The computational experiments are set up to compare our model with the 2E-VRP. The results indicate that the 2E-GUCRP obtains a better efficiency. Further discussion of the practical instance points out that the increase in efficiency is related to the speed relationship between the GV and the UAV.

show abstract

A hybrid genetic algorithm for the traveling salesman problem with drone

Cited by 140 publications

References 15 publications

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem

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

Cooperated Routing Problem for Ground Vehicle and Unmanned Aerial Vehicle: The Application on Intelligence, Surveillance and Reconnaissance Missions

Contact Info

Product

Resources

About