{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:20:51Z","timestamp":1743114051267,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319157047"},{"type":"electronic","value":"9783319157054"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15705-4_4","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T05:21:23Z","timestamp":1426483283000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Genetic Algorithm with Grouping Selection and Searching Operators for the Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Pawel","family":"Zabielski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joanna","family":"Karbowska-Chilinska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jolanta","family":"Koszelew","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Ostrowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"4_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.: Metaheuristics for team orienteering problem. Journal of Heuristics 13, 49\u201376 (2007)","journal-title":"Journal of Heuristics"},{"key":"4_CR2","first-page":"797","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19, 797\u2013809 (1989)","journal-title":"Networks"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering. European Journal of Operational Research 88, 475\u2013489 (1996)","journal-title":"European Journal of Operational Research"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing 10, 133\u2013148 (1998)","journal-title":"INFORMS Journal on Computing"},{"key":"4_CR5","first-page":"188","volume":"38","author":"D Feillet","year":"2001","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems With Profits: An Overview. Transportation Science 38, 188\u2013205 (2001)","journal-title":"Transportation Science"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-13803-4_19","volume-title":"Hybrid Artificial Intelligence Systems","author":"A Garcia","year":"2010","unstructured":"Garcia, A., Arbelaitz, O., Vansteenwegen, P., Souffriau, W., Linaza, M.T.: Hybrid approach for the public transportation time dependent orienteering problem with time windows. In: Corchado, E., Gra\u00f1a Romay, M., Manhaes Savio, A. (eds.) HAIS 2010, Part II. LNCS, vol. 6077, pp. 151\u2013158. Springer, Heidelberg (2010)"},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks 32(4), 263\u2013273 (1998)","journal-title":"Networks"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.asoc.2009.11.002","volume":"11","author":"J Jaen","year":"2011","unstructured":"Jaen, J., Mocholi, J.A., Catala, A.: Digital ants as the best cicerones for museum visitors. Applied Soft Computing 11, 111\u2013119 (2011)","journal-title":"Applied Soft Computing"},{"key":"4_CR9","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 Matheuristics 26, 193\u2013207 (1990)","journal-title":"Discrete Applied Matheuristics"},{"key":"4_CR10","first-page":"28","volume":"243","author":"J Karbowska-Chilinska","year":"2012","unstructured":"Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K., Zabielski, P.: Genetic algorithm solving orienteering problem in large networks. Frontiers in Artificial Intelligence and Applications 243, 28\u201338 (2012)","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"issue":"4","key":"4_CR11","doi-asserted-by":"crossref","first-page":"515","DOI":"10.15807\/jorsj.31.515","volume":"31","author":"S Kataoka","year":"1988","unstructured":"Kataoka, S., Morito, S.: An algorithm for single constraint maximum collection problem. Journal of the Operations Research Society of Japan 31(4), 515\u201331 (1988)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/978-3-642-21916-0_72","volume-title":"Foundations of Intelligent Systems","author":"A Piwo\u0144ska","year":"2011","unstructured":"Piwo\u0144ska, A., Koszelew, J.: A memetic algorithm for a tour planning in the selective travelling salesman problem on a road network. In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Ra\u015b, Z.W. (eds.) ISMIS 2011. LNCS, vol. 6804, pp. 684\u2013694. Springer, Heidelberg (2011)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Sevkli, Z., Sevilgen, E.: Discrete particle swarm optimization for the orienteering Problem. In: Evolutionary Computation (CEC) IEEE Congress, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586532"},{"issue":"6","key":"4_CR14","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.: A tabu search heuristic for the team orienteering problem. Computers & Operational Research 32(6), 1379\u20131407 (2005)","journal-title":"Computers & Operational Research"},{"issue":"9","key":"4_CR15","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797\u2013809 (1984)","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"4_CR16","first-page":"20","volume":"4","author":"MF Tasgetiren","year":"2002","unstructured":"Tasgetiren, M.F.: A genetic algorithm with an adaptive penalty function for the orienteering problem. Journal of Economic and Social Research 4(2), 20\u201340 (2002)","journal-title":"Journal of Economic and Social Research"},{"key":"4_CR17","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., Van Oudheusden, D.: A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research. 196, 118\u2013127 (2009)","journal-title":"European Journal of Operational Research."},{"key":"4_CR18","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., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operational Research 36, 3281\u20133290 (2009)","journal-title":"Computers & Operational Research"},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The City Trip Planner: An expert system for tourists. Expert Systems with Applications 38(6), 6540\u20136546 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"4_CR20","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 209(1), 1\u201310 (2011)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15705-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:41:28Z","timestamp":1676932888000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15705-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319157047","9783319157054"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15705-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}