{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:31:13Z","timestamp":1648978273404},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"},{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"content-version":"vor","delay-in-days":11,"URL":"https:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>Ant colony algorithm has emerged recently as a new meta-heuristic method, which is inspired from the behaviours of real ants for solving NP-hard problems. However, the classical ant colony algorithm also has its defects of stagnation and premature. This paper aims at remedying these problems.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>In this paper, we propose an adaptive ant colony algorithm that simulates the behaviour of biological immune system. The solutions of the problem are much more diversified than traditional ant colony algorithms.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusion<\/jats:title>\n            <jats:p>The proposed method for improving the performance of traditional ant colony algorithm takes into account the polarization of the colonies, and adaptively adjusts the distribution of the solutions obtained by the ants. This makes the solutions more diverse so as to avoid the stagnation and premature phenomena.<\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/1471-2105-7-s4-s3","type":"journal-article","created":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T19:59:21Z","timestamp":1165953561000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An improved ant colony algorithm with diversified solutions based on the immune strategy"],"prefix":"10.1186","volume":"7","author":[{"given":"Ling","family":"Qin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"issue":"1","key":"1326_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V: Ant Colony system: Optimization by a colony of coorperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 1996, 26(1):29\u201341.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"issue":"2","key":"1326_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM: Ant colonies for the traveling salesman problem. BioSystems 1997, 43(2):73\u201381.","journal-title":"BioSystems"},{"issue":"8","key":"1326_CR3","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"JW Gutjahr","year":"2000","unstructured":"Gutjahr JW: A Graph-based Ant System and its convergence. Future Generation Computer Systems 2000, 16(8):873\u2013888.","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"1326_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0167-739X(99)00124-7","volume":"17","author":"EG Talbi","year":"2001","unstructured":"Talbi EG, Roux O, Fonlupt C, Robillard D: Parallel Ant Colonies for the quadratic assignment problem. Future Generation Computer Systems 2001, 17(4):441\u2013449.","journal-title":"Future Generation Computer Systems"},{"issue":"8","key":"1326_CR5","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1016\/S0167-739X(00)00046-7","volume":"16","author":"V Maniezzo","year":"2000","unstructured":"Maniezzo V, Carbonaro A: An ANTS heuristic for the frequency assignment problem. Future Generation Computer Systems 2000, 16(8):927\u2013935.","journal-title":"Future Generation Computer Systems"},{"issue":"1","key":"1326_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0378-7796(98)00127-8","volume":"49","author":"CS Chang","year":"1999","unstructured":"Chang CS, Tian L, Wen FS: A new approach to fault section in power systems using Ant System. Electric Power Systems Research 1999, 49(1):63\u201370.","journal-title":"Electric Power Systems Research"},{"issue":"10","key":"1326_CR7","first-page":"1240","volume":"36","author":"Q Wu","year":"1999","unstructured":"Wu Q, Zhang J, Xu X: An ant colony algorithm with mutation features. Journal of Computer Research & Development 1999, 36(10):1240\u20131245.","journal-title":"Journal of Computer Research & Development"},{"key":"1326_CR8","first-page":"252","volume-title":"Proceedings of ML-95, the 12th International Conference on Machine Learning","author":"LM Gambardella","year":"1995","unstructured":"Gambardella LM, Dorigo M: Ant-Q: A reinforcement learning approach to the traveling salesman problem. In Proceedings of ML-95, the 12th International Conference on Machine Learning. Morgan Kaufmann: IEEE Press; 1995:252\u2013260."},{"issue":"12","key":"1326_CR9","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/S0306-4549(01)00118-9","volume":"29","author":"M Dorigo","year":"2002","unstructured":"Dorigo M, Luca M: The Ant-Q algorithm applied to the nuclear reload problem. Annals of Nuclear Energy 2002, 29(12):1455\u20131470.","journal-title":"Annals of Nuclear Energy"},{"issue":"8","key":"1326_CR10","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle T, Hoos HH: MAX-MIN Ant System. Future Generation Computer Systems Journal 2000, 16(8):889\u2013914.","journal-title":"Future Generation Computer Systems Journal"},{"key":"1326_CR11","first-page":"1923","volume":"3","author":"W Hai","year":"2003","unstructured":"Hai W, Yijun L, Yuqiang F, Jianfeng L, Anshi X: Application of artificial immune algorithm in e-commerce oriented negotiation support system. 2003 International Conference on Machine Learning and Cybernetics 2003, 3: 1923\u20131927.","journal-title":"2003 International Conference on Machine Learning and Cybernetics"},{"key":"1326_CR12","first-page":"32","volume-title":"Soft Computing Techniques in Instrumentation, 2003. IEEE International Workshop on Measurement and Related Applications","author":"Y Guiliang","year":"2003","unstructured":"Guiliang Y, Wu QMJ: The multi-sensor fusion: image registration using artificial immune algorithm. Soft Computing Techniques in Instrumentation, 2003. IEEE International Workshop on Measurement and Related Applications 2003, 32\u201336."},{"issue":"1","key":"1326_CR13","first-page":"86","volume":"5","author":"Y Lin","year":"2000","unstructured":"Lin Y, Jumin H, Zhuoshang J, Yinsheng Dai: A study to genetic algorithm based on isolation niche technique. Journal of systems engineering 2000, 5(1):86\u201391.","journal-title":"Journal of systems engineering"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-7-S4-S3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/1471-2105-7-S4-S3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-7-S4-S3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T07:56:48Z","timestamp":1630483008000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-7-S4-S3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":13,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["1326"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-7-s4-s3","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]},"assertion":[{"value":"12 December 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S3"}}