2021
DOI: 10.1016/j.trc.2020.102913
|View full text |Cite
|
Sign up to set email alerts
|

A column-and-row generation approach for the flying sidekick travelling salesman problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 65 publications
(35 citation statements)
references
References 27 publications
0
30
0
Order By: Relevance
“…The authors proposed a Mixed Integer Linear Programming (MILP) formulation for the FSTSP and a heuristic since only instances with up to 10 customers can be solved to optimality within a reasonable amount of time. Since this first work on the FSTSP, many contributions have been proposed in the literature to solve it [3,12,13,16,28,33], to cite only a few. A small number of FSTSP instances with up to 39 customers have been optimally solved while heuristic approaches are able to tackle instances with up to 229 customers.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…The authors proposed a Mixed Integer Linear Programming (MILP) formulation for the FSTSP and a heuristic since only instances with up to 10 customers can be solved to optimality within a reasonable amount of time. Since this first work on the FSTSP, many contributions have been proposed in the literature to solve it [3,12,13,16,28,33], to cite only a few. A small number of FSTSP instances with up to 39 customers have been optimally solved while heuristic approaches are able to tackle instances with up to 229 customers.…”
Section: Literature Reviewmentioning
confidence: 99%
“…FIGURE 3 An example of the lower bound solution exactly account for (iii), the time spent waiting for the drone since its solution does not provide the launch and rendezvous locations of each sortie. However, in the case where drone speed is very high relative to truck speed, the time spent by the truck waiting for the drone may in fact be very small.…”
Section: Lower Bound For Mvdrp-elmentioning
confidence: 99%
“…Furthermore, the drone is allowed to fly between customers, while the truck should travel along with the road network. The problem is also addressed by [54][55][56][57][58][59][60][61], which employed different solution methods. The FSTSP has been extended in different ways.…”
Section: ) Collaborative Htdds Operations With Truck and Drone Deliverymentioning
confidence: 99%
“…Thus, for the two vehicles, it is feasible to consider a separate road network, where the truck has its own road network, representing the potential locations for launching and collecting the drone. • Truck and drone distances are calculated using the Euclidean metric [60,61,67,69,76,84,85,87,90,92,99,103,115,117,118,131,137]. In this case, both vehicles are assumed to travel in a straight line, without following any road network.…”
Section: ) Model Assumptions and Parametersmentioning
confidence: 99%
“…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%