著者
井田 憲一 菅 良平 玄 光男
出版者
一般社団法人 電気学会
雑誌
電気学会論文誌C(電子・情報・システム部門誌) (ISSN:03854221)
巻号頁・発行日
vol.124, no.9, pp.1861-1867, 2004 (Released:2004-12-01)
参考文献数
9
被引用文献数
1 1

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.

言及状況

外部データベース (DOI)

Twitter (2 users, 2 posts, 0 favorites)

@neMass215 とりあえずこれ使えば良いんじゃない(適当) https://t.co/yaz9ZSORDO

収集済み URL リスト