{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:31:46Z","timestamp":1759336306345},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T00:00:00Z","timestamp":1446595200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10489-015-0718-2","type":"journal-article","created":{"date-parts":[[2015,11,4]],"date-time":"2015-11-04T05:52:12Z","timestamp":1446616332000},"page":"665-686","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Group mosquito host-seeking algorithm"],"prefix":"10.1007","volume":"44","author":[{"given":"Xiang","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoting","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiqun","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,4]]},"reference":[{"issue":"1","key":"718_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/MIS.2004.1265873","volume":"19","author":"N Shadbolt","year":"2004","unstructured":"Shadbolt N. (2004) Nature-Inspired Computing. IEEE Intell Syst 19(1):1\u20132","journal-title":"IEEE Intell Syst"},{"issue":"11","key":"718_CR2","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1038\/msb.2011.78","volume":"7","author":"Navlakha S","year":"2011","unstructured":"Navlakha S, Bar-Joseph Z (2011) Algorithms in nature: the convergence of systems biology and computational thinking. Mol Syst Biol 7(11):546\u2013549. (Nature Publishing Group)","journal-title":"Mol Syst Biol"},{"issue":"10","key":"718_CR3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1088\/0034-4885\/74\/10\/104401","volume":"74","author":"I Buluta","year":"2011","unstructured":"Buluta I, Ashhab S, Nori F (2011) Natural and artificial atoms for quantum computation. Rep Prog Phys 74(10):104\u2013107","journal-title":"Rep Prog Phys"},{"issue":"3","key":"718_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1063\/1.3634009","volume":"21","author":"J Machta","year":"2011","unstructured":"Machta J (2011) Natural complexity, computational complexity and depth. CHAOS 21(3):111\u2013114","journal-title":"CHAOS"},{"issue":"1","key":"718_CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/s10489-014-0640-z","volume":"43","author":"L Hong","year":"2015","unstructured":"Hong L, Peng Z, Bin H (2015) A novel approach to task assignment in a cooperative multi-agent design system. Appl Intell 43(1):162\u2013175","journal-title":"Appl Intell"},{"issue":"7","key":"718_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1272516.1272529","volume":"50","author":"P Denning","year":"2007","unstructured":"Denning P (2007) Computing is a natural science. Commun ACM 50(7):13\u201318","journal-title":"Commun ACM"},{"issue":"6","key":"718_CR7","first-page":"697","volume":"23","author":"J Li","year":"2008","unstructured":"Li J, Chi Z, Wan D (2008) Parallel genetic algorithm based on fine-grained model with GPU-accelerated. Control and Decision 23(6):697\u2013700","journal-title":"Control and Decision"},{"issue":"8","key":"718_CR8","first-page":"1132","volume":"14","author":"J Li","year":"2009","unstructured":"Li J, Hu X, Pang Z, Qian K (2009) A parallel ant colony optimization algorithm based on fine-grained model with GPU-accelerated. Control and Decision 14(8):1132\u20131136","journal-title":"Control and Decision"},{"key":"718_CR9","doi-asserted-by":"crossref","unstructured":"Acan A (2002) GAACO: A GA +ACO hybrid for faster and better search capability. In: Proceedings of International Workshop on Ant Algorithms, Brussels, Belgium, pp 15\u201326","DOI":"10.1007\/3-540-45724-0_35"},{"key":"718_CR10","doi-asserted-by":"crossref","unstructured":"Li J, Zhang L, Liu L (2009) A parallel immune algorithm based on fine-grained model with GPU-acceleration. In: International Conference on Innovative Computing, Information and Control, pp 683\u2013686","DOI":"10.1109\/ICICIC.2009.44"},{"issue":"7","key":"718_CR11","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ins.2010.12.003","volume":"181","author":"J Zhao","year":"2011","unstructured":"Zhao J, Liu Q, Wang W, et al. (2011) A parallel immune algorithm for traveling salesman problem and its application on cold rolling scheduling. Inf Sci 181(7):1212\u20131223","journal-title":"Inf Sci"},{"issue":"5","key":"718_CR12","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1109\/TEVC.2009.2011992","volume":"13","author":"S He","year":"2009","unstructured":"He S, Wu QH, Saunders JR (2009) Group search optimizer: An optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973\u2013990","journal-title":"IEEE Trans Evol Comput"},{"issue":"474","key":"718_CR13","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1038\/474288a","volume":"6","author":"FJ Weissing","year":"2011","unstructured":"Weissing FJ (2011) Born leaders. Nature 6(474):288\u2013289","journal-title":"Nature"},{"key":"718_CR14","doi-asserted-by":"crossref","unstructured":"Harcourt JL, Ang TZ, Sweetman G, Johnstone RA, Manica A (2009) Social feedback and the emergence of leaders and followers. Curr Biol 19:248C252","DOI":"10.1016\/j.cub.2008.12.051"},{"issue":"20","key":"718_CR15","doi-asserted-by":"crossref","first-page":"4684","DOI":"10.1016\/j.ins.2010.06.032","volume":"181","author":"Y Marinakis","year":"2011","unstructured":"Marinakis Y, Marinaki M, Dounias G (2011) Honey bees mating optimization algorithm for the Euclidean traveling salesman problem[J]. Inf Sci 181(20):4684\u20134698","journal-title":"Inf Sci"},{"issue":"3","key":"718_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y Marinakis","year":"2005","unstructured":"Marinakis Y, Migdalas A, Pardalos PM, Expanding neighborhood GRASP (2005) for the traveling salesman problem[J]. Comput Optim Appl 32(3):231\u2013257","journal-title":"Comput Optim Appl"},{"issue":"1","key":"718_CR17","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate D, Cook W, Rohe A (2003) Chained Lin-Kernighan for large traveling salesman problems[J]. INFORMS J Comput 15(1):82\u201392","journal-title":"INFORMS J Comput"},{"issue":"1","key":"718_CR18","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K, et al. (2007) Implementation of an effective hybrid GA for large-scale traveling salesman problems[J]. IEEE Trans Syst Man Cybern Part B: Cybernetics 37(1):92\u201399","journal-title":"IEEE Trans Syst Man Cybern Part B: Cybernetics"},{"key":"718_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/0-306-48213-4_9","volume-title":"Experimental analysis of heuristics for the STSP[M]\/\/The traveling salesman problem and its variations","author":"DS Johnson","year":"2007","unstructured":"Johnson DS, McGeoch LA (2007) Experimental analysis of heuristics for the STSP[M]\/\/The traveling salesman problem and its variations. Springer, US, pp 369\u2013443"},{"issue":"1","key":"718_CR20","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic[J]. Eur J Oper Res 126(1):106\u2013130","journal-title":"Eur J Oper Res"},{"key":"718_CR21","first-page":"215","volume":"1","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: A case study in local optimization[J]. Local Search in Combinatorial Optimization 1:215\u2013310","journal-title":"Local Search in Combinatorial Optimization"},{"key":"718_CR22","unstructured":"Neto DM (1999) Efficient cluster compensation for Lin-Kernighan heuristics[D]. University of Toronto"},{"key":"718_CR23","first-page":"571","volume-title":"Tabu search on the geometric traveling salesman problem[M]\/\/Meta-Heuristics","author":"M Zachariasen","year":"1996","unstructured":"Zachariasen M, Dam M (1996) Tabu search on the geometric traveling salesman problem[M]\/\/Meta-Heuristics. Springer, US, pp 571\u2013587"},{"issue":"3","key":"718_CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y Marinakis","year":"2005","unstructured":"Marinakis Y, Migdalas A, Pardalos PM (2005) Expanding neighborhood GRASP for the traveling salesman problem[J]. Comput Optim Appl 32(3):231\u2013257","journal-title":"Comput Optim Appl"},{"issue":"4","key":"718_CR25","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley JJ (1992) Fast algorithms for geometric traveling salesman problems[J]. ORSA J Comput 4(4):387\u2013411","journal-title":"ORSA J Comput"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0718-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-015-0718-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-015-0718-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T07:16:12Z","timestamp":1567322172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-015-0718-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,4]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["718"],"URL":"https:\/\/doi.org\/10.1007\/s10489-015-0718-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,4]]}}}