Solving Multidimensional Knapsack Problem with Bayesian Multiploid Genetic Algorithm

Abstract

Solving optimization is still a big challenge in the area of optimization algorithms. Many proposed algorithms in the literature don’t consider the relations between the variables of the nature of the problem. However, a recently published algorithm, called “Bayesian Multiploid Genetic Algorithm” exploits the relations between the variables and then solves the given problem. It also uses more than one genotype unlike the simple Genetic Algorithm (GA) and it acts like an implicit memory in order to remember the old but good solutions. In this work, the well-known Multidimensional Knapsack Problem (MKP) is solved. And the results show that exploiting relations between the variables gets a huge advantage in solving the given problem.