{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T18:30:36Z","timestamp":1776277836370,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T00:00:00Z","timestamp":1292976000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10732-010-9153-z","type":"journal-article","created":{"date-parts":[[2010,12,21]],"date-time":"2010-12-21T17:50:08Z","timestamp":1292953808000},"page":"729-753","source":"Crossref","is-referenced-by-count":69,"title":["Hybridized evolutionary local search algorithm for\u00a0the\u00a0team orienteering problem with time windows"],"prefix":"10.1007","volume":"17","author":[{"given":"Nacima","family":"Labadie","sequence":"first","affiliation":[]},{"given":"Jan","family":"Melechovsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Wolfler\u00a0Calvo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,22]]},"reference":[{"issue":"1","key":"9153_CR1","doi-asserted-by":"crossref","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.: Metaheuristics for the team orienteering problem. J. Heuristics 13(1), 49\u201376 (2007)","journal-title":"J. Heuristics"},{"key":"9153_CR2","unstructured":"Balas, E., Martin, G.: Roll-a-round: Software package for scheduling the rounds of a rolling mill. Copyright Balas and Martin Associates (1985)"},{"key":"9153_CR3","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/trsc.1090.0305","volume":"44","author":"J.M. Belenguer","year":"2010","unstructured":"Belenguer, J.M., Benavent, E., Labadi, N., Prins, C., Reghioui, M.: Split delivery capacitated arc routing problem: lower bound and metaheuristic. Transp. Sci. 44, 206\u2013220 (2010)","journal-title":"Transp. Sci."},{"issue":"2","key":"9153_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/050645464","volume":"37","author":"A. Blum","year":"2007","unstructured":"Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward tsp. SIAM J. Comput. 37(2), 653\u2013670 (2007)","journal-title":"SIAM J. Comput."},{"key":"9153_CR5","doi-asserted-by":"crossref","unstructured":"Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR. Published online (2009)","DOI":"10.1007\/s10288-008-0094-4"},{"issue":"3","key":"9153_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10288-006-0009-1","volume":"5","author":"S. Boussier","year":"2007","unstructured":"Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR 5(3), 211\u2013230 (2007)","journal-title":"4OR"},{"issue":"3","key":"9153_CR7","doi-asserted-by":"crossref","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.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88(3), 475\u2013489 (1996a)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9153_CR8","doi-asserted-by":"crossref","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.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996b)","journal-title":"Eur. J. Oper. Res."},{"key":"9153_CR9","first-page":"661","volume-title":"Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, SODA \u201908","author":"C. Chekuri","year":"2008","unstructured":"Chekuri, C., Korula, N., P\u00e1l, M.: Improved algorithms for orienteering and related problems. In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, SODA \u201908, Philadelphia, PA, USA, pp. 661\u2013670 (2008)"},{"key":"9153_CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1145\/1137856.1137893","volume-title":"Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG \u201906","author":"K. Chen","year":"2006","unstructured":"Chen, K., Har-Peled, S.: The orienteering problem in the plane revisited. In: Proceedings of the Twenty-Second Annual Symposium on Computational Geometry, SCG \u201906, pp. 247\u2013254. ACM, New York (2006)"},{"issue":"2","key":"9153_CR11","doi-asserted-by":"crossref","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 30(2), 105\u2013119 (1997)","journal-title":"Networks"},{"issue":"1","key":"9153_CR12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0377-2217(99)00323-9","volume":"127","author":"R. Deitch","year":"2000","unstructured":"Deitch, R., Ladany, S.P.: The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm. Eur. J. Oper. Res. 127(1), 69\u201377 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9153_CR13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1111\/j.1475-3995.1995.tb00023.x","volume":"2","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., V\u00e4rbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297\u2013308 (1995)","journal-title":"Int. Trans. Oper. Res."},{"key":"9153_CR14","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software in a fortran environment. Tech. rep., Electrical Engineering and Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301, http:\/\/www.netlib.org\/benchmark\/performance.ps (2009)"},{"issue":"2","key":"9153_CR15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D. Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"key":"9153_CR16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9153_CR17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-1-4615-4567-5_5","volume-title":"Computing Tools for Modeling, Optimization and Simulation (Interfaces in Computer Science and Operations Research)","author":"A. Fink","year":"2000","unstructured":"Fink, A., Schneidereit, G., Vo\u00df, S.: Solving general ring network design problems by meta-heuristics. In: Laguna, M., Velarde, J.G. (eds.) Computing Tools for Modeling, Optimization and Simulation (Interfaces in Computer Science and Operations Research), pp. 91\u2013113. Kluwer, Boston (2000)"},{"key":"9153_CR18","first-page":"319","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Fischetti","year":"1988","unstructured":"Fischetti, M., Toth, P.: An additive approach for the optimal solution of the prize-collecting traveling salesman problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 319\u2013343. Elsevier, Amsterdam (1988)"},{"issue":"2","key":"9153_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M. Fischetti","year":"1998","unstructured":"Fischetti, M., Gonzalez, J.J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS J. Comput. 10(2), 133\u2013148 (1998)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"9153_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0020-0190(01)00313-1","volume":"83","author":"F.V. Fomin","year":"2002","unstructured":"Fomin, F.V., Lingas, A.: Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2), 57\u201362 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"2\u20133","key":"9153_CR21","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.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106(2\u20133), 539\u2013545 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9153_CR22","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.L. Golden","year":"1987","unstructured":"Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. 34(3), 307\u2013456 (1987)","journal-title":"Nav. Res. Logist."},{"issue":"3","key":"9153_CR23","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.L. Golden","year":"1988","unstructured":"Golden, B.L., Wang, Q., Liu, L.: A multifaceted heuristic for the orienteering problem. Nav. Res. Logist. 35(3), 359\u2013366 (1988)","journal-title":"Nav. Res. Logist."},{"issue":"6","key":"9153_CR24","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"M.G. Kantor","year":"1992","unstructured":"Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc. 43(6), 629\u2013635 (1992)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9153_CR25","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0377-2217(96)00309-8","volume":"104","author":"S. Kataoka","year":"1998","unstructured":"Kataoka, S., Yamada, T., Morito, S.: Minimum directed 1-subtree relaxation for score orienteering problem. Eur. J. Oper. Res. 104(1), 139\u2013153 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9153_CR26","doi-asserted-by":"crossref","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.: Ants can solve the team orienteering problem. Comput. Ind. Eng. 54(3), 648\u2013665 (2008)","journal-title":"Comput. Ind. Eng."},{"key":"9153_CR27","first-page":"311","volume-title":"Local Search in Combinatorial Optimization","author":"G.A.P. Kindervater","year":"1997","unstructured":"Kindervater, G.A.P., Savelsbergh, M.W.P.: Vehicle routing: handling edge exchanges. In: Aarts, E., Lenstra, J. (eds.) Local Search in Combinatorial Optimization, pp. 311\u2013336. Wiley, New York (1997)"},{"issue":"2\u20133","key":"9153_CR28","doi-asserted-by":"crossref","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 Appl. Math. 26(2\u20133), 193\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"key":"9153_CR29","volume-title":"Odysseus 2006\u2014Third International Workshop on Freight Transportation and Logistics","author":"R. Mansini","year":"2006","unstructured":"Mansini, R., Pelizzari, M., Wolfler-Calvo, R.: The tour orienteering problem with time windows. In: Odysseus 2006\u2014Third International Workshop on Freight Transportation and Logistics. Altea Spain, Universitat de Val\u00e8ncia, May 23\u201326 (2006)"},{"key":"9153_CR30","first-page":"1","volume-title":"Lecture notes in computer science","author":"P. Merz","year":"2007","unstructured":"Merz, P., Wolf, S.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., et al. (ed.) Lecture notes in computer science, vol. 4771, pp. 1\u201315 Springer, Berlin (2007)"},{"key":"9153_CR31","unstructured":"Montemanni, R., Gambardella, L.M.: Ant colony system for team orienteering problem with time windows. Foundations of Computing and Decision Sciences (34) (2009)"},{"key":"9153_CR32","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-540-85152-3_2","volume-title":"Bio-inspired algorithms for the vehicle routing problem","author":"C. Prins","year":"2009","unstructured":"Prins, C.: A grasp x evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F., Tavares, J. (eds.) Bio-inspired algorithms for the vehicle routing problem, vol. 16, pp. 35\u201353. Springer, Berlin (2009)"},{"issue":"4","key":"9153_CR33","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.cor.2008.01.003","volume":"36","author":"G. Righini","year":"2009","unstructured":"Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36(4), 1191\u20131203 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9153_CR34","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.F., Hartl, R.F., Kiechle, G.: Metaheuristics for the bi-objective orienteering problem. Swarm Intell. 3(3), 179\u2013201 (2009)","journal-title":"Swarm Intell."},{"key":"9153_CR35","series-title":"Variable neighborhood search for the orienteering problem","first-page":"134","volume-title":"Lecture Notes in Computer Science","author":"Z. Sevkli","year":"2006","unstructured":"Sevkli, Z., Sevilgen, E.: Computer and information sciences\u2014ISCIS 2006. In: Lecture Notes in Computer Science. Variable neighborhood search for the orienteering problem, vol. 4263, pp. 134\u2013143. Springer, Berlin (2006)"},{"key":"9153_CR36","doi-asserted-by":"crossref","unstructured":"Silberholz, J., Golden, B.L.: The effective application of a new approach to the generalized orienteering problem. Journal of Heuristics published online (2009)","DOI":"10.1007\/s10732-009-9104-8"},{"key":"9153_CR37","doi-asserted-by":"crossref","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 problem with time window constraints. 4OR 35, 254\u2013265 (1987)","journal-title":"4OR"},{"key":"9153_CR38","doi-asserted-by":"crossref","unstructured":"Souffriau, W., Vansteenwegen, P., Berghe, G.V., Oudheusden, D.V.: A path relinking approach for the team orienteering problem. Comput. Oper. Res. In Press (2009)","DOI":"10.1016\/j.cor.2009.05.002"},{"issue":"6","key":"9153_CR39","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.: A tabu search heuristic for the team orienteering problem. Comput. Oper. Res. 32(6), 1379\u20131407 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9153_CR40","first-page":"1","volume":"4","author":"M.F. Tasgetiren","year":"2001","unstructured":"Tasgetiren, M.F.: A genetic algorithm with an adaptive penalty function for the orienteering problem. J. Econ. Soc. Res. 4(2), 1\u201326 (2001)","journal-title":"J. Econ. Soc. Res."},{"issue":"2","key":"9153_CR41","doi-asserted-by":"crossref","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. Comput. Oper. Res. 37(2), 351\u2013367 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9153_CR42","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T. Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. Am. 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc. Am."},{"issue":"1","key":"9153_CR43","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., Berghe, G.V., Oudheusden, D.V.: A guided local search metaheuristic for the team orienteering problem. Eur. J. Oper. Res. 196(1), 118\u2013127 (2009a)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"9153_CR44","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., Berghe, G.V., Oudheusden, D.V.: Iterated local search for the team orienteering problem with time windows. Comput. Oper. Res. 36(12), 3281\u20133290 (2009b)","journal-title":"Comput. Oper. Res."},{"key":"9153_CR45","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-00939-6_2","volume-title":"Metaheuristics in the Service Industry","author":"P. Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Berghe, G.V., Oudheusden, D.V.: Metaheuristics for tourist trip planning. In: S\u00f6rensen, K., Sevaux, M., Habenicht, W., Geiger, M.J. (eds.) Metaheuristics in the Service Industry. Lecture Notes in Economics and Mathematical Systems, vol. 624, pp. 15\u201331. Springer, Berlin (2009c)"},{"key":"9153_CR46","unstructured":"Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: A survey. Euro. J. Oper. Res. In Press (2010)"},{"key":"9153_CR47","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-0-387-77778-8_12","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges, Springer US","author":"X. Wang","year":"2008","unstructured":"Wang, X., Golden, B.L., Wasil, E.A.: Using a genetic algorithm to solve the generalized orienteering problem. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, Springer US. Operations Research\/Computer Science Interfaces Series, vol. 43, pp. 263\u2013274 (2008)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9153-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9153-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9153-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T06:57:30Z","timestamp":1559890650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9153-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,22]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9153"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9153-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,22]]}}}