{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T21:06:19Z","timestamp":1761339979572},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030062217"},{"type":"electronic","value":"9783030062224"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-06222-4_14","type":"book-chapter","created":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:02:37Z","timestamp":1559217757000},"page":"609-635","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Memetic Algorithm for the Team Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Dimitra","family":"Trachanatzi","sequence":"first","affiliation":[]},{"given":"Eleftherios","family":"Tsakirakis","sequence":"additional","affiliation":[]},{"given":"Magdalene","family":"Marinaki","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Marinakis","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Matsatsinis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,31]]},"reference":[{"issue":"1","key":"14_CR1","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, M. G. (2007). Metaheuristics for the team orienteering problem. Journal of Heuristics, 13(1), 49\u201376.","journal-title":"Journal of Heuristics"},{"key":"14_CR2","unstructured":"Bonnefoy, L. (2010). L\u2019optimisation par essaims particulaires appliqu\u00e9e au team orienteering problem. Preprint available at: \n                  http:\/\/ludovicbonnefoy.files.wordpress.com\/2010\/10\/majecstic2010.pdf\n                  \n                ."},{"issue":"1","key":"14_CR3","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. 4OR, 8(1), 49\u201370.","journal-title":"4OR"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S E Butt","year":"1994","unstructured":"Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers & Operations Research, 21(1), 101\u2013111.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"14_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, B. L., & Wasil, E. A. (1996). The team orienteering problem. European journal of operational research, 88(3), 464\u2013474.","journal-title":"European journal of operational research"},{"issue":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I M Chao","year":"1996","unstructured":"Chao, I. M., Golden, B. L., & Wasil, E. A. (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operational Research, 88(3), 475\u2013489.","journal-title":"European Journal of Operational Research"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Dang, D. C., Guibadj, R. N., & Moukrim, A. (2011). A PSO-based memetic algorithm for the team orienteering problem. Applications of Evolutionary Computation, Springer Berlin Heidelberg, 471\u2013480.","DOI":"10.1007\/978-3-642-20520-0_48"},{"issue":"2","key":"14_CR8","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, R. N., & Moukrim, A. (2013). An effective PSO-inspired algorithm for the team orienteering problem. European Journal of Operational Research, 229(2), 332\u2013344.","journal-title":"European Journal of Operational Research"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., & L\u00fcbbecke, M. E. (2005). A primer in column generation, Springer US, 1\u201332.","DOI":"10.1007\/0-387-25486-2_1"},{"issue":"3","key":"14_CR10","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. (1987). The orienteering problem. Naval research logistics, 34(3), 307\u2013318.","journal-title":"Naval research logistics"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Hart, W. E., Krasnogor, N., & Smith, J. E. (Eds.). (2004). Recent advances in memetic algorithms, Springer Science & Business Media, 166.","DOI":"10.1007\/3-540-32363-5"},{"issue":"3","key":"14_CR12","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. Computers & Industrial Engineering, 54(3), 648\u2013665.","journal-title":"Computers & Industrial Engineering"},{"issue":"8","key":"14_CR13","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, A. L. (2013). An augmented large neighborhood search method for solving the team orienteering problem. Expert Systems with Applications, 40(8), 3065\u20133072.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"14_CR14","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. Applied Soft Computing, 13(2), 1064\u20131073.","journal-title":"Applied Soft Computing"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Marinakis, Y., Politis, M., Marinaki, M., & Matsatsinis, N. (2015). A Memetic-GRASP Algorithm for the Solution of the Orienteering Problem. Modelling, Computation and Optimization in Information Systems and Management Sciences, Springer International Publishing, 105\u2013116.","DOI":"10.1007\/978-3-319-18167-7_10"},{"key":"14_CR16","unstructured":"Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Caltech concurrent computation program, C3P Report, 826, 1989."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Moscato, P., & Cotta, C. (2003). A gentle introduction to memetic algorithms. Handbook of metaheuristics, Springer US, 105\u2013144.","DOI":"10.1007\/0-306-48056-5_5"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s12293-011-0071-x","volume":"3","author":"S Muthuswamy","year":"2011","unstructured":"Muthuswamy, S., & Lam, S. (2011). Discrete particle swarm optimization for the team orienteering problem. Memetic Computing, 3(4), 287\u2013303.","journal-title":"Memetic Computing"},{"issue":"3","key":"14_CR19","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D J Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D. J., Stearns, R. E., & Lewis, II, P. M. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM journal on computing, 6(3), 563\u2013581.","journal-title":"SIAM journal on computing"},{"issue":"11","key":"14_CR20","first-page":"1853","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau, W., Vansteenwegen, P., Berghe, G. V., & Van Oudheusden, D. (2010). A path relinking approach for the team orienteering problem.Computers & Operations Research, 37(11), 1853\u20131859.","journal-title":"Operations Research"},{"issue":"10","key":"14_CR21","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., Berghe, G. V.,& Oudheusden, D. V. (2008). A personalized tourist trip design algorithm for mobile tourist guides. Applied Artificial Intelligence, 22(10), 964\u2013985.","journal-title":"Applied Artificial Intelligence"},{"issue":"6","key":"14_CR22","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. Computers & Operations Research, 32(6), 1379\u20131407.","journal-title":"Computers & Operations Research"},{"key":"14_CR23","unstructured":"Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications (Vol. 18). Siam."},{"issue":"1","key":"14_CR24","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. European Journal of Operational Research, 209(1), 1\u201310.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"14_CR25","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, G. V., & Van Oudheusden, D. (2009). A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research, 196(1), 118\u2013127.","journal-title":"European Journal of Operational Research"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G. V., & Van Oudheusden, D. (2009). Metaheuristics for tourist trip planning. Metaheuristics in the Service Industry, Springer Berlin Heidelberg, 15\u201331.","DOI":"10.1007\/978-3-642-00939-6_2"},{"issue":"3","key":"14_CR27","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1057\/ori.2007.17","volume":"20","author":"P Vansteenwegen","year":"2007","unstructured":"Vansteenwegen, P., & Van Oudheusden, D. (2007). The mobile tourist guide: an OR opportunity. OR Insight, 20(3), 21\u201327.","journal-title":"OR Insight"},{"issue":"3","key":"14_CR28","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.amc.2010.01.066","volume":"216","author":"F Y Vincent","year":"2010","unstructured":"Vincent, F. Y., Lin, S. W., & Chou, S. Y. (2010). The museum visitor routing problem. Applied Mathematics and Computation, 216(3), 719\u2013729.","journal-title":"Applied Mathematics and Computation"}],"container-title":["Business and Consumer Analytics: New Ideas"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-06222-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T12:22:48Z","timestamp":1559218968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-06222-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030062217","9783030062224"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-06222-4_14","relation":{},"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"31 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}