A Sim-Learnheuristic for the Team Orienteering Problem: Applications to Unmanned Aerial Vehicles

In this paper, we introduce a novel sim-learnheuristic method designed to address the team orienteering problem (TOP) with a particular focus on its application in the context of unmanned aerial vehicles (UAVs). Unlike most prior research, which primarily focuses on the deterministic and stochastic...

Full description

Saved in:
Bibliographic Details
Published inAlgorithms Vol. 17; no. 5; p. 200
Main Authors Peyman, Mohammad, Martin, Xabier A., Panadero, Javier, Juan, Angel A.
Format Journal Article
LanguageEnglish
Published Basel MDPI AG 01.05.2024
Subjects
Online AccessGet full text
ISSN1999-4893
1999-4893
DOI10.3390/a17050200

Cover

Loading…
More Information
Summary:In this paper, we introduce a novel sim-learnheuristic method designed to address the team orienteering problem (TOP) with a particular focus on its application in the context of unmanned aerial vehicles (UAVs). Unlike most prior research, which primarily focuses on the deterministic and stochastic versions of the TOP, our approach considers a hybrid scenario, which combines deterministic, stochastic, and dynamic characteristics. The TOP involves visiting a set of customers using a team of vehicles to maximize the total collected reward. However, this hybrid version becomes notably complex due to the presence of uncertain travel times with dynamically changing factors. Some travel times are stochastic, while others are subject to dynamic factors such as weather conditions and traffic congestion. Our novel approach combines a savings-based heuristic algorithm, Monte Carlo simulations, and a multiple regression model. This integration incorporates the stochastic and dynamic nature of travel times, considering various dynamic conditions, and generates high-quality solutions in short computational times for the presented problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a17050200