An exact solution method for the TSP with Drone based on decomposition

Vásquez, S.; Angulo, Gustavo; Klapp, Mathias A.

doi:10.1016/j.cor.2020.105127

Cited by 55 publications

(17 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the truck goes on its way the drone or drones assist the delivery, helping the truck in the TSP tour. The review of such delivery systems and the variants of them can be found in [23,24,25,26,27,28] In our study, a single drone from a single static BS (depot) goes and serves the static boat requests. This is a classical TSP case.…”

Section: Related Workmentioning

confidence: 99%

Heuristic Drone Pathfinding Over Optimized Charging Station Grid

Kilic¹,

Mostarda²

2021

IEEE Access

View full text Add to dashboard Cite

We proposed a novel optimisation framework for drone-based operations which consists of the optimised Charging Station (CS) grid and the pathfinding heuristics for the drone. The proposed pathfinding heuristics are assessed for two different (triangular and square) CS grid configurations that are optimised for the drone range. We presented the case study of a boat rescue operation that is carried out in the sea. The minimisation of the "flight distance" and "number of chargings" are the objectives for the drone party and the minimisation of the "average waiting distance" (AWD) is the objective for the boat party. We studied the "single drone with many entities" case which is a form of Travelling Salesman Problem (TSP). We presented mathematical analysis and simulation results for the effectiveness of the pathfinding heuristic which we called the "red-grey path" heuristic. A novel and fast TSP heuristic was also proposed as part of the pathfinding heuristics and its performance was assessed.

show abstract

Section: Related Workmentioning

confidence: 99%

Heuristic Drone Pathfinding Over Optimized Charging Station Grid

Kilic¹,

Mostarda²

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…However, the range is independent from the speed. Many additional heuristic algorithms, e.g., [6,12,22,23,34], and exact approaches, e.g., [3,4,14,15,36,44], have been designed to solve these two basic problems or closely related variants. Currently, the best-known exact approach for a single tandem with one drone is a branch-and-price algorithm introduced in [36].…”

Section: Related Literaturementioning

confidence: 99%

“…Analogous to the general case, the energy consumption of operation (i, j, k) v is e v ijk , and the energy consumption of operation (i, j, k) s to reach the same point in time as operation (i, j, k) v can be determined with (43). Thus, operation (i, j, k) s is dominated by operation (i, j, k) v , if (44) is true.…”

Section: Elimination Of Operations With Faster Speedsmentioning

confidence: 99%

The vehicle routing problem with drones and drone speed selection

Tamke¹,

Buscher²

2021

Preprint

View full text Add to dashboard Cite

Joint parcel delivery by trucks and drones has enjoyed significant attention for some time, as the advantages of one delivery method offset the disadvantages of the other. This paper focuses on the vehicle routing problem with drones and drone speed selection (VRPD-DSS), which considers speed-dependent energy consumption and drone-charging in detail. For this purpose, we formulate a comprehensive mixed-integer problem that aims to minimize the operational costs consisting of fuel consumption costs of the trucks, labor costs for the drivers, and energy costs of the drones. The speed at which a drone performs a flight must be selected from a discrete set. We introduce preprocessing steps to eliminate dominated speeds for a flight to reduce the problem size and use valid inequalities to accelerate the solution process. The consideration of speed-dependent energy consumption leads to the fact that it is advisable to perform different flights at different speeds and not to consistently operate a drone at maximum speed. Instead, drone speed should be selected to balance drone range and speed of delivery. Our extensive computational study of a rural real-world setting shows that, by modeling energy consumption realistically, the savings in operational costs compared to truck-only delivery are significant but smaller than those identified in previously published work. Our analysis further reveals that the greatest savings stem from the fact that overall delivery time decreases compared to truck-only delivery, allowing costly truck-driver time to be reduced. The additional energy costs of the drone, however, are largely negligible.

show abstract

“…After in-depth research on the TSP, its solution methods have become more diverse. Many scholars have improved and integrated the existing intelligent optimisation algorithms for solving the TSP and designed more effective solution algorithms, including the discrete particle swarm optimisation algorithm [1], ant colony optimisation algorithm [2][3][4][5][6], two-stage genetic algorithm [7][8][9], discrete state-transition algorithm [10], mixed-integer linear programming and decomposition method [11][12], ordered greedy algorithm [13], two-stage local search algorithm [14], simulated annealing algorithm [15], bipartite graph neural network [16], and branch and bound method [17][18].…”

Section: Introductionmentioning

confidence: 99%

Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms

Xiao-xu

Song

et al. 2021

IEEE Access

View full text Add to dashboard Cite

The travelling salesman problem (TSP), as a typical combinatorial optimisation problem, can be used to describe a wide variety of practical engineering optimisation problems in various fields. In this study, the problem of personnel and equipment utilisation in the transportation industry was abstracted, a more general class of TSPs with replenishment arcs was proposed, an optimisation model to minimise the total travel time was established, the ant colony optimisation algorithm to solve the standard TSP was improved, and an improved ant colony algorithm based on dynamic heuristic information was designed. Simulation experiments showed that the algorithm can account for the cumulative mileage constraint and search for the shortest path, thus effectively solving the TSP with replenishment arcs. INDEX TERMSTravelling salesman problem, cumulative travel constraints, dynamic replenishment arc, improved ant colony algorithm.

show abstract

An exact solution method for the TSP with Drone based on decomposition

Cited by 55 publications

References 14 publications

Heuristic Drone Pathfinding Over Optimized Charging Station Grid

Heuristic Drone Pathfinding Over Optimized Charging Station Grid

The vehicle routing problem with drones and drone speed selection

Traveling Salesman Problems With Replenishment Arcs and Improved Ant Colony Algorithms

Contact Info

Product

Resources

About