2000 Volume 12 Issue 4 Pages 562-569
In this paper, for multidimensional integer knapsack problems we propose an approximate solution method through genetic algorithms which have recently attracted considerable attention in a number of fields as a methodology for optimization, adaptation and learning. For the multidimensional integer knapsack problems, M. Sakawa et al. proposed approximate solution methods through genetic algorithms using ringed double string representation or triple string representation, but more development and improvement are desired to them. Thus, in this paper, we propose a genetic algorithm using double string representation based on a solution for the corresponding continous relaxation problem to improve the accuracy or precision of solutions. Furthermore, the efficiency and effectiveness of the proposed method will be shown through various numerical experiments.
