English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The multidimensional knapsack problem is a well-known constrainedoptimization problem with many real-world engineering applications. In order tosolve this NP-hard problem, a new modified Imperialist Competitive Algorithmwith Constrained Assimilation (ICAwICA) is presented. The proposed algorithmintroduces the concept of colony independence, a free will to choose betweenclassical ICA assimilation to empires imperialist or any other imperialist inthe population. Furthermore, a constrained assimilation process has beenimplemented that combines classical ICA assimilation and revolution operators,while maintaining population diversity. This work investigates the performanceof the proposed algorithm across 101 Multidimensional Knapsack Problem (MKP)benchmark instances. Experimental results show that the algorithm is able toobtain an optimal solution in all small instances and presents very competitiveresults for large MKP instances.

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