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="http://downloads.hindawi.com/journals/cin/2014/970456.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
An Improved Hybrid Encoding Cuckoo Search Algorithm for 0-1 Knapsack Problems
<span title="">2014</span>
<i title="Hindawi Limited">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3wwzxqpotbc73bzpemzybzg7ee" style="color: black;">Computational Intelligence and Neuroscience</a>
</i>
Preserved Fulltext
Cuckoo search (CS) is a new robust swarm intelligence method that is based on the brood parasitism of some cuckoo species. In this paper, an improved hybrid encoding cuckoo search algorithm (ICS) with greedy strategy is put forward for solving 0-1 knapsack problems. First of all, for solving binary optimization problem with ICS, based on the idea of individual hybrid encoding, the cuckoo search over a continuous space is transformed into the synchronous evolution search over discrete space.
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2014/970456">doi:10.1155/2014/970456</a>
<a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/24527026">pmid:24527026</a>
<a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC3913292/">pmcid:PMC3913292</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/awgk35udszgatdlduqaz2zvopi">fatcat:awgk35udszgatdlduqaz2zvopi</a>
</span>
more »
... equently, the concept of confidence interval (CI) is introduced; hence, the new position updating is designed and genetic mutation with a small probability is introduced. The former enables the population to move towards the global best solution rapidly in every generation, and the latter can effectively prevent the ICS from trapping into the local optimum. Furthermore, the greedy transform method is used to repair the infeasible solution and optimize the feasible solution. Experiments with a large number of KP instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190503035039/http://downloads.hindawi.com/journals/cin/2014/970456.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/20/0f/200ff40fd091fda0d8a24aa0953afc45edc8c267.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2014/970456">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="unlock alternate icon" style="background-color: #fb971f;"></i>
hindawi.com
</button>
</a>
<a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3913292" title="pubmed link">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
pubmed.gov
</button>
</a>