Cognitive Behavior Optimization Algorithm Application for Large-scale Knapsack Problem

The knapsack problem a NP-hard problem which plays significant roles in many practical applications. In this paper, a new cognitive behavior optimization algorithm (COA) is used to large-scale 0-1 knapsack problems. The cognitive behavior algorithm performs well and robustly. Therefore, the cognitive behavior optimization algorithm is applied to the large scale 0-1 knapsack problems, so as to better find the optimal solution. We use COA for solving 4 large-scale (up to 150,000 pieces of goods) knapsack problems. Compared with other metaheuristic optimization algorithms, the superior performance of COA have been proven by experimental results.