{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T10:42:00Z","timestamp":1777632120068,"version":"3.51.4"},"reference-count":20,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EU FP7\/2007-2013","award":["288094"],"award-info":[{"award-number":["288094"]}]},{"name":"EU FP7\/2007-2013","award":["621133"],"award-info":[{"award-number":["621133"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time and an admittance time window, the Mixed Team Orienteering Problem with Time Windows (MTOPTW) seeks for a specific number of walks spanning a subset of nodes and edges of the graph so as to maximize the overall collected profit. The visit of the included nodes and edges should take place within their respective time window and the overall duration of each walk should be below a certain threshold. In this paper we introduce the MTOPTW, which can be used for modeling a realistic variant of the Tourist Trip Design Problem where the objective is the derivation of near-optimal multiple-day itineraries for tourists visiting a destination which features several points of interest (POIs) and scenic routes. Since the MTOPTW is a NP-hard problem, we propose the first metaheuristic approaches to tackle it. The effectiveness of our algorithms is validated through a number of experiments on POI and scenic route sets compiled from the city of Athens (Greece).<\/jats:p>","DOI":"10.3390\/a9010006","type":"journal-article","created":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T02:18:12Z","timestamp":1452046692000},"page":"6","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Metaheuristics for the Mixed Team Orienteering Problem with Time Windows"],"prefix":"10.3390","volume":"9","author":[{"given":"Damianos","family":"Gavalas","sequence":"first","affiliation":[{"name":"Department of Cultural Technology and Communication, University of the Aegean, University Hill, GR 81 100 Mytilini, Lesvos, Greece"},{"name":"Computer Technology Institute &amp; Press Diophantus, \u201cD. Maritsas\u201d Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charalampos","family":"Konstantopoulos","sequence":"additional","affiliation":[{"name":"Computer Technology Institute &amp; Press Diophantus, \u201cD. Maritsas\u201d Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece"},{"name":"Department of Informatics, University of Piraeus, 80, M. Karaoli &amp; A. Dimitriou St., 18534 Piraeus, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Mastakas","sequence":"additional","affiliation":[{"name":"Computer Technology Institute &amp; Press Diophantus, \u201cD. Maritsas\u201d Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece"},{"name":"School of Applied Mathematical and Physical Sciences, National Technical University of Athens, Zografou Campus, Heroon Polytechniou 9, 15780 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[{"name":"Computer Technology Institute &amp; Press Diophantus, \u201cD. Maritsas\u201d Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece"},{"name":"Department of Informatics, Technological Educational Institution of Athens, Ag. Spiridona St., Aigaleo 122 10, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Vathis","sequence":"additional","affiliation":[{"name":"Computer Technology Institute &amp; Press Diophantus, \u201cD. Maritsas\u201d Building, Nikou Kazantzaki St., University Campus of Patras 265 04 Rion, P.O. Box 1382, Greece"},{"name":"School of Electrical and Computer Engineering, National Technical University of Athens, Zografou Campus, Heroon Polytechniou 9, 15780 Zografou, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,1,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","article-title":"A Survey on Algorithmic Approaches for Solving Tourist Trip Design Problems","volume":"20","author":"Gavalas","year":"2014","journal-title":"J. Heuristics"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic Methods Applied to Orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"J. Oper. Res. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: A survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2010.05.001","article-title":"The planning of cycle trips in the province of East Flanders","volume":"39","author":"Souffriau","year":"2011","journal-title":"Omega"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/trsc.2013.0484","article-title":"The Team Orienteering Arc Routing Problem","volume":"48","author":"Archetti","year":"2013","journal-title":"Transp. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tre.2014.05.006","article-title":"An extension of the arc orienteering problem and its application to cycle trip planning","volume":"68","author":"Verbeeck","year":"2014","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ejor.2015.03.022","article-title":"A matheuristic for the team orienteering arc routing problem","volume":"242","author":"Archetti","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1860","DOI":"10.1016\/j.cor.2009.05.005","article-title":"The undirected capacitated arc routing problem with profits","volume":"37","author":"Archetti","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ejor.2010.09.039","article-title":"Local search for the undirected capacitated arc routing problem with profits","volume":"210","author":"Zachariadis","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0377-2217(99)00323-9","article-title":"The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm","volume":"127","author":"Deitch","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_11","unstructured":"Maervoet, J., Brackman, P., Verbeeck, K., de Causmaecker, P., and Vanden Berghe, G. (2013, January 4\u20135). Tour Suggestion for Outdoor Activities. Proceedings of the 12th International Symposium on Web and Wireless Geographical Information Systems (W2GIS\u201913), Banff, AB, Canada."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1016\/j.trpro.2014.10.064","article-title":"Designing Optimal Routes for Cycle-Tourists","volume":"3","author":"Malucelli","year":"2014","journal-title":"Transp. Res. Procedia"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ipl.2014.10.003","article-title":"Approximation algorithms for the arc orienteering problem","volume":"115","author":"Gavalas","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"ref_14","unstructured":"Benavent, E., Corberan, A., Plana, I., and Sanchis, J. (2014). Arc Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics."},{"key":"ref_15","unstructured":"Corberan, A., Plana, I., and Sanchis, J. (2014). Arc Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics."},{"key":"ref_16","unstructured":"Corberan, A., Plana, I., and Sanchis, J. (2014). Arc Routing: Problems, Methods, and Applications, Society for Industrial and Applied Mathematics."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","article-title":"Iterated local search for the team orienteering problem with time windows","volume":"36","author":"Vansteenwegen","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","article-title":"Iterated Local Search","volume":"Volume 57","author":"Glover","year":"2003","journal-title":"Handbook of Metaheuristics"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by Simmulated Annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/9\/1\/6\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:17:15Z","timestamp":1760210235000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/9\/1\/6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,5]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,3]]}},"alternative-id":["a9010006"],"URL":"https:\/\/doi.org\/10.3390\/a9010006","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,5]]}}}