{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:39:17Z","timestamp":1762429157114},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,15]],"date-time":"2011-10-15T00:00:00Z","timestamp":1318636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s12293-011-0071-x","type":"journal-article","created":{"date-parts":[[2011,10,14]],"date-time":"2011-10-14T03:52:54Z","timestamp":1318564374000},"page":"287-303","source":"Crossref","is-referenced-by-count":32,"title":["Discrete particle swarm optimization for the team orienteering problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Shanthi","family":"Muthuswamy","sequence":"first","affiliation":[]},{"given":"Sarah S.","family":"Lam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,15]]},"reference":[{"issue":"1","key":"71_CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2007.10.044","volume":"193","author":"D Anghinolfi","year":"2009","unstructured":"Anghinolfi D, Paolucci M (2009) A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times. Eur J Oper Res 193(1): 73\u201385","journal-title":"Eur J Oper Res"},{"key":"71_CR2","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 MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13: 49\u201376","journal-title":"J Heuristics"},{"issue":"1","key":"71_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"H Bouly","year":"2010","unstructured":"Bouly H, Dang D, Moukrim A (2010) A memetic algorithm for the team orienteering problem. 4OR 8(1): 49\u201370","journal-title":"4OR"},{"key":"71_CR4","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: 211\u2013230","journal-title":"4OR"},{"issue":"1","key":"71_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt SE, Cavalier TM (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21(1): 101\u2013111","journal-title":"Comput Oper Res"},{"key":"71_CR6","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"S Butt","year":"1999","unstructured":"Butt S, Ryan D (1999) An optimal solution procedure for the multiple path maximum collection problem using column generation. Comput Oper Res 26: 427\u2013441","journal-title":"Comput Oper Res"},{"key":"71_CR7","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao IM, Golden BL, Wasil EA (1996) The team orienteering problem. Eur J Oper Res 88: 464\u2013474","journal-title":"Eur J Oper Res"},{"key":"71_CR8","unstructured":"Dallard H, Lam S, Kulturel-Konak S (2006) A particle swarm optimization approach to the orienteering problem. In: Proc Ind Eng Res Conf Orlando, FL"},{"key":"71_CR9","doi-asserted-by":"crossref","unstructured":"Dallard H, Lam S, Kulturel-Konak S (2007) Solving the orienteering problem using attractive and repulsive particle swarm optimization. In: Int Conf Inf Reuse Integration Las Vegas, NV","DOI":"10.1109\/IRI.2007.4296590"},{"key":"71_CR10","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":"BL Golden","year":"1987","unstructured":"Golden BL, Levy L, Vohra R (1987) The orienteering problem. Navig Res Log 34: 307\u2013318","journal-title":"Navig Res Log"},{"key":"71_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","volume":"354","author":"BL Golden","year":"1988","unstructured":"Golden BL, Wang Q, Liu L (1988) A multifaceted heuristic for the orienteering problem. Navig Res Log 354: 359\u2013366","journal-title":"Navig Res Log"},{"issue":"1","key":"71_CR12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"B Hermann","year":"2010","unstructured":"Hermann B, Duc-Cuong D, Aziz M (2010) A memetic algorithm for the team orienteering problem. 4OR Q J Oper Res 8(1): 49\u201370","journal-title":"4OR Q J Oper Res"},{"key":"71_CR13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.amc.2007.03.010","volume":"192","author":"B Jarboui","year":"2007","unstructured":"Jarboui B, Cheikh M, Siarry P, Rebai A (2007) Combinatorial particle swarm optimization (CPSO) for partitional clustering problem. Appl Math Comp 192: 337\u2013345","journal-title":"Appl Math Comp"},{"key":"71_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/j.amc.2007.04.096","volume":"195","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comp 195: 299\u2013308","journal-title":"Appl Math Comp"},{"key":"71_CR15","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.cie.2007.09.006","volume":"54","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Ibrahim S, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving permutation flowshop problems. Comput Ind Eng 54: 526\u2013538","journal-title":"Comput Ind Eng"},{"key":"71_CR16","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.epsr.2006.02.016","volume":"77","author":"YX Jin","year":"2007","unstructured":"Jin YX, Cheng HZ, Yan JY, Zhang L (2007) New discrete method for particle swarm optimization and its application in transmission network expansion planning. Electr Power Syst Res 77: 227\u2013233","journal-title":"Electr Power Syst Res"},{"issue":"3","key":"71_CR17","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","journal-title":"Comput Ind Eng"},{"key":"71_CR18","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc IEEE Intl Conf Neur Net, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"71_CR19","doi-asserted-by":"crossref","first-page":"1008","DOI":"10.1016\/j.amc.2006.05.168","volume":"183","author":"A Lian","year":"2006","unstructured":"Lian A, Jiao B, Gu X (2006) A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Appl Math Comp 183: 1008\u20131017","journal-title":"Appl Math Comp"},{"key":"71_CR20","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1016\/j.chaos.2006.05.082","volume":"35","author":"Z Lian","year":"2008","unstructured":"Lian Z, Gu X, Jia B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solitons Fractals 35: 851\u2013861","journal-title":"Chaos Solitons Fractals"},{"key":"71_CR21","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35: 2807\u20132839","journal-title":"Comput Oper Res"},{"key":"71_CR22","doi-asserted-by":"crossref","unstructured":"Pang W, Wang KP, Zhou CG, Dong LJ (2004) Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In: Proc Fourth Intl Conf Comp Info Tech, pp 796\u2013800","DOI":"10.1109\/CIT.2004.1357292"},{"key":"71_CR23","doi-asserted-by":"crossref","unstructured":"Sevkli Z, Sevilgen FE (2006) Variable neighborhood search for the orienteering problem. In: Proc Intl Symp Comp Info Sci Istanbul, Turkey","DOI":"10.1007\/11902140_16"},{"key":"71_CR24","unstructured":"Sevkli Z, Sevilgen FE, Keles O (2007) Particle swarm optimization for the orienteering problem. In: Int Symp Innov Intel Sys App Istanbul, Turkey"},{"key":"71_CR25","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proc Cong Evol Comp, pp 1945\u20131950","DOI":"10.1109\/CEC.1999.785511"},{"issue":"11","key":"71_CR26","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, Berghe GV, Van OD (2010) A path relinking approach for the team orienteering problem. Comput Oper Res 37(11): 1853\u20131859","journal-title":"Comput Oper Res"},{"key":"71_CR27","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":"71_CR28","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177: 930\u2013947","journal-title":"Eur J Oper Res"},{"issue":"2","key":"71_CR29","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.ejor.2007.08.030","volume":"191","author":"CT Tseng","year":"2008","unstructured":"Tseng CT, Liao CJ (2008) A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. Eur J Oper Res 191(2): 360\u2013373","journal-title":"Eur J Oper Res"},{"issue":"9","key":"71_CR30","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. J Oper Res Soc 35(9): 797\u2013809","journal-title":"J Oper Res Soc"},{"issue":"1","key":"71_CR31","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 GV, Oudheusden DV (2009) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1): 118\u2013127","journal-title":"Eur J Oper Res"},{"key":"71_CR32","doi-asserted-by":"crossref","unstructured":"Venter G, Sobieski J (2002) Particle swarm optimization. 43rd AIAA\/ASME\/ASCE\/AHS\/ASC Struc, Struct Dyn, Mtl Conf Denver, CO","DOI":"10.2514\/6.2002-1235"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-011-0071-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-011-0071-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T09:55:40Z","timestamp":1560765340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-011-0071-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,15]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["71"],"URL":"https:\/\/doi.org\/10.1007\/s12293-011-0071-x","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,15]]}}}