Internet Archive Scholar

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

Ivars Dzalbs, Tatiana Kalganova, Ian Dear
2020 arXiv   pre-print

Preserved Fulltext

Web Archive Capture PDF (615.1 kB)
https://web.archive.org/web/20200320222747/https://arxiv.org/ftp/arxiv/papers/2003/2003.06617.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

The multidimensional knapsack problem is a well-known constrained optimization problem with many real-world engineering applications. In order to solve this NP-hard problem, a new modified Imperialist Competitive Algorithm with Constrained Assimilation (ICAwICA) is presented. The proposed algorithm introduces the concept of colony independence, a free will to choose between classical ICA assimilation to empires imperialist or any other imperialist in the population. Furthermore, a constrained
more » ... similation process has been implemented that combines classical ICA assimilation and revolution operators, while maintaining population diversity. This work investigates the performance of the proposed algorithm across 101 Multidimensional Knapsack Problem (MKP) benchmark instances. Experimental results show that the algorithm is able to obtain an optimal solution in all small instances and presents very competitive results for large MKP instances.
arXiv:2003.06617v1 fatcat:f3qs6y2thbde7dbtdixj7holo4
Citation

Ivars Dzalbs, Tatiana Kalganova, Ian Dear. "Imperialist Competitive Algorithm with Independence and Constrained Assimilation for Solving 0-1 Multidimensional Knapsack Problem." arXiv (2020)