作者: Kaushik Kumar Bhattacharjee , Sarada Prasad Sarmah
DOI: 10.1109/IEOM.2015.7093858
关键词:
摘要: Knapsack problems are one of the classical NP-hard and it offers many practical applications in vast field different areas. Several traditional as well population based metaheuristic algorithms applied to solve this problem. In paper we introduce binary version cuckoo search algorithm (CSA) for solving knapsack problems, specially 01 The proposed utilizes balanced combination local random walk global explorative walk. So far CSA is generally continuous optimization problems. order investigate performance on combinatorial problem, an attempt made paper. To demonstrate efficiency extensive computational study provided with standard benchmark problem instances comparison particle swarm also carried out.