電気学会論文誌C(電子・情報・システム部門誌)
Online ISSN : 1348-8155
Print ISSN : 0385-4221
ISSN-L : 0385-4221
<ソフトコンピューティング>
ナップサック問題のための探索範囲調節型GAの提案
井田 憲一菅 良平玄 光男
著者情報
ジャーナル フリー

2004 年 124 巻 9 号 p. 1861-1867

詳細
抄録

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
前の記事 次の記事
feedback
Top