{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:42:14Z","timestamp":1761597734681},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10479-016-2278-1","type":"journal-article","created":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T13:17:41Z","timestamp":1470057461000},"page":"519-543","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Evolution-inspired local improvement algorithm solving orienteering problem"],"prefix":"10.1007","volume":"253","author":[{"given":"Krzysztof","family":"Ostrowski","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":"Pawel","family":"Zabielski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,1]]},"reference":[{"issue":"3","key":"2278_CR1","first-page":"164","volume":"1","author":"A Bunglowala","year":"2008","unstructured":"Bunglowala, A., & Singhi, B. M. (2008). A solution to combinatorial optimization problem using memetic algorithms. International Journal of Computer Science and Applications, 1(3), 164\u2013167.","journal-title":"International Journal of Computer Science and Applications"},{"issue":"1","key":"2278_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10479-011-0895-2","volume":"186","author":"AM Campbell","year":"2011","unstructured":"Campbell, A. M., Gendreau, M., & Barrett, T. W. (2011). The orienteering problem with stochastic travel and service times. Annals of Operations Research, 186(1), 61\u201381.","journal-title":"Annals of Operations Research"},{"key":"2278_CR3","doi-asserted-by":"crossref","unstructured":"Campos, V., Marti, R., Sanchez-Oro, J., & Duarte, A. (2014). Grasp with path relinking for the orienteering problem. Journal of the Operational Research Society, 65(12), 1800\u20131813.","DOI":"10.1057\/jors.2013.156"},{"key":"2278_CR4","doi-asserted-by":"crossref","unstructured":"Caserta, M., & Vo, S. (2010). A math-heuristic algorithm for the DNA sequencing problem. Learning and intelligent optimization. Lecture notes in computer science (pp. 25\u201336). Berlin: Springer","DOI":"10.1007\/978-3-642-13800-3_3"},{"key":"2278_CR5","doi-asserted-by":"crossref","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. (1996). A fast and effective heuristic for the orienteering. European Journal of Operational Research, 88, 475\u2013489.","journal-title":"European Journal of Operational Research"},{"key":"2278_CR6","unstructured":"Christofides, N., Mingozzi, A., & Toth, P. (2014). VRP instances. http:\/\/www.bernabe.dorronsoro.es\/vrp\/ . Last. accessed 24 June 2014."},{"key":"2278_CR7","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6, 791\u2013812.","journal-title":"Operations Research"},{"key":"2278_CR8","first-page":"188","volume":"38","author":"D Feillet","year":"2001","unstructured":"Feillet, D., Dejax, P., & Gendreau, M. (2001). Traveling salesman problems with profits. An Overview Transportation Science, 38, 188\u2013205.","journal-title":"An Overview Transportation Science"},{"key":"2278_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T. A., & Resende, M. G. C. (1989). A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"2278_CR10","doi-asserted-by":"crossref","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. (1998). Solving the orienteering problem through branch-and-cut. INFORMS Journal on Computing, 10, 133\u2013148.","journal-title":"INFORMS Journal on Computing"},{"key":"2278_CR11","volume-title":"An additive approach for the optimal solution of the prize-collecting traveling salesman problem, vehicle routing: Methods and Studies","author":"M Fischetti","year":"1988","unstructured":"Fischetti, M., & Toth, P. (1988). An additive approach for the optimal solution of the prize-collecting traveling salesman problem, vehicle routing: Methods and Studies. Amsterdam: Elsevier."},{"key":"2278_CR12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/978-3-642-13803-4_19","volume":"6077","author":"A Garcia","year":"2010","unstructured":"Garcia, A., Arbelaitz, O., Vansteenwegen, P., Souffriau, W., & Linaza, M. T. (2010). Hybrid approach for the public transportation time dependent orienteering problem with time windows. Lecture Notes in Computer Science, 6077, 151\u2013158.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"2278_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas, D., Konstantopoulos, Ch., Mastakas, K., & Pantziou, G. (2014). A survey on algorithmic approaches for solving tourist trip design problems. Journal of Heuristics, 20(3), 291\u2013328.","journal-title":"Journal of Heuristics"},{"issue":"4","key":"2278_CR14","doi-asserted-by":"crossref","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. (1998a). A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32(4), 263\u2013273.","journal-title":"Networks"},{"issue":"2\u20133","key":"2278_CR15","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., & Semet, F. (1998b). A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research, 106(2\u20133), 539\u2013545.","journal-title":"European Journal of Operational Research"},{"key":"2278_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B Golden","year":"1987","unstructured":"Golden, B., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics, 34, 307\u2013318.","journal-title":"Naval Research Logistics"},{"key":"2278_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","volume":"35","author":"B Golden","year":"1988","unstructured":"Golden, B., Wang, Q., & Liu, L. (1988). A multifaceted heuristic for the orienteering problem. Naval Research Logistics, 35, 359\u2013366.","journal-title":"Naval Research Logistics"},{"key":"2278_CR18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stutzle, T. (2009). ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36, 267\u2013306.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2278_CR19","doi-asserted-by":"crossref","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. (2011). Digital ants as the best cicerones for museum visitors. Applied Soft Computing, 11, 111\u2013119.","journal-title":"Applied Soft Computing"},{"key":"2278_CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10852-008-9080-2","volume":"7","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Glover, F., & Laguna, M. (2008). Multi-objective meta-heuristics for the traveling salesman problem with profit. Journal of Mathematical Modelling and Algorithms, 7, 177\u2013195.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2278_CR21","first-page":"28","volume":"243","author":"J Karbowska-Chilinska","year":"2012","unstructured":"Karbowska-Chilinska, J., Koszelew, J., Ostrowski, K., & Zabielski, P. (2012). Genetic algorithm solving orienteering problem in large networks. Frontiers in Artificial Intelligence and Applications, 243, 28\u201338.","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"issue":"4","key":"2278_CR22","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. (1988). An algorithm for single constraint maximum collection problem. Journal of the Operations Research Society of Japan, 31(4), 515\u2013531.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"2278_CR23","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-642-40495-5_36","volume":"8083","author":"J Koszelew","year":"2013","unstructured":"Koszelew, J., & Ostrowski, K. (2013). A genetic algorithm with multiple mutation which solves orienteering problem in large networks. Computational Collective Intelligence Technologies and Applications LNCS, 8083, 356\u2013366.","journal-title":"Computational Collective Intelligence Technologies and Applications LNCS"},{"key":"2278_CR24","unstructured":"Koszelew, J., Piwonska, A., & Zabielski, P. (2010). Official tourist website of the Podlasie region. http:\/\/wycieczka.wrotapodlasia.pl\/\/GenerateWays.aspx . Accessed 24 June 2014"},{"key":"2278_CR25","first-page":"20","volume":"26","author":"G Laporte","year":"1990","unstructured":"Laporte, G., & Martello, S. (1990). The selective travelling salesman problem. Discrete Applied Matheuristics, 26, 20\u2013193.","journal-title":"Discrete Applied Matheuristics"},{"key":"2278_CR26","unstructured":"Mansini, R., Pelizzari, M. Wolfler Calvo, R. (2006). The tour orienteering problem with time windows. In Third international workshop on freight transportation and logistics, Altea (Spagna) (pp. 244\u2013246)."},{"key":"2278_CR27","unstructured":"Ostrowski K. (2013). Dataset network of 908 cities of Poland. http:\/\/p.wi.pb.edu.pl\/sites\/default\/files\/krzysztof-ostrowski\/files\/polska908.txt . Accessed 24 June 2014."},{"key":"2278_CR28","unstructured":"Ostrowski, K. (2014). Comparison of different graph weights representations used to solve the time-dependent orienteering problem. In Trends in contemporary computer science, Podlasie 2014 (pp. 144\u2013154). Bialystok University of Technology Publishing Office."},{"key":"2278_CR29","first-page":"61","volume":"8","author":"K Ostrowski","year":"2011","unstructured":"Ostrowski, K., & Koszelew, J. (2011). The comparison of genetic algorithm which solve orienteering problem using complete and incomplete graph, Zeszyty Naukowe. Politechnika Bialostocka Informatyka, 8, 61\u201377.","journal-title":"Politechnika Bialostocka Informatyka"},{"key":"2278_CR30","doi-asserted-by":"crossref","unstructured":"Piwonska, A, Koszelew, J. (2011). A memetic algorithm for a tour planning in the selective travelling salesman. In Foundations of Intelligent System. LNCS (Vol. 6804, pp. 684\u2013694). Springer.","DOI":"10.1007\/978-3-642-21916-0_72"},{"issue":"3","key":"2278_CR31","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02125403","volume":"63","author":"J-Y Potvin","year":"1996","unstructured":"Potvin, J.-Y. (1996). Genetic algorithms for the traveling salesman problem. Annals of Operations Research, 63(3), 337\u2013370.","journal-title":"Annals of Operations Research"},{"key":"2278_CR32","first-page":"221","volume":"4","author":"C Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Woler Calvo, R., & Woler Calvo R. (2006). Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. Journal of Operational Research, 4, 221\u2013238.","journal-title":"Journal of Operational Research"},{"issue":"2","key":"2278_CR33","doi-asserted-by":"crossref","first-page":"151165","DOI":"10.1016\/0305-0548(91)90086-7","volume":"18","author":"R Ramesh","year":"1991","unstructured":"Ramesh, R., & Brown, K. M. (1991). An efficient four-phase heuristic for the generalized orienteering problem. Computer Operational Research, 18(2), 151165.","journal-title":"Computer Operational Research"},{"issue":"2","key":"2278_CR34","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","volume":"4","author":"R Ramesh","year":"1992","unstructured":"Ramesh, R., Yoon, Y., & Karwan, M. H. (1992). An optimal algorithm for the orienteering tour problem. INFORMS Journal on Computing, 4(2), 155\u2013165.","journal-title":"INFORMS Journal on Computing"},{"key":"2278_CR35","doi-asserted-by":"crossref","unstructured":"Reghioui, M., Prins, C., & Labadi, N. (2007). Grasp with path relinking for the capacitated arc routing problem with time windows. In Lecture Notes of Computer Science (Vol. 4448, pp. 722\u2013731).","DOI":"10.1007\/978-3-540-71805-5_78"},{"key":"2278_CR36","unstructured":"Reinelt, G. (2014). TSPLIB: Library of sample instances for the TSP (and related problems), 1995. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/ . Accessed 24 June 2014."},{"key":"2278_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Greedy randomized adaptive search procedures","author":"MGC Resende","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. Berlin: Kluwer Academic Publishers."},{"issue":"1","key":"2278_CR38","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10479-007-0223-z","volume":"167","author":"S Salhi","year":"2007","unstructured":"Salhi, S., & Nagy, G. (2007). Local improvement in planar facility location using vehicle routing. Annals of Operations Research, 167(1), 287\u2013296.","journal-title":"Annals of Operations Research"},{"key":"2278_CR39","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s11721-009-0029-5","volume":"3","author":"M Schilde","year":"2009","unstructured":"Schilde, M., Doerner, K., Hartl, R., & Kiechle, G. (2009). Metaheuristics for the biobjective orienteering problem. Swarm Intelligence, 3, 179\u2013201.","journal-title":"Swarm Intelligence"},{"key":"2278_CR40","doi-asserted-by":"crossref","unstructured":"Sevkli, Z., Sevilgen, E. (2010). Discrete particle swarm optimization for the orienteering problem, Evolutionary Computation (CEC) IEEE Congress (pp. 1\u20138).","DOI":"10.1109\/CEC.2010.5586532"},{"key":"2278_CR41","unstructured":"Souffriau, W. (2010). Automated tourist decision support. PhD Thesis. Katholieke Universiteit Leuven."},{"key":"2278_CR42","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau, W., Vansteenwegen, P., Vanden Berghe, G., & Van Oudheusden, D. (2010). A path relinking approach for the team orienteering problem. Computers and Operational Research, 37, 1853\u20131859.","journal-title":"Computers and Operational Research"},{"issue":"6","key":"2278_CR43","doi-asserted-by":"crossref","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 and Operational Research, 32(6), 1379\u20131407.","journal-title":"Computers and Operational Research"},{"issue":"2","key":"2278_CR44","first-page":"20","volume":"4","author":"MF Tasgetiren","year":"2002","unstructured":"Tasgetiren, M. F. (2002). A genetic algorithm with an adaptive penalty function for the orienteering problem. Journal of Economic and Social Research, 4(2), 20\u201340.","journal-title":"Journal of Economic and Social Research"},{"key":"2278_CR45","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/CEC.2000.870784","volume":"2","author":"MF Tasgetiren","year":"2000","unstructured":"Tasgetiren, M. F., & Smith, A. E. (2000). A genetic algorithm for the orienteering problem. Proceedings of the 2000 Congress on Evolutionary Computation San Diego, 2, 1190\u20131195.","journal-title":"Proceedings of the 2000 Congress on Evolutionary Computation San Diego"},{"issue":"9","key":"2278_CR46","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T. (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society, 35(9), 797\u2013809.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"2278_CR47","first-page":"21","volume":"20","author":"P Vansteenwegen","year":"2007","unstructured":"Vansteenwegen, P., & Van Oudheusden, D. (2007). The mobile tourist guide: An or opportunity. Operational Research Insight, 20(3), 21\u201327.","journal-title":"Operational Research Insight"},{"key":"2278_CR48","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2009a). A guided local search metaheuristic for the team orienteering problem. European Journal of Operational Research, 196, 118\u2013127.","journal-title":"European Journal of Operational Research"},{"key":"2278_CR49","doi-asserted-by":"crossref","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. (2009b). Iterated local search for the team orienteering problem with time windows. Computers and Operational Research, 36, 3281\u20133290.","journal-title":"Computers and Operational Research"},{"issue":"1","key":"2278_CR50","doi-asserted-by":"crossref","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. (2011a). The orienteering problem: A survey. European Journal of Operational Research, 209(1), 1\u201310.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2278_CR51","doi-asserted-by":"crossref","first-page":"6540","DOI":"10.1016\/j.eswa.2010.11.085","volume":"38","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., & Van Oudheusden, D. (2011b). The city trip planner: An expert system for tourists. Expert Systems with Applications, 38(6), 6540\u20136546.","journal-title":"Expert Systems with Applications"},{"issue":"2","key":"2278_CR52","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.ejor.2013.11.038","volume":"236","author":"C Verbeeck","year":"2014","unstructured":"Verbeeck, C., Aghezzafa, E. H., Srensenb, K., & Vansteenwegena, P. (2014). A fast solution method for the time-dependent orienteering problem. European Journal of Operational Research, 236(2), 419\u2013432.","journal-title":"European Journal of Operational Research"},{"key":"2278_CR53","first-page":"111120","volume":"61","author":"Q Wang","year":"2008","unstructured":"Wang, Q., Sun, X., Golden, B. L., & Jia, J. (2008). Using artificial neural networks to solve the orienteering problem. Annals of Operations Research, 61, 111120.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2278_CR54","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10479-010-0763-5","volume":"192","author":"Ch Zhu","year":"2010","unstructured":"Zhu, Ch., Hu, J. Q., Xu, Y., & Cao, R. (2010). On the tour planning problem. Annals of Operations Research, 192(1), 67\u201386.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2278-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2278-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2278-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2278-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T21:26:42Z","timestamp":1568237202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2278-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["2278"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2278-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,1]]}}}