Proposal of Adjustment Type Genetic Algorithm for Knapsack Problem

Abstract

The greedy algorithm is one of solution methods for knapsack problem. Although this algorithm does not necessarily obtain the optimal solution, it can obtain a good solution in short time. We consider this algorithm is very effective at judging the importance of each item. In this paper, we propose a new genetic algorithm for solving a knapsack problem. The algorithm can adjust a search area in consideration of the stability of each item which can obtain from the greedy algorithm. Moreover, we apply the proposed method to a multi-objective problem and a large-scale problem, and test the effectiveness. © 2004, The Institute of Electrical Engineers of Japan. All rights reserved.