{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T10:45:39Z","timestamp":1776336339029,"version":"3.51.2"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T00:00:00Z","timestamp":1723420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Technol Tourism"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s40558-024-00297-w","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T13:08:25Z","timestamp":1723468105000},"page":"633-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving the tourist trip planning problem with attraction patterns using meta-heuristic techniques"],"prefix":"10.1007","volume":"26","author":[{"given":"Kadri","family":"Sylejmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vigan","family":"Abdurrahmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5981-7336","authenticated-orcid":false,"given":"Arben","family":"Ahmeti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Egzon","family":"Gashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,12]]},"reference":[{"key":"297_CR1","unstructured":"Abdurrahmani V, Sylejmani K, Ahmedi L (2021) A simulated annealing approach for the tourist trip design problem with the pattern sequence of the points of interest. In: Proceedings of the 13th international conference on the practice and theory of automated timetabling-PATAT, vol 2"},{"key":"297_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-017-0431-8","volume":"7","author":"L Ahmedi","year":"2017","unstructured":"Ahmedi L, Rrmoku K, Sylejmani K, Shabani D (2017) A bimodal social network analysis to recommend points of interest to tourists. Soc Netw Anal Min 7:1\u201322","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"297_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/net.21995","volume":"77","author":"C Archetti","year":"2021","unstructured":"Archetti C, Bertazzi L (2021) Recent challenges in routing and inventory routing: e-commerce and last-mile delivery. Networks 77(2):255\u2013268","journal-title":"Networks"},{"issue":"2","key":"297_CR4","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o J (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur J Oper Res 284(2):559\u2013571","journal-title":"Eur J Oper Res"},{"issue":"3","key":"297_CR5","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I-M Chao","year":"1996","unstructured":"Chao I-M, Golden BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88(3):464\u2013474","journal-title":"Eur J Oper Res"},{"issue":"2","key":"297_CR6","first-page":"105","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Netw Int J 30(2):105\u2013119","journal-title":"Netw Int J"},{"key":"297_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.eswa.2018.06.045","volume":"112","author":"AA da Silva","year":"2018","unstructured":"da Silva AA, Morabito R, Pureza V (2018) Optimization approaches to support the planning and analysis of travel itineraries. Expert Syst Appl 112:321\u2013330","journal-title":"Expert Syst Appl"},{"issue":"1","key":"297_CR8","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.ijpe.2013.01.010","volume":"145","author":"A Divsalar","year":"2013","unstructured":"Divsalar A, Vansteenwegen P, Cattrysse D (2013) A variable neighborhood search method for the orienteering problem with hotel selection. Int J Prod Econ 145(1):150\u2013160","journal-title":"Int J Prod Econ"},{"issue":"1","key":"297_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ejor.2014.01.001","volume":"237","author":"A Divsalar","year":"2014","unstructured":"Divsalar A, Vansteenwegen P, S\u00f6rensen K, Cattrysse D (2014) A memetic algorithm for the orienteering problem with hotel selection. Eur J Oper Res 237(1):29\u201349","journal-title":"Eur J Oper Res"},{"issue":"4","key":"297_CR10","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1177\/2399808320913300","volume":"48","author":"X Feng","year":"2021","unstructured":"Feng X, Wang S, Murray AT, Cao Y, Gao S (2021) Multi-objective trajectory optimization in planning for sequential activities across space and through time. Environ Plann B Urban Anal City Sci 48(4):945\u2013963","journal-title":"Environ Plann B Urban Anal City Sci"},{"key":"297_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.122437","volume":"240","author":"AA Filho","year":"2023","unstructured":"Filho AA, Morabito R (2023) An effective approach for bi-objective multi-period touristic itinerary planning. Expert Syst Appl 240:122437","journal-title":"Expert Syst Appl"},{"key":"297_CR12","unstructured":"Gangoiti AG (2011) Intelligent personalised tourist route generation. PhD thesis, Universidad del Pa\u00eds Vasco= Euskal Herriko Unibertsitatea"},{"key":"297_CR13","unstructured":"Garcia A, Vansteenwegen P, Souffriau W, Arbelaitz O, Linaza M (2009) Solving multi constrained team orienteering problems to generate tourist routes"},{"key":"297_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20:291\u2013328","journal-title":"J Heuristics"},{"key":"297_CR15","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2015.03.016","volume":"62","author":"D Gavalas","year":"2015","unstructured":"Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Vathis N (2015a) Heuristics for the time dependent team orienteering problem: application to tourist route planning. Comput Oper Res 62:36\u201350","journal-title":"Comput Oper Res"},{"issue":"2","key":"297_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.ipl.2014.10.003","volume":"115","author":"D Gavalas","year":"2015","unstructured":"Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G, Vathis N (2015b) Approximation algorithms for the arc orienteering problem. Inf Process Lett 115(2):313\u2013315","journal-title":"Inf Process Lett"},{"issue":"3","key":"297_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden BL, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logist (NRL) 34(3):307\u2013318","journal-title":"Naval Res Logist (NRL)"},{"issue":"2","key":"297_CR18","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"},{"key":"297_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105620","volume":"138","author":"FSM Heris","year":"2022","unstructured":"Heris FSM, Ghannadpour SF, Morteza B, Zandieh F (2022) A new accessibility based team orienteering approach for urban tourism routes optimization (a real life case). Comput Oper Res 138:105620","journal-title":"Comput Oper Res"},{"issue":"4","key":"297_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A Hertz","year":"2001","unstructured":"Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp Sci 35(4):425\u2013434","journal-title":"Transp Sci"},{"issue":"10","key":"297_CR21","doi-asserted-by":"publisher","first-page":"4225","DOI":"10.1109\/TITS.2019.2939224","volume":"21","author":"T Huang","year":"2019","unstructured":"Huang T, Gong Y-J, Zhang Y-H, Zhan Z-H, Zhang J (2019) Automatic planning of multiple itineraries: a niching genetic evolution approach. IEEE Trans Intell Transp Syst 21(10):4225\u20134240","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"1","key":"297_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1515\/tw-2019-0003","volume":"11","author":"S Ivanov","year":"2019","unstructured":"Ivanov S (2019) Ultimate transformation: how will automation technologies disrupt the travel, tourism and hospitality industries? Zeitschrift f\u00fcr Tourismuswissenschaft 11(1):25\u201343","journal-title":"Zeitschrift f\u00fcr Tourismuswissenschaft"},{"key":"297_CR23","unstructured":"Louren\u00e7o Helena\u00a0R, Martin Olivier\u00a0C, St\u00fctzle Thomas (2003) Iterated local search. Springer"},{"key":"297_CR24","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2019) Iterated local search: framework and applications. In: Handbook of metaheuristics, pp 129\u2013168","DOI":"10.1007\/978-3-319-91086-4_5"},{"key":"297_CR25","volume-title":"Essentials of metaheuristics","author":"S Luke","year":"2013","unstructured":"Luke S (2013) Essentials of metaheuristics, vol 2. Lulu, Raleigh"},{"key":"297_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M Lundy","year":"1986","unstructured":"Lundy M, Mees A (1986) Convergence of an annealing algorithm. Math Programm 34:111\u2013124","journal-title":"Math Programm"},{"key":"297_CR27","doi-asserted-by":"crossref","unstructured":"Ma Z, Guo H, Gui Y, Gong Y-J (2021) An efficient computational approach for automatic itinerary planning on web servers. In: Proceedings of the genetic and evolutionary computation conference, pp 991\u2013999","DOI":"10.1145\/3449639.3459301"},{"issue":"4","key":"297_CR28","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM (JACM) 7(4):326\u2013329","journal-title":"J ACM (JACM)"},{"key":"297_CR29","doi-asserted-by":"crossref","unstructured":"Mrazovic P, Larriba-Pey JL, Matskin M (2017) Improving mobility in smart cities with intelligent tourist trip planning. In: 2017 IEEE 41st annual computer software and applications conference (COMPSAC)","DOI":"10.1109\/COMPSAC.2017.144"},{"key":"297_CR30","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.cor.2015.11.007","volume":"78","author":"PJ Palomo-Mart\u00ednez","year":"2017","unstructured":"Palomo-Mart\u00ednez PJ, Salazar-Aguilar MA, Laporte G, Langevin A (2017) A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints. Comput Oper Res 78:408\u2013419","journal-title":"Comput Oper Res"},{"issue":"2","key":"297_CR31","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10732-011-9186-y","volume":"19","author":"PHV Penna","year":"2013","unstructured":"Penna PHV, Subramanian A, Ochi LS (2013) An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J Heuristics 19(2):201\u2013232","journal-title":"J Heuristics"},{"issue":"3","key":"297_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155\u2013170","journal-title":"Networks"},{"key":"297_CR33","doi-asserted-by":"crossref","unstructured":"Roberto M, Weyland D, Gambardella LM (2011) An enhanced ant colony system for the team orienteering problem with time windows. In: 2011 International symposium on computer science and society. IEEE, pp 381\u2013384","DOI":"10.1109\/ISCCS.2011.95"},{"key":"297_CR34","volume":"9","author":"J Ruiz-Meza","year":"2022","unstructured":"Ruiz-Meza J, Montoya-Torres JR (2022) A systematic literature review for the tourist trip design problem: extensions, solution techniques and future research lines. Oper Res Perspect 9:100228","journal-title":"Oper Res Perspect"},{"issue":"2","key":"297_CR35","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.ejor.2019.11.010","volume":"283","author":"S Sohrabi","year":"2020","unstructured":"Sohrabi S, Ziarati K, Keshtkaran M (2020) A greedy randomized adaptive search procedure for the orienteering problem with hotel selection. Eur J Oper Res 283(2):426\u2013440","journal-title":"Eur J Oper Res"},{"key":"297_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2021.100036","volume":"10","author":"S Sohrabi","year":"2021","unstructured":"Sohrabi S, Ziarati K, Keshtkaran M (2021) ACS-OPHS: ant colony system for the orienteering problem with hotel selection. EURO J Transp Logist 10:100036","journal-title":"EURO J Transp Logist"},{"issue":"2","key":"297_CR37","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"10","key":"297_CR38","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1080\/08839510802379626","volume":"22","author":"W Souffriau","year":"2008","unstructured":"Souffriau W, Vansteenwegen P, Vertommen J, Greet VB, Van Oudheusden D (2008) A personalized tourist trip design algorithm for mobile tourist guides. Applied Artificial Intelligence 22(10):964\u2013985","journal-title":"Applied Artificial Intelligence"},{"issue":"1","key":"297_CR39","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":"4","key":"297_CR40","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0169-7439(89)80095-4","volume":"6","author":"L St","year":"1989","unstructured":"St L, Wold S et al (1989) Analysis of variance (ANOVA). Chemometr Intell Lab Syst 6(4):259\u2013272","journal-title":"Chemometr Intell Lab Syst"},{"key":"297_CR41","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s40558-021-00195-5","volume":"23","author":"G Stamatelatos","year":"2021","unstructured":"Stamatelatos G, Drosatos G, Gyftopoulos S, Briola H, Efraimidis PS (2021) Point-of-interest lists and their potential in recommendation systems. Inf Technol Tour 23:209\u2013239","journal-title":"Inf Technol Tour"},{"issue":"3","key":"297_CR42","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ejor.2005.01.066","volume":"174","author":"T St\u00fctzle","year":"2006","unstructured":"St\u00fctzle T (2006) Iterated local search for the quadratic assignment problem. Eur J Oper Res 174(3):1519\u20131539","journal-title":"Eur J Oper Res"},{"key":"297_CR44","doi-asserted-by":"crossref","unstructured":"Sylejmani K, Dorn J, Musliu N (2012) A tabu search approach for multi constrained team orienteering problem and its application in touristic trip planning. In: 2012 12th International conference on hybrid intelligent systems (HIS). IEEE. pp 300\u2013305","DOI":"10.1109\/HIS.2012.6421351"},{"key":"297_CR43","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s40558-017-0080-9","volume":"17","author":"K Sylejmani","year":"2017","unstructured":"Sylejmani K, Dorn J, Musliu N (2017) Planning the trip itinerary for tourist groups. Inf Technol Tour 17:275\u2013314","journal-title":"Inf Technol Tour"},{"key":"297_CR45","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi E-G (2009) Metaheuristics: from design to implementation. Wiley, Hoboken"},{"key":"297_CR46","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1109\/ACCESS.2019.2960492","volume":"8","author":"A Toledo","year":"2019","unstructured":"Toledo A, Riff M-C, Neveu B (2019) A hyper-heuristic for the orienteering problem with hotel selection. IEEE Access 8:1303\u20131313","journal-title":"IEEE Access"},{"issue":"12","key":"297_CR47","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. Comput Oper Res 36(12):3281\u20133290","journal-title":"Comput Oper Res"},{"issue":"1","key":"297_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Eur J Oper Res 209(1):1\u201310","journal-title":"Eur J Oper Res"},{"key":"297_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106083","volume":"150","author":"N Vathis","year":"2023","unstructured":"Vathis N, Konstantopoulos C, Pantziou G, Gavalas D (2023) The vacation planning problem: a multi-level clustering-based metaheuristic approach. Comput Oper Res 150:106083","journal-title":"Comput Oper Res"},{"key":"297_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111110","volume":"151","author":"N Vathis","year":"2024","unstructured":"Vathis N, Pantziou G, Konstantopoulos C, Gavalas D (2024) The regular language-constrained orienteering problem with time windows. Appl Soft Comput 151:111110","journal-title":"Appl Soft Comput"},{"key":"297_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105566","volume":"138","author":"DM Vu","year":"2022","unstructured":"Vu DM, Kergosien Y, Mendoza JE, Desport P (2022) Branch-and-check approaches for the tourist trip design problem with rich constraints. Comput Oper Res 138:105566","journal-title":"Comput Oper Res"}],"container-title":["Information Technology &amp; Tourism"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40558-024-00297-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40558-024-00297-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40558-024-00297-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T15:10:32Z","timestamp":1732201832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40558-024-00297-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,12]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["297"],"URL":"https:\/\/doi.org\/10.1007\/s40558-024-00297-w","relation":{},"ISSN":["1098-3058","1943-4294"],"issn-type":[{"value":"1098-3058","type":"print"},{"value":"1943-4294","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,12]]},"assertion":[{"value":"25 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2024","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"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}