{"created":"2023-07-27T06:24:48.829405+00:00","id":7874,"links":{},"metadata":{"_buckets":{"deposit":"67c5887b-2e8c-43c0-bace-6f2947d8f625"},"_deposit":{"created_by":3,"id":"7874","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"7874"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00007874","sets":["934:935:936"]},"author_link":["10796","353","10797"],"item_8_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1996-05-01","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"425","bibliographicPageStart":"422","bibliographicVolumeNumber":"20-22","bibliographic_titles":[{"bibliographic_title":"Proceedings of the IEEE Conference on Evolutionary Computation, Nagoya"}]}]},"item_8_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.","subitem_description_type":"Abstract"}]},"item_8_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学理工研究域　電子情報学系","subitem_description_type":"Other"}]},"item_8_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"IEEE(Institute of Electrical and Electronics Engineers)"}]},"item_8_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Wang, Hong"},{"creatorName":"ナカヤマ, ケンジ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"10796","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ma, Zhiqiang"}],"nameIdentifiers":[{"nameIdentifier":"10797","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nakayama, Kenji"}],"nameIdentifiers":[{"nameIdentifier":"353","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"00207945","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=00207945"},{"nameIdentifier":"00207945","nameIdentifierScheme":"研究者番号","nameIdentifierURI":"https://nrid.nii.ac.jp/nrid/1000000207945"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-NAKAYAMA-K-422.pdf","filesize":[{"value":"454.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-NAKAYAMA-K-422.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/7874/files/TE-PR-NAKAYAMA-K-422.pdf"},"version_id":"5e97d03f-eb49-4c02-a6de-8b6da423f104"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"conference paper","resourceuri":"http://purl.org/coar/resource_type/c_5794"}]},"item_title":"Effectiveness of penalty function in solving the subset sum problem","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Effectiveness of penalty function in solving the subset sum problem"}]},"item_type_id":"8","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"7874","relation_version_is_last":true,"title":["Effectiveness of penalty function in solving the subset sum problem"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2024-06-20T06:16:14.665663+00:00"}