{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:14:59Z","timestamp":1766578499759},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_34","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T09:23:02Z","timestamp":1368004982000},"page":"390-401","source":"Crossref","is-referenced-by-count":21,"title":["Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Damianos","family":"Gavalas","sequence":"first","affiliation":[]},{"given":"Charalampos","family":"Konstantopoulos","sequence":"additional","affiliation":[]},{"given":"Konstantinos","family":"Mastakas","sequence":"additional","affiliation":[]},{"given":"Grammati","family":"Pantziou","sequence":"additional","affiliation":[]},{"given":"Yiannis","family":"Tasoulas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.-F. Cordeau","year":"1997","unstructured":"Cordeau, J.-F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks\u00a030, 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"3","key":"34_CR2","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2012.02.038","volume":"220","author":"L.M. Gambardella","year":"2012","unstructured":"Gambardella, L.M., Montemanni, R., Weyland, D.: Coupling ant colony systems with strong local searches. European Journal of Operational Research\u00a0220(3), 831\u2013843 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"34_CR3","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":"B.L. Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics (NRL)\u00a034(3), 307\u2013318 (1987)","journal-title":"Naval Research Logistics (NRL)"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N. Labadi","year":"2012","unstructured":"Labadi, N., Mansini, R., Melechovsk\u00fd, J., Wolfler Calvo, R.: The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research\u00a0220(1), 15\u201327 (2012)","journal-title":"European Journal of Operational Research"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10732-010-9153-z","volume":"17","author":"N. Labadi","year":"2011","unstructured":"Labadi, N., Melechovsk\u00fd, J., Wolfler Calvo, R.: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. Journal of Heuristics\u00a017, 729\u2013753 (2011)","journal-title":"Journal of Heuristics"},{"issue":"2-3","key":"34_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G. Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Applied Mathematics\u00a026(2-3), 193\u2013207 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Li, Z., Hu, X.: The team orienteering problem with capacity constraint and time window. In: The Tenth International Symposium on Operations Research and Its Applications (ISORA 2011), pp. 157\u2013163 (August 2011)","DOI":"10.1109\/ICSSSM.2011.5959526"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A. Likas","year":"2003","unstructured":"Likas, A., Vlassis, N., Verbeek, J.: The global k-means clustering algorithm. Pattern Recognition\u00a036(2), 451\u2013461 (2003)","journal-title":"Pattern Recognition"},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ejor.2011.08.024","volume":"217","author":"S.-W. Lin","year":"2012","unstructured":"Lin, S.-W., Yu, V.F.: A simulated annealing heuristic for the team orienteering problem with time windows. European Journal of Operational Research\u00a0217(1), 94\u2013107 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"34_CR10","first-page":"287","volume":"34","author":"R. Montemanni","year":"2009","unstructured":"Montemanni, R., Gambardella, L.M.: An ant colony system for team orienteering problems with time windows. Foundations of Computing and Decision Sciences\u00a034(4), 287\u2013306 (2009)","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research\u00a035, 254\u2013265 (1987)","journal-title":"Operations Research"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.cor.2009.05.012","volume":"37","author":"F. Tricoire","year":"2010","unstructured":"Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Computers & Operations Research\u00a037(2), 351\u2013367 (2010)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"34_CR13","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.: The orienteering problem: A survey. European Journal of Operational Research\u00a0209(1), 1\u201310 (2011)","journal-title":"European Journal of Operational Research"},{"key":"34_CR14","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., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res.\u00a036, 3281\u20133290 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"34_CR15","first-page":"21","volume":"20","author":"P. Vansteenwegen","year":"2007","unstructured":"Vansteenwegen, P., Van Oudheusden, D.: The mobile tourist guide: An or opportunity. Operational Research Insight\u00a020(3), 21\u201327 (2007)","journal-title":"Operational Research Insight"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:46:02Z","timestamp":1557690362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}