Cellular competitive decision algorithm for binary knapsack problem

Classical binary or 0-1 knapsack problem is one of the most widely studied problems in combinatorial optimization. Though the optimization version of this problem is NP-hard, practical solution techniques don´t require optimality. Many different heuristics and approximation algorithms have been used to solve t it. Cellular competitive decision algorithm (CCDA) is a heuristic proposed recently, which is good at solving combinatorial problems, especially those NP-hard problems. One of the most obvious features of CCDA is easy to integrate with the mathematical properties of problem itself. Firstly, mathematical properties of binary knapsack problem are analyzed to reduce the scale of problem. Then a CCDA for binary knapsack problem is presented based on the feature of binary knapsack problem. In addition to validate the effect and efficiency of the algorithm, we conducted many computational investigations to verify the feasibility of CCDA. The results suggest the proposed algorithm is extremely well with regard to both running time and quality of the solutions found.