Cuckoo Search AIgorithm for SoIving Knapsack ProbIem
Knapsack problem (KP) is a typical NP-hard problem in combinatorial optimization in computer science. To deal with KP, proposes a method based on cuckoo search algorithm (CSA). CSA is a novel metaheuristic and shows good performance in solving continuous opti-mization problems. For solving KP, the search space of CSA is restricted in continuous space. The solution space of KP is corresponded to the search space of CSA by the self-defined map. The experimental results show that the proposed algorithm is feasible and effective.
NETL
NSTL
万方数据
维普
