{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:54:01Z","timestamp":1760648041079,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T00:00:00Z","timestamp":1715126400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Spanish Ministry of Science and Innovation","award":["PRE2020-091842","PID2022-138860NB-I00","RED2022-134703-T","HORIZON-CL4-2022-HUMAN-01-14-101092612"],"award-info":[{"award-number":["PRE2020-091842","PID2022-138860NB-I00","RED2022-134703-T","HORIZON-CL4-2022-HUMAN-01-14-101092612"]}]},{"name":"Horizon Europe program","award":["PRE2020-091842","PID2022-138860NB-I00","RED2022-134703-T","HORIZON-CL4-2022-HUMAN-01-14-101092612"],"award-info":[{"award-number":["PRE2020-091842","PID2022-138860NB-I00","RED2022-134703-T","HORIZON-CL4-2022-HUMAN-01-14-101092612"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/a17050200","type":"journal-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T09:58:56Z","timestamp":1715162336000},"page":"200","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Sim-Learnheuristic for the Team Orienteering Problem: Applications to Unmanned Aerial Vehicles"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4734-2414","authenticated-orcid":false,"given":"Mohammad","family":"Peyman","sequence":"first","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, Plaza Ferrandiz-Salvador, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4182-0120","authenticated-orcid":false,"given":"Xabier A.","family":"Martin","sequence":"additional","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, Plaza Ferrandiz-Salvador, 03801 Alcoy, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3793-3328","authenticated-orcid":false,"given":"Javier","family":"Panadero","sequence":"additional","affiliation":[{"name":"Department of Computer Architecture & Operating Systems, Universitat Aut\u00f2noma de Barcelona, Carrer de les Sitges, 08193 Bellaterra, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1392-1776","authenticated-orcid":false,"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[{"name":"Research Center on Production Management and Engineering, Universitat Polit\u00e8cnica de Val\u00e8ncia, Plaza Ferrandiz-Salvador, 03801 Alcoy, Spain"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,8]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"326","DOI":"10.3390\/futuretransp1020019","article-title":"Advances of UAVs toward future transportation: The state-of-the-art, challenges, and opportunities","volume":"1","author":"Gupta","year":"2021","journal-title":"Future Transp."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"106280","DOI":"10.1016\/j.asoc.2020.106280","article-title":"A learnheuristic approach for the team orienteering problem with aerial drone motion constraints","volume":"92","author":"Bayliss","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Poudel, S., and Moh, S. (2021). Hybrid path planning for efficient data collection in UAV-aided WSNs for emergency applications. Sensors, 21.","DOI":"10.3390\/s21082839"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering problem: A survey of recent variants, solution approaches and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/j.cor.2013.09.011","article-title":"A two-stage approach to the orienteering problem with stochastic weights","volume":"43","author":"Evers","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1287\/ijoc.2022.1240","article-title":"Robust team orienteering problem with decreasing profits","volume":"34","author":"Yu","year":"2022","journal-title":"INFORMS J. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1504\/EJIE.2020.108581","article-title":"Maximising reward from a team of surveillance drones: A simheuristic approach to the stochastic team orienteering problem","volume":"14","author":"Panadero","year":"2020","journal-title":"Eur. J. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1504\/IJOR.2023.128542","article-title":"Solving the team orienteering problem with time windows and mandatory visits using a constraint programming approach","volume":"46","author":"Kirac","year":"2023","journal-title":"Int. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.cie.2017.10.020","article-title":"Solving the team orienteering problem with time windows and mandatory visits by multi-start simulated annealing","volume":"114","author":"Lin","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1080\/0305215X.2017.1417398","article-title":"An iterated local search algorithm for the team orienteering problem with variable profits","volume":"50","author":"Gunawan","year":"2018","journal-title":"Eng. Optim."},{"key":"ref_12","first-page":"3039","article-title":"Solving the stochastic team orienteering problem: Comparing simheuristics with the sample average approximation method","volume":"31","author":"Panadero","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Gonzalez-Neira, E.M., Montoya-Torres, J.R., and Jimenez, J.F. (2021). A multicriteria simheuristic approach for solving a stochastic permutation flow shop scheduling problem. Algorithms, 14.","DOI":"10.3390\/a14070210"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1177\/0037549720968891","article-title":"A simheuristic approach for the flexible job shop scheduling problem with stochastic processing times","volume":"97","author":"Caldeira","year":"2021","journal-title":"Simulation"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"124138","DOI":"10.1016\/j.jclepro.2020.124138","article-title":"Improving construction and demolition waste collection service in an urban area using a simheuristic approach: A case study in Sydney, Australia","volume":"280","author":"Yazdani","year":"2021","journal-title":"J. Clean. Prod."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Lemus-Romani, J., Becerra-Rozas, M., Lanza-Guti\u00e9rrez, J.M., Caball\u00e9, N., Castillo, M., Tapia, D., Cisternas-Caneo, F., and Garc\u00eda, J. (2021). Q-learnheuristics: Towards data-driven balanced metaheuristics. Mathematics, 9.","DOI":"10.3390\/math9161839"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Gomez, J.F., Uguina, A.R., Panadero, J., and Juan, A.A. (2023). A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions. Algorithms, 16.","DOI":"10.3390\/a16120532"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Bullah, S., and van Zyl, T.L. (2023, January 23\u201324). A Learnheuristic Approach to A Constrained Multi-Objective Portfolio Optimisation Problem. Proceedings of the 2023 7th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence, Virtual.","DOI":"10.1145\/3596947.3596965"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","article-title":"Heuristics for the multi-period orienteering problem with multiple time windows","volume":"37","author":"Tricoire","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2787","DOI":"10.1016\/j.cor.2012.02.010","article-title":"Simultaneous sensor selection and routing of unmanned aerial vehicles for complex mission plans","volume":"39","author":"Mufalli","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"106700","DOI":"10.1016\/j.asoc.2020.106700","article-title":"Novel hybrid algorithm for Team Orienteering Problem with Time Windows for rescue applications","volume":"96","author":"Saeedvand","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Schmitt-Ulms, F., Hottung, A., Sellmann, M., and Tierney, K. (2022, January 5\u201310). Learning to solve a stochastic orienteering problem with time windows. Proceedings of the International Conference on Learning and Intelligent Optimization, Milos Island, Greece.","DOI":"10.1007\/978-3-031-24866-5_8"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"4467","DOI":"10.1007\/s10489-024-05367-4","article-title":"Multi-start team orienteering problem for UAS mission re-planning with data-efficient deep reinforcement learning","volume":"54","author":"Lee","year":"2024","journal-title":"Appl. Intell."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Xu, W., Xu, Z., Peng, J., Liang, W., Liu, T., Jia, X., and Das, S.K. (2020, January 6\u20139). Approximation algorithms for the team orienteering problem. Proceedings of the IEEE INFOCOM 2020\u2014IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM41043.2020.9155343"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"100070","DOI":"10.1016\/j.ejtl.2021.100070","article-title":"A branch-and-price algorithm for a team orienteering problem with fixed-wing drones","volume":"11","author":"Sundar","year":"2022","journal-title":"EURO J. Transp. Logist."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10732-022-09507-2","article-title":"Self-adaptive heuristic algorithms for the dynamic and stochastic orienteering problem in autonomous transportation system","volume":"29","author":"Wang","year":"2023","journal-title":"J. Heuristics"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Elzein, A., and Di Caro, G.A. (2022). A clustering metaheuristic for large orienteering problems. PLoS ONE, 17.","DOI":"10.1371\/journal.pone.0271751"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Le, H.T., Middendorf, M., and Shi, Y. (2021, January 7\u20139). An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem. Proceedings of the Evolutionary Computation in Combinatorial Optimization: 21st European Conference, EvoCOP 2021, Held as Part of EvoStar 2021, Virtual Event.","DOI":"10.1007\/978-3-030-72904-2_5"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"103172","DOI":"10.1016\/j.tre.2023.103172","article-title":"Routing UAVs in landslides Monitoring: A neural network heuristic for team orienteering with mandatory visits","volume":"175","author":"Fang","year":"2023","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Juan, A.A., Marugan, C.A., Ahsini, Y., Fornes, R., Panadero, J., and Martin, X.A. (2023). Using Reinforcement Learning to Solve a Dynamic Orienteering Problem with Random Rewards Affected by the Battery Status. Batteries, 9.","DOI":"10.3390\/batteries9080416"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2012.10.012","article-title":"Multi-start methods for combinatorial optimization","volume":"226","author":"Resende","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","article-title":"A tabu search heuristic for the team orienteering problem","volume":"32","author":"Tang","year":"2005","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","article-title":"Ants can solve the team orienteering problem","volume":"54","author":"Ke","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","article-title":"An effective PSO-inspired algorithm for the team orienteering problem","volume":"229","author":"Dang","year":"2013","journal-title":"Eur. J. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/5\/200\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:41:48Z","timestamp":1760107308000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/5\/200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,8]]},"references-count":34,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["a17050200"],"URL":"https:\/\/doi.org\/10.3390\/a17050200","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,5,8]]}}}