Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem

The ICAwICA algorithm solves the 0-1 Multidimensional Knapsack Problem by modifying the Imperialist Competitive Algorithm. It introduces colony independence, allowing colonies to choose which imperialist to assimilate toward, and uses a constrained assimilation process with a repair mechanism. This approach achieves competitive results across various benchmark instances, including large problems.

Open the full episode

More from AI Radio