WEKO3
インデックスリンク
アイテム
Effectiveness of penalty function in solving the subset sum problem
http://hdl.handle.net/2297/18402
http://hdl.handle.net/2297/18402de435bd4-dfef-4e04-aad5-47dc0dcb4c11
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
TE-PR-NAKAYAMA-K-422.pdf (454.2 kB)
|
|
| Item type | 会議発表論文 / Conference Paper(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2017-10-03 | |||||
| タイトル | ||||||
| タイトル | Effectiveness of penalty function in solving the subset sum problem | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||
| 資源タイプ | conference paper | |||||
| 著者 |
Wang, Hong
× Wang, Hong× Ma, Zhiqiang× Nakayama, Kenji |
|||||
| 提供者所属 | ||||||
| 内容記述タイプ | Other | |||||
| 内容記述 | 金沢大学理工研究域 電子情報学系 | |||||
| 書誌情報 |
Proceedings of the IEEE Conference on Evolutionary Computation, Nagoya 巻 20-22, p. 422-425, 発行日 1996-05-01 |
|||||
| 出版者 | ||||||
| 出版者 | IEEE(Institute of Electrical and Electronics Engineers) | |||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | In this paper we investigate the evolutionary heuristics used as approximation algorithm to the subset sum problem. We propose a graded penalty function in a fitness function of genetic algorithms to penalize an infeasible string in solving the subset sum problem. An exponential term of generation variable, tθ, is added into the penalty function for increasing penalty generation by generation. The experiments show that the proposed penalty function is more efficient than other existing penalty functions. It is suggested that the penalty pressure is increased step by step. | |||||
| 著者版フラグ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
