{"created":"2025-01-19T01:44:47.198449+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00240539","sets":["1164:2036:11466:11785"]},"path":["11785"],"owner":"44499","recid":"240539","title":["制約違反を前提としたイジングマシンと補正処理によるハイブリッド組合せ最適化手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-11-05"},"_buckets":{"deposit":"1fdf4f53-8316-4eb7-9859-56049fb5c61a"},"_deposit":{"id":"240539","pid":{"type":"depid","value":"240539","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"制約違反を前提としたイジングマシンと補正処理によるハイブリッド組合せ最適化手法","author_link":["660097","660095","660096"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"制約違反を前提としたイジングマシンと補正処理によるハイブリッド組合せ最適化手法"}]},"item_type_id":"4","publish_date":"2024-11-05","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学大学院基幹理工学研究科"},{"subitem_text_value":"早稲田大学グリーン・コンピューティング・システム研究機構"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/240539/files/IPSJ-SLDM24207057.pdf","label":"IPSJ-SLDM24207057.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-SLDM24207057.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"10"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"f5c8b66e-1262-40a1-bba2-4dbd568badef","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"岩田, 錦哉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"多和田, 雅師"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"戸川, 望"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11451459","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8639","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"ヒューリスティックな補正処理を前提に，イジングマシンを用いて組合せ最適化問題の解を探索する手法を提案する．提案手法は，組合せ最適化問題の制約不等式を補助変数を用いずに等式に変換した上で，ペナルティ法により，Quadratic Unconstrained Binary Optimization（QUBO）に埋め込む．イジングマシンで QUBO の解を求めた際，制約違反解が得られた場合，補正処理により制約充足解に補正する．イジングマシンを用いて多次元ナップサック問題 (Multi-Dimensional Knapsack Problem, MKP) と二次ナップサック問題 (Quadratic Knapsack Problem, QKP) を解く計算機実験をした．提案手法と既存手法それぞれで変換した QUBO の探索結果を比較し，提案手法の有効性を確認した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システムとLSIの設計技術（SLDM）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-11-05","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"57","bibliographicVolumeNumber":"2024-SLDM-207"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":240539,"updated":"2025-01-19T07:56:52.986012+00:00","links":{}}