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

The traveling salesman problem with release dates and drone resupply

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(16 citation statements)
references
References 18 publications
0
16
0
Order By: Relevance
“…Moreover, effective algorithms including quadratic heuristic clustering algorithm [22], local search algorithm [23], multi-child genetic algorithm [24], variable neighborhood search [25], and branch and cut algorithm [26,27] to solve the problem are designed to solve the problem. However, due to the specificality of constraints on the TSP in different research contexts, some researchers have introduced effective strategies such as discretization scheme and two-stage greedy initialization algorithm based on traditional algorithms to further improve search performance of these algorithms [28][29][30][31][32][33].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Moreover, effective algorithms including quadratic heuristic clustering algorithm [22], local search algorithm [23], multi-child genetic algorithm [24], variable neighborhood search [25], and branch and cut algorithm [26,27] to solve the problem are designed to solve the problem. However, due to the specificality of constraints on the TSP in different research contexts, some researchers have introduced effective strategies such as discretization scheme and two-stage greedy initialization algorithm based on traditional algorithms to further improve search performance of these algorithms [28][29][30][31][32][33].…”
Section: Literature Reviewmentioning
confidence: 99%
“…Pina-Pardo et al [100] propose the traveling salesman problem with release dates and drone resupply (TSPRD-DR), which aims to find the minimum time route for a single truck that is resupplied by a drone while enroute to fulfill customers' orders. The orders and their associated information are known at the beginning of the day, but they may not be ready to ship.…”
Section: ) Htdds With Drone Resupply Operationsmentioning
confidence: 99%
“…Dayarian et al [101] present the vehicle routing problem with drone resupply (VRPDR), which considers a fleet of vehicles and a fleet of drones assisting each other to perform home deliveries. Similar to Pina-Pardo et al [100], drones are used to resupply the truck, but unknown orders arrive dynamically throughout the day. While the truck is stationary, the resupply operation takes place, and two associated strategies are considered: restricted resupply and flexible resupply.…”
Section: ) Htdds With Drone Resupply Operationsmentioning
confidence: 99%
See 1 more Smart Citation
“…Ha et al (2018) considered a new variant of the TSP-D in which the objective is to minimize operational costs that include the total transportation cost as well as the cost associated with the wasted time during which a vehicle has to wait for another [33]. Pina-Pardo et al ( 2021) introduced the so-called TSP with release dates and drone resupply [34]. This is a problem consisting of finding a minimum time route for a single truck that can receive newly available orders en route via a drone sent from the depot.…”
Section: Delivery By Dronementioning
confidence: 99%