Notice of RetractionCompetitive Decision Algorithm for 0-1 Multiple Knapsack Problem

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

The multiple knapsack problem(MKP) is a classified NP-hard optimization problem, which is a generalization of the simple knapsack problem (KP). Hence algorithms for finding the exact solution of MKP are not suitable for application in real-time decision-making applications. This paper presents a competitive decision algorithm (CDA) for MKP. CDA is newly proposed meta-heuristic algorithm for solving complex optimization problems. It investigates natural selection process in the real world by recognizing that an entity with more resources has a high chance to survive. It uses the characteristics that competition builds optimization and the result of competition hinges on decision-making. On the other hand CDA is easily to combine with the properties of problem itself. We present an algorithm CDAMKP to solve MKP based on the feature of MKP. At the resource exchange stage, a novel technology is proposed to allow for improved solution. And we perform extensive computational investigations to validate the effect and efficiency of the algorithm. The results indicate that the proposed algorithm have a satisfactory behavior with regard both to running times and quality of the solutions found.