Please use this identifier to cite or link to this item:

http://hdl.handle.net/10609/99607
Title: The team orienteering problem with stochastic service times and driving-range limitations: A simheuristic approach
Author: Reyes Rubiano, Lorena Silvana
Ospina Trujillo, Carlos F.
Faulin Fajardo, Francisco Javier
Mozos, Jose M.
Panadero Martínez, Javier  
Juan Pérez, Ángel Alejandro
Issue Date: 31-Jan-2019
Publisher: Winter Simulation Conference (WSC). Proceedings
Citation: Reyes-Rubiano, L., Ospina-Trujillo, C. F., Faulín, F., Mozos, J.M., Panadero, J. & Juan, A.A. (2019). The team orienteering problem with stochastic service times and driving-range limitations: A simheuristic approach. Winter Simulation Conference (WSC). Proceedings, 2018(Dec.), 3025-3035. doi: 10.1109/WSC.2018.8632400
Also see: https://www.informs-sim.org/wsc18papers/includes/files/266.pdf
Abstract: In the context of smart cities, unmanned aerial vehicles (UAVs) offer an alternative way of gathering data and delivering products. On the one hand, in congested urban areas UAVs might represent a faster way of performing some operations than employing road vehicles. On the other hand, they are constrained by driving-range limitations. This paper copes with a version of the well-known Team Orienteering Problem in which a fleet of UAVs has to visit a series of customers. We assume that the rewarding quantity that each UAV receives by visiting a customer is a random variable, and that the service time at each customer depends on the collected reward. The goal is to find the optimal set of customers that must be visited by each UAV without violating the driving-range constraint. A simheuristic algorithm is proposed as a solving approach, which is then validated via a series of computational experiments.
Language: English
URI: http://hdl.handle.net/10609/99607
ISSN: 0891-7736MIAR
Appears in Collections:Articles

Share:
Export:
Files in This Item:
File SizeFormat 
team_oriented.pdf465.84 kBAdobe PDFView/Open Request a copy

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.