{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214137","sets":["6164:6165:6617:10752"]},"path":["10752"],"owner":"44499","recid":"214137","title":["シフトスケジューリング問題における量子アニーリングマシンの初期評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-11-25"},"_buckets":{"deposit":"58fce132-1d63-4e9f-aa3b-26a1e1f9fa7a"},"_deposit":{"id":"214137","pid":{"type":"depid","value":"214137","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"シフトスケジューリング問題における量子アニーリングマシンの初期評価","author_link":["548818","548816","548817"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"シフトスケジューリング問題における量子アニーリングマシンの初期評価"},{"subitem_title":"Initial Evaluation of a Quantum Annealing Machine for the Shift Scheduling Problem","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"スケジューリング","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2021-11-25","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_18_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"慶應義塾大学政策メディア研究科"},{"subitem_text_value":"株式会社KDDI総合研究所／慶應義塾大学政策メディア研究科"},{"subitem_text_value":"慶應義塾大学環境情報学部"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Keio University","subitem_text_language":"en"},{"subitem_text_value":"KDDI Research, Inc. / Keio University","subitem_text_language":"en"},{"subitem_text_value":"Keio University","subitem_text_language":"en"}]},"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/214137/files/IPSJ-ComSys2021002.pdf","label":"IPSJ-ComSys2021002.pdf"},"date":[{"dateType":"Available","dateValue":"2023-11-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ComSys2021002.pdf","filesize":[{"value":"1.8 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"11"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"bca5d4ef-e459-4949-a927-cbd313c22625","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_18_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"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_18_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"シフトスケジューリング問題はコールセンターのアルバイトなどのシフトの組み合わせ最適化問題である．この問題はナーススケジューリング問題などの必要な人員数が定められ，複数の制約の元で人員を割り当てなければならないスケジューリングを行う現実問題に応用することが可能な問題である．この問題は考慮する人数や期間が増えるほど組合せ数が膨大となり，厳密解を求めることが困難となる．量子アニーリングは量子コンピュータの一種として，このような組み合わせ最適化問題を現実時間で解くことが期待されている．本論文では目的関数や制約式を量子アニーリングに適用できるQUBO(Quadratic Unconstrained Binary Optimization)で定式化し，D-wave社の量子アニーリングマシンを用いてシフトスケジューリングにおける量子アニーリング適用の効果を評価た．更に，量子アニーリングシミュレータであるOpenJijと既存手法として制約充足問題のソルバーであるThe Z3 theorem proverと比較し，量子アニーリングマシンの有効性を検証した．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"18","bibliographic_titles":[{"bibliographic_title":"コンピュータシステム・シンポジウム論文集"}],"bibliographicPageStart":"11","bibliographicIssueDates":{"bibliographicIssueDate":"2021-11-25","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214137,"updated":"2025-01-19T16:53:20.547382+00:00","links":{},"created":"2025-01-19T01:14:58.123724+00:00"}