{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T12:08:53Z","timestamp":1779538133226,"version":"3.53.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-108679RB-I00\/AEI\/10.13039\/501100011033, PID2021-122209OB-C31, and PID2024-155179NB-C22"],"award-info":[{"award-number":["PID2019-108679RB-I00\/AEI\/10.13039\/501100011033, PID2021-122209OB-C31, and PID2024-155179NB-C22"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s12351-026-01028-1","type":"journal-article","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T18:12:02Z","timestamp":1773684722000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A variable neighborhood search with different levels of cooperation for the team generalized orienteering problem"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6558-6319","authenticated-orcid":false,"given":"Adolfo","family":"Urrutia-Zambrana","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gregorio","family":"Tirado","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfonso","family":"Mateos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,16]]},"reference":[{"key":"1028_CR1","unstructured":"Almeida, L.E., & Macharet, D.G. (2023). Clustered orienteering problem with subgroups. arXiv preprint arXiv:2312.16154"},{"issue":"2","key":"1028_CR2","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.ejor.2014.04.006","volume":"238","author":"E Angelelli","year":"2014","unstructured":"Angelelli E, Archetti C, Vindigni M (2014) The clustered orienteering problem. Eur J Oper Res 238(2):404\u2013414","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1028_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/net.21519","volume":"63","author":"C Archetti","year":"2014","unstructured":"Archetti C, Bianchessi N, Speranza MG, Hertz A (2014) The split delivery capacitated team orienteering problem. Networks 63(1):16\u201333","journal-title":"Networks"},{"issue":"1","key":"1028_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ejor.2017.11.009","volume":"267","author":"C Archetti","year":"2018","unstructured":"Archetti C, Carrabs F, Cerulli R (2018) The set orienteering problem. Eur J Oper Res 267(1):264\u2013272","journal-title":"Eur J Oper Res"},{"issue":"6","key":"1028_CR5","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C Archetti","year":"2009","unstructured":"Archetti C, Feillet D, Hertz A, Speranza MG (2009) The capacitated team orienteering and profitable tour problems. J Operat Res Soc 60(6):831\u2013842","journal-title":"J Operat Res Soc"},{"issue":"1","key":"1028_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13(1):49\u201376","journal-title":"J Heuristics"},{"issue":"3","key":"1028_CR7","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.2013.0484","volume":"48","author":"C Archetti","year":"2013","unstructured":"Archetti C, Speranza MG, Corber\u00e1n \u00c1, Sanchis JM, Plana I (2013) The team orienteering arc routing problem. Transp Sci 48(3):442\u2013457","journal-title":"Transp Sci"},{"key":"1028_CR8","doi-asserted-by":"crossref","unstructured":"Aringhieri R, Bigharaz S, Duma D, Guastalla A (2022) Novel applications of the team orienteering problem in health care logistics. L.\u00a0Amorosi, P.\u00a0Dell\u2019Olmo, and I.\u00a0Lari (Eds.), Optimization in artificial intelligence and data sciences Cham: Springer International Publishing, Switzerland (pp. 235\u2013245).","DOI":"10.1007\/978-3-030-95380-5_21"},{"key":"1028_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"H Bouly","year":"2010","unstructured":"Bouly H, Dang D-C, Moukrim A (2010) A memetic algorithm for the team orienteering problem. Q J Oper Res 8:49\u201370","journal-title":"Q J Oper Res"},{"issue":"3","key":"1028_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I Chao","year":"1996","unstructured":"Chao I, Golden BL, Wasil EA et al (1996) The team orienteering problem. Eur J Oper Res 88(3):464\u2013474","journal-title":"Eur J Oper Res"},{"key":"1028_CR11","doi-asserted-by":"crossref","unstructured":"Dang D-C, Guibadj RN, Moukrim A (2011) A pso-based memetic algorithm for the team orienteering problem. European conference on the applications of evolutionary computation pringer Berlin Heidelberg. pp. 471\u2013480","DOI":"10.1007\/978-3-642-20520-0_48"},{"issue":"2","key":"1028_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","volume":"229","author":"D-C Dang","year":"2013","unstructured":"Dang D-C, Guibadj RN, Moukrim A (2013) An effective pso-inspired algorithm for the team orienteering problem. Eur J Oper Res 229(2):332\u2013344","journal-title":"Eur J Oper Res"},{"key":"1028_CR13","doi-asserted-by":"crossref","unstructured":"Delahaye D, Chaimatanan S, Mongeau M (2018) Simulated annealing: From basics to applications. Handbook of metaheuristics Springer Cham: Springer International Publishing, Switzerland pp. 1\u201335","DOI":"10.1007\/978-3-319-91086-4_1"},{"issue":"3","key":"1028_CR14","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.ejor.2023.02.008","volume":"309","author":"M Dontas","year":"2023","unstructured":"Dontas M, Sideris G, Manousakis EG, Zachariadis EE (2023) An adaptive memory matheuristic for the set orienteering problem. Eur J Oper Res 309(3):1010\u20131023","journal-title":"Eur J Oper Res"},{"key":"1028_CR15","unstructured":"Garcia A, Vansteenwegen P, Souffriau W, Arbelaitz O, Linaza M (2009) Solving multi constrained team orienteering problems to generate tourist routes. status: published"},{"key":"1028_CR16","doi-asserted-by":"crossref","unstructured":"Geem ZW, Tseng C-L, Park Y (2005) Harmony search for generalized orienteering problem: Best touring in china. L.\u00a0Wang, K.\u00a0Chen, and Y.S.\u00a0Ong (Eds.), Advances in natural computation (pp. 741\u2013750). Berlin, Heidelberg: Springer Berlin Heidelberg","DOI":"10.1007\/11539902_91"},{"issue":"2","key":"1028_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: A survey of recent variants, solution approaches and applications. Eur J Oper Res 255(2):315\u2013332","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1028_CR18","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke L, Archetti C, Feng Z (2008) Ants can solve the team orienteering problem. Comp Indus Eng 54(3):648\u2013665","journal-title":"Comp Indus Eng"},{"issue":"8","key":"1028_CR19","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1016\/j.eswa.2012.12.022","volume":"40","author":"B-I Kim","year":"2013","unstructured":"Kim B-I, Li H, Johnson AL (2013) An augmented large neighborhood search method for solving the team orienteering problem. Expert Syst Appl 40(8):3065\u20133072","journal-title":"Expert Syst Appl"},{"issue":"2","key":"1028_CR20","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.ejor.2022.02.045","volume":"303","author":"H Kim","year":"2022","unstructured":"Kim H, Kim B-I (2022) Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem. Eur J Oper Res 303(2):550\u2013566","journal-title":"Eur J Oper Res"},{"key":"1028_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106808","volume":"149","author":"H Kim","year":"2020","unstructured":"Kim H, Kim B-I, Noh D-J (2020) The multi-profit orienteering problem. Comp Indus Eng 149:106808","journal-title":"Comp Indus Eng"},{"key":"1028_CR22","doi-asserted-by":"crossref","unstructured":"Li J (2011) Model and algorithm for time-dependent team orienteering problem. International conference on computer education, simulation and modeling (pp. 1\u20137)","DOI":"10.1007\/978-3-642-21783-8_1"},{"issue":"2","key":"1028_CR23","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.asoc.2012.09.022","volume":"13","author":"S-W Lin","year":"2013","unstructured":"Lin S-W (2013) Solving the team orienteering problem using effective multi-start simulated annealing. Appl Soft Comput 13(2):1064\u20131073","journal-title":"Appl Soft Comput"},{"key":"1028_CR24","doi-asserted-by":"crossref","unstructured":"Mansfield A, Manjanna S, Macharet DG, Hsieh MA (2021) Multi-robot scheduling for environmental monitoring as a team orienteering problem. 2021 ieee\/rsj international conference on intelligent robots and systems (iros) (pp. 6398\u20136404)","DOI":"10.1109\/IROS51168.2021.9636854"},{"key":"1028_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111399","volume":"155","author":"E Marzal","year":"2024","unstructured":"Marzal E, Sebastia L (2024) Solving the tourist trip design problem with time windows and variable profit using incremental local search. Appl Soft Comput 155:111399","journal-title":"Appl Soft Comput"},{"issue":"11","key":"1028_CR26","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comp Oper Res 24(11):1097\u20131100","journal-title":"Comp Oper Res"},{"key":"1028_CR27","doi-asserted-by":"crossref","unstructured":"Panadero J, de Armas J, Currie CS, Juan AA (2017) A simheuristic approach for the stochastic team orienteering problem. 2017 winter simulation conference (wsc) (pp. 3208\u20133217)","DOI":"10.1109\/WSC.2017.8248039"},{"key":"1028_CR28","doi-asserted-by":"crossref","unstructured":"Reeves, C.R. (2010). Genetic algorithms. Handbook of metaheuristics (pp. 109\u2013139). Springer, Switzerland","DOI":"10.1007\/978-1-4419-1665-5_5"},{"issue":"11","key":"1028_CR29","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau W, Vansteenwegen P, Berghe GV, Van Oudheusden D (2010) A path relinking approach for the team orienteering problem. Comp Oper Res 37(11):1853\u20131859","journal-title":"Comp Oper Res"},{"issue":"2","key":"1028_CR30","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2010.05.001","volume":"39","author":"W Souffriau","year":"2011","unstructured":"Souffriau W, Vansteenwegen P, Berghe GV, Van Oudheusden D (2011) The planning of cycle trips in the province of east flanders. Omega 39(2):209\u2013213","journal-title":"Omega"},{"issue":"1","key":"1028_CR31","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/trsc.1110.0377","volume":"47","author":"W Souffriau","year":"2013","unstructured":"Souffriau W, Vansteenwegen P, Berghe GV, Van Oudheusden D (2013) The multiconstraint team orienteering problem with multiple time windows. Transp Sci 47(1):53\u201363","journal-title":"Transp Sci"},{"issue":"6","key":"1028_CR32","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comp Oper Res 32(6):1379\u20131407","journal-title":"Comp Oper Res"},{"key":"1028_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.108264","volume":"116","author":"T Tlili","year":"2022","unstructured":"Tlili T, Masri H, Krichen S (2022) Towards an efficient collection and transport of covid-19 diagnostic specimens using genetic-based algorithms. Appl Soft Comput 116:108264","journal-title":"Appl Soft Comput"},{"issue":"9","key":"1028_CR34","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides T (1984) Heuristic methods applied to orienteering. J Oper Res Soc 35(9):797\u2013809","journal-title":"J Oper Res Soc"},{"issue":"1","key":"1028_CR35","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1111\/itor.12800","volume":"28","author":"A Urrutia-Zambrana","year":"2021","unstructured":"Urrutia-Zambrana A, Tirado G, Mateos A (2021) Variable neighborhood search to solve the generalized orienteering problem. Int Trans Oper Res 28(1):142\u2013167","journal-title":"Int Trans Oper Res"},{"key":"1028_CR36","doi-asserted-by":"crossref","unstructured":"Vansteenwegen P, Gunawan A (2019) Orienteering problems. EURO Advanced Tutorials on Operational Research","DOI":"10.1007\/978-3-030-29746-6"},{"key":"1028_CR37","doi-asserted-by":"crossref","unstructured":"Vansteenwegen P, Souffriau W, Berghe GV, Oudheusden DV (2009) Metaheuristics for tourist trip planning. Metaheuristics in the service industry (pp. 15\u201331). Springer","DOI":"10.1007\/978-3-642-00939-6_2"},{"issue":"1","key":"1028_CR38","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen P, Souffriau W, Berghe GV, Van Oudheusden D (2009) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118\u2013127","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1028_CR39","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen P, Souffriau W, Berghe GV, Van Oudheusden D (2009) Iterated local search for the team orienteering problem with time windows. Comp Oper Res 36(12):3281\u20133290","journal-title":"Comp Oper Res"},{"key":"1028_CR40","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cie.2018.11.044","volume":"127","author":"FY Vincent","year":"2019","unstructured":"Vincent FY, Jewpanya P, Lin S-W, Redi AP (2019) Team orienteering problem with time windows and time-dependent scores. Comp Indus Engin 127:213\u2013224","journal-title":"Comp Indus Engin"},{"key":"1028_CR41","unstructured":"Wang Q, Sun C, Golden B (1996) Using artificial neural networks to solve generalized orienteering problem. Proceedings of artificial neural networks in engineering conference (pp. 063\u20131068)"},{"key":"1028_CR42","doi-asserted-by":"crossref","unstructured":"Wang X, Golden BL, Wasil EA (2008) Using a genetic algorithm to solve the generalized orienteering problem.: B.\u00a0Golden, S.\u00a0Raghavan, and E.\u00a0Wasil (Eds.), The vehicle routing problem: Latest advances and new challengesBoston, MA: Springer US (pp. 263\u2013274)","DOI":"10.1007\/978-0-387-77778-8_12"},{"issue":"2","key":"1028_CR43","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.ejor.2023.08.006","volume":"313","author":"Q Wu","year":"2024","unstructured":"Wu Q, He M, Hao J-K, Lu Y (2024) An effective hybrid evolutionary algorithm for the clustered orienteering problem. Eur J Oper Res 313(2):418\u2013434","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1028_CR44","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/TNET.2020.3027434","volume":"29","author":"W Xu","year":"2020","unstructured":"Xu W, Liang W, Xu Z, Peng J, Peng D, Liu T, Das SK (2020) Approximation algorithms for the generalized team orienteering problem and its applications. IEEE\/ACM Trans Network 29(1):176\u2013189","journal-title":"IEEE\/ACM Trans Network"},{"key":"1028_CR45","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.cor.2019.07.008","volume":"111","author":"A-E Yahiaoui","year":"2019","unstructured":"Yahiaoui A-E, Moukrim A, Serairi M (2019) The clustered team orienteering problem. Computers & Operations Research 111:386\u2013399","journal-title":"Computers & Operations Research"},{"issue":"9","key":"1028_CR46","doi-asserted-by":"publisher","first-page":"440","DOI":"10.3844\/jcssp.2017.440.451","volume":"13","author":"M Zettam","year":"2017","unstructured":"Zettam M (2017) A randomized population constructive heuristic for the team orienteering problem. J Comput Sci 13(9):440\u2013451","journal-title":"J Comput Sci"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01028-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-026-01028-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-026-01028-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T11:50:08Z","timestamp":1779537008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-026-01028-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,16]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1028"],"URL":"https:\/\/doi.org\/10.1007\/s12351-026-01028-1","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,16]]},"assertion":[{"value":"18 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"44"}}