A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Cuckoo Search (CS) is one of the most recent population-based metaheuristics. CS algorithm is based on the cuckoo's behavior and the mechanism of Lévy flights. The Binary Cuckoo Search algorithm (BCS) is new discrete version used to solve binary optimization problem based on sigmoid function. In this paper, we propose a new cuckoo search for binary multiobjective optimization. Pareto dominance is used to find optimal pareto solutions. Computational results on some bi-criteria knapsack instancesdoi:10.5815/ijieeb.2013.04.02 fatcat:yumjz3jrgnfgjncw7gv7v2jz5i