An artificial chemical reaction optimization algorithm for multiple-choice knapsack problem

摘要

Multiple-choice knapsack problem (MCKP) is a well-known NP-hard problem and it has a lot of applications in the real-world and theory. In this study, the Artificial chemical reaction optimization algorithm (ACROA) that uses integer string code is developed to solve MCKP. Four specific reaction operators are designed to implicate local and global search. A new penalty function that aims to force the algorithm search in both infeasible and feasible search space is suggested The experiment on MCKP test set demonstrates that ACROA is superior to GA.