{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T18:21:23Z","timestamp":1772821283157,"version":"3.50.1"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2019,2]]},"abstract":"<jats:p> In the Team Orienteering Problem with Time Windows (TOPTW), a variant of the Vehicle Routing Problem with Profits, a set of locations is given, each associated with a profit, a visiting time and a time window. The aim is to maximize the overall profit collected by a number of routes, while the duration of each route must not exceed a given time budget. TOPTW is NP-hard and is typically used to model the Tourist Trip Design Problem. The latter deals with deriving near optimal multiple-day tours for tourists visiting a destination with several points of interest (POIs). The most efficient known heuristic approach to TOPTW which yields the best solution quality versus execution time, is based on Iterated Local Search (ILS). However, the ILS algorithm treats each node separately, hence it tends to overlook highly profitable areas of nodes situated far from the current solution, considering them too time-expensive to visit. We propose two cluster-based extensions to ILS addressing the aforementioned weakness by grouping nodes on separate clusters (based on geographical criteria), thereby making visits to such nodes more attractive. Our approaches improve ILS with respect to solutions quality and execution time as evidenced by experimental tests exercised on both existing and new TTDP-oriented benchmark instances. <\/jats:p>","DOI":"10.1142\/s0217595919500015","type":"journal-article","created":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T02:01:08Z","timestamp":1541556068000},"page":"1950001","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows"],"prefix":"10.1142","volume":"36","author":[{"given":"Damianos","family":"Gavalas","sequence":"first","affiliation":[{"name":"Department of Product &amp; Systems Design Engineering, University of the Aegean, Syros, 84100, Greece and Computer Technology Institute and Press, \u201cDiophantus\u201d (CTI), Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charalampos","family":"Konstantopoulos","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Piraeus, Karaoli &amp; Dimitriou 80 Piraeus, 18534, Greece and Computer Technology Institute and Press, \u201cDiophantus\u201d (CTI), Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Mastakas","sequence":"additional","affiliation":[{"name":"School of Applied Mathematical and Physical Sciences, National Technical University of Athens, Heroon Polytechniou 9 Zografou, 15780, Greece and Computer Technology Institute and Press, \u201cDiophantus\u201d (CTI), Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[{"name":"Department of Informatics and Computer Engineering, University of West Attica, Agiou Spyridonos Aigaleo, 12243, Greece and Computer Technology Institute and Press, \u201cDiophantus\u201d (CTI), Patras, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,4,2]]},"reference":[{"key":"S0217595919500015BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-9004-0"},{"key":"S0217595919500015BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.04.004"},{"key":"S0217595919500015BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90065-5"},{"key":"S0217595919500015BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00289-4"},{"key":"S0217595919500015BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"key":"S0217595919500015BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.02.038"},{"key":"S0217595919500015BIB007","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9242-5"},{"key":"S0217595919500015BIB009","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D"},{"key":"S0217595919500015BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.06.011"},{"key":"S0217595919500015BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.01.030"},{"key":"S0217595919500015BIB013","series-title":"Lecture Notes in Computer Science","first-page":"219","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN XI","volume":"6239","author":"Labadi N","year":"2010"},{"key":"S0217595919500015BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9153-z"},{"key":"S0217595919500015BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90100-Q"},{"key":"S0217595919500015BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00060-2"},{"key":"S0217595919500015BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.08.024"},{"issue":"4","key":"S0217595919500015BIB019","first-page":"287","volume":"34","author":"Montemanni R","year":"2009","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"S0217595919500015BIB020","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"S0217595919500015BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.05.012"},{"key":"S0217595919500015BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.03.045"},{"key":"S0217595919500015BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.03.008"},{"key":"S0217595919500015BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.11.085"},{"issue":"3","key":"S0217595919500015BIB027","first-page":"21","volume":"20","author":"Vansteenwegen P","year":"2007","journal-title":"Operational Research Insight"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595919500015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:36:24Z","timestamp":1565105784000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595919500015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":22,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,4,2]]},"published-print":{"date-parts":[[2019,2]]}},"alternative-id":["10.1142\/S0217595919500015"],"URL":"https:\/\/doi.org\/10.1142\/s0217595919500015","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}