{"created":"2025-01-19T01:28:48.535144+00:00","updated":"2025-01-19T11:30:27.817193+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00229571","sets":["6504:11436:11437"]},"path":["11437"],"owner":"44499","recid":"229571","title":["QUBO問題における制約重み分割による解の高精度化に関する一検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-02-16"},"_buckets":{"deposit":"6e143d8d-566b-4be1-b7ef-32fe102181fa"},"_deposit":{"id":"229571","pid":{"type":"depid","value":"229571","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"QUBO問題における制約重み分割による解の高精度化に関する一検討","author_link":["617509","617505","617508","617506","617507"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"QUBO問題における制約重み分割による解の高精度化に関する一検討"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"コンピュータシステム","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2023-02-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東北大"},{"subitem_text_value":"東北大"},{"subitem_text_value":"東北大"},{"subitem_text_value":"東北大"},{"subitem_text_value":"東北大"}]},"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/229571/files/IPSJ-Z85-5J-07.pdf","label":"IPSJ-Z85-5J-07.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-17"}],"format":"application/pdf","filename":"IPSJ-Z85-5J-07.pdf","filesize":[{"value":"234.9 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"6bd1ffc3-feed-43f8-9660-05c0d3b243dd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小野田, 誠"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小松, 一彦"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"熊谷, 政仁"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"佐藤, 雅之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"小林, 広明"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年、組合せ最適化問題を2次制約無し2値最適化(QUBO)問題に変換し、イジングマシンによって解くことが注目されている。制約条件を含むQUBO問題では、制約重みと呼ばれる係数を設定し制約条件を目的関数に組み込み解く。制約重みは制約違反を防ぐために十分大きな値に設定する必要がある一方で、大きすぎる場合には探索空間が複雑化し、解の精度が悪化することが知られている。そこで本研究では、確率的な探索を複数回繰り返すアニーリングにおいて制約重みを減少させ、制約違反解の発生を許容した上で、探索空間を簡単にして制約を満たす解の探索精度を高める。実験により、制約重みを減少させた場合の制約違反率や解精度、実行時間を考察する。","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"78","bibliographic_titles":[{"bibliographic_title":"第85回全国大会講演論文集"}],"bibliographicPageStart":"77","bibliographicIssueDates":{"bibliographicIssueDate":"2023-02-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2023"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":229571,"links":{}}