2019
DOI: 10.1080/01605682.2019.1671156
|View full text |Cite
|
Sign up to set email alerts
|

Parcel delivery by vehicle and drone

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(30 citation statements)
references
References 13 publications
0
30
0
Order By: Relevance
“…Importantly, with the move towards logistics, other questions are being raised, including how to optimise delivery strategies (e.g. El-Adle et al, 2019 ). Initial analysis indicates combined truck and drone delivery systems are a more efficient method of logistics delivery systems than current approaches ( Ferrandez et al, 2016 ; Chung, 2018 ; Carlsson and Song, 2017 ; Liu et al, 2018 ), Wang et al (2019) .…”
Section: Resultsmentioning
confidence: 99%
“…Importantly, with the move towards logistics, other questions are being raised, including how to optimise delivery strategies (e.g. El-Adle et al, 2019 ). Initial analysis indicates combined truck and drone delivery systems are a more efficient method of logistics delivery systems than current approaches ( Ferrandez et al, 2016 ; Chung, 2018 ; Carlsson and Song, 2017 ; Liu et al, 2018 ), Wang et al (2019) .…”
Section: Resultsmentioning
confidence: 99%
“…[7] derive several benchmark results for the instances of [1] for different drone settings including loops, however, multiple drones are missing. [19] and [20] present a two-indexed formulation of a TSPD. While [19] additionally introduce an exact branch-and-price approach, [20] accelerate the solver by adding upper and lower bounds by, e.g., starting with an initial solution that is generated by a greedy insertion heuristic, and additionally assess the data in a pre-processing step to reduce the number of possible drone arcs.…”
Section: Sidekicks and Loopsmentioning
confidence: 99%
“…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%