Mohammad Saleh Vahdatpour - Department of Computer Science, School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran
Hedieh Sajedi - Department of Computer Science, School of Mathematics, Statistics and Computer Science, College of Science, University of Tehran, Tehran, Iran

Cultural Algorithms (CA) are metaheuristic optimization algorithms. In this paper, we propose a variation of CA for solving 0-1 knapsack problems. The proposed algorithm considers a belief space to sift population and introduces two functions for adjusting the rate of crossover and mutation operators in the evolutionary process. Experimental results demonstrate the efficiency of the proposed algorithms in finding the global optimum for knapsack problems with high dimension.

knapsack problem, cultural algorithm, genetic algorithm