A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://download.atlantis-press.com/article/25905179.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Atlantis Press">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wjdkfhqywrdefeqoyzjz3os76i" style="color: black;">International Journal of Computational Intelligence Systems</a>
Artificial immune systems are metaheuristic algorithms that mimic the adaptive capabilities of the immune system of vertebrates. Since the 1990s, they have become one of the main branches of computer intelligence. However, there are still many competitive processes in the biological phenomena that can bring new advances for many applications. The Germinal Center reaction is one of these competitive processes that had not been fully modeled until now, and that was the inspiration to design the<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/ijcis.2018.25905179">doi:10.2991/ijcis.2018.25905179</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/shnl3lhigvcmvnvjlz3o23ecf4">fatcat:shnl3lhigvcmvnvjlz3o23ecf4</a> </span>
more »... vel optimization algorithm that we present in this work. Our proposal implements a competitive-based nonuniform distribution to select particles to be mutated, which can be interpreted as an implementation of temporal leadership in population-based metaheuristics. We model the dark-zone and light-zone of the Germinal Center and their competitive processes like clonal expansion, T-cell binding and life signal decay. We also propose the combination of this selection method with the use of one Differential Evolution-based strategy to substitute the somatic hypermutation process. To show the performance, we include a benchmark with the comparison of our approach versus some of the state-of-the-art bio-inspired optimization algorithms. We show that the proposal has a statistically significant improvement over the other algorithms for low dimensionality problems.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190502231036/https://download.atlantis-press.com/article/25905179.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/8e/7c8e1855b0424bd3c4d5206f05bdbc9af2f6a162.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2991/ijcis.2018.25905179"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>