2020 Winter Simulation Conference (WSC) 2020
DOI: 10.1109/wsc48552.2020.9383923
|View full text |Cite
|
Sign up to set email alerts
|

An Agile Simheuristic for the Stochastic Team Task Assignment and Orienteering Problem: Applications to Unmanned Aerial Vehicles

Abstract: Efficient coordination of unmanned aerial vehicles (UAVs) requires the solving of challenging operational problems. One of them is the integrated team task assignment and orienteering problem (TAOP). The TAOP can be seen as an extension of the well-known team orienteering problem (TOP). In the classical TOP, a homogeneous fleet of UAVs has to select and visit a subset of customers in order to maximize, subject to a maximum travel time per route, the total reward obtained from these visits. In the TAOP, a numbe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 38 publications
0
3
0
Order By: Relevance
“…Firstly, an initial solution is obtained through the BR-CWS (Algorithm 2 and line 2 in Algorithm 1). The savings list is created for each edge not connected with the depot, however, since each BH customer has a penalty cost for not being served, the traditional way to calculate such savings (s ij = c i0 + c 0j − c ij ) is replaced with the expression in Equation ( 21) (Panadero et al, 2018) only for those edges whose both nodes are backhaul. 2018) affirm that its concrete value only depends on "the heterogeneity of the customers in terms of rewards", i.e, the higher the heterogeneity, the closer to 0 α should be.…”
Section: Solving Small-scale Instances With Exact Methodsmentioning
confidence: 99%
“…Firstly, an initial solution is obtained through the BR-CWS (Algorithm 2 and line 2 in Algorithm 1). The savings list is created for each edge not connected with the depot, however, since each BH customer has a penalty cost for not being served, the traditional way to calculate such savings (s ij = c i0 + c 0j − c ij ) is replaced with the expression in Equation ( 21) (Panadero et al, 2018) only for those edges whose both nodes are backhaul. 2018) affirm that its concrete value only depends on "the heterogeneity of the customers in terms of rewards", i.e, the higher the heterogeneity, the closer to 0 α should be.…”
Section: Solving Small-scale Instances With Exact Methodsmentioning
confidence: 99%
“…In their work, Panadero et al [89] explored the increasing use of UAVs across various fields like smart cities, logistics in urban areas, humanitarian aid, response to natural disasters, and military operations. They focused on one particular challenge: optimizing UAV operations in scenarios where travel times are unpredictable.…”
Section: Agile E-routingmentioning
confidence: 99%
“…In (Das et al, 2018) an optimization algorithm is proposed for the number of UAVs for tracking multiple mobile targets. The Team Orienting Problem (TOP) is applied to drones in (Panadero et al, 2018), as a range of limitations need to be taken into account when optimizing their operations and management. A methodology to maximize the persistent coverage of a given terrain is described in (Bogdanowicz, 2018) and while it is focused on military applications, the same concept could be applied for transportation purposes.…”
Section: Uas Operations In a 'Smart City'mentioning
confidence: 99%