{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:18:09Z","timestamp":1773789489321,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,7]],"date-time":"2009-01-07T00:00:00Z","timestamp":1231286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s10288-008-0094-4","type":"journal-article","created":{"date-parts":[[2009,1,6]],"date-time":"2009-01-06T13:06:11Z","timestamp":1231247171000},"page":"49-70","source":"Crossref","is-referenced-by-count":82,"title":["A memetic algorithm for the team orienteering problem"],"prefix":"10.1007","volume":"8","author":[{"given":"Hermann","family":"Bouly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc-Cuong","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,1,7]]},"reference":[{"issue":"1","key":"94_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2006","unstructured":"Archetti C, Hertz A, Speranza M (2006) Metaheuristics for the team orienteering problem. J Heuristics 13(1): 49\u201376","journal-title":"J Heuristics"},{"key":"94_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley JE (1983) Route-first cluster-second methods for vehicle routing. Omega 11: 403\u2013408","journal-title":"Omega"},{"issue":"12","key":"94_CR3","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1016\/j.cor.2005.02.009","volume":"33","author":"J-M Belenguer","year":"2006","unstructured":"Belenguer J-M, Benavent E, Lacomme P, Prins C (2006) Lower and upper bounds for the mixed capacitated arc routing problem. Comput Oper Res 33(12): 3363\u20133383","journal-title":"Comput Oper Res"},{"key":"94_CR4","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic Programming. Princeton University Press, Princeton"},{"key":"94_CR5","doi-asserted-by":"crossref","unstructured":"Bouly H, Dang D-C, Moukrim A (2008) A memetic algorithm for the team orienteering problem. In EvoWorkshops","DOI":"10.1007\/978-3-540-78761-7_71"},{"issue":"3","key":"94_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 (2007) An exact algorithm for team orienteering problems. 4OR 5(3): 211\u2013230","journal-title":"4OR"},{"key":"94_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S Butt","year":"1994","unstructured":"Butt S, Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21: 101\u2013111","journal-title":"Comput Oper Res"},{"key":"94_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, Wasil E (1996) The team orienteering problem. Eur J Oper Res 88: 464\u2013474","journal-title":"Eur J Oper Res"},{"issue":"2","key":"94_CR9","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 (2005) Traveling salesman problems with profits. Transp Sci 39(2): 188\u2013205","journal-title":"Transp Sci"},{"issue":"3","key":"94_CR10","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 (2008) Ants can solve the team orienteering problem. Comput Ind Eng 54(3): 648\u2013665 ISSN 0360-8352","journal-title":"Comput Ind Eng"},{"key":"94_CR11","unstructured":"Khemakhem M, Chabchoub H, Semet F (2007) Heuristique bas\u00e9e sur la m\u00e9moire adaptative pour le probl\u00e8me de tourn\u00e9es de v\u00e9hicules s\u00e9lectives. In Logistique & Transport, pp 31\u201337, Sousse, Tunisie"},{"issue":"1\u20134","key":"94_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P Lacomme","year":"2004","unstructured":"Lacomme P, Prins C, Ramdane-Cherif W (2004) Competitive memetic algorithms for arc routing problems. Ann Oper Res 131(1\u20134): 159\u2013185","journal-title":"Ann Oper Res"},{"key":"94_CR13","first-page":"219","volume-title":"New ideas in optimization. chapter Memetic Algorithms: a short introduction","author":"P Moscato","year":"1999","unstructured":"Moscato P (1999) New ideas in optimization. chapter Memetic Algorithms: a short introduction. McGraw-Hill, UK, pp 219\u2013234"},{"issue":"12","key":"94_CR14","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12): 1985\u20132002","journal-title":"Comput Oper Res"},{"key":"94_CR15","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"T Ruiz R St\u00fctzle","year":"2007","unstructured":"Ruiz R St\u00fctzle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. EJOR 177: 2033\u20132049","journal-title":"EJOR"},{"key":"94_CR16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"94_CR17","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. Comput Oper Res 32: 1379\u20131407","journal-title":"Comput Oper Res"},{"key":"94_CR18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0377-2217(85)90252-8","volume":"22","author":"G Ulusoy","year":"1985","unstructured":"Ulusoy G (1985) The fleet size and mixed problem for capacitated arc routing. Eur J Oper Res 22: 329\u2013337","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0094-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-008-0094-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-008-0094-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:56Z","timestamp":1559131976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-008-0094-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,7]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s10288-008-0094-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,7]]}}}