{"created":"2025-01-19T01:27:39.308012+00:00","updated":"2025-01-19T11:49:39.901755+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00228511","sets":["6164:6165:7006:11378"]},"path":["11378"],"owner":"44499","recid":"228511","title":["複数人複数車両割当問題の制約無し二次形式最適化問題による定式化と量子近似解法の適用"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-10-18"},"_buckets":{"deposit":"a5a45bab-7115-4f5a-ad73-4041357cc499"},"_deposit":{"id":"228511","pid":{"type":"depid","value":"228511","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"複数人複数車両割当問題の制約無し二次形式最適化問題による定式化と量子近似解法の適用","author_link":["609997","609999","609998"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"複数人複数車両割当問題の制約無し二次形式最適化問題による定式化と量子近似解法の適用"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"QUBO，QAOA，TW-TSP","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2023-10-18","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":"大阪大学大学院情報科学研究科"},{"subitem_text_value":"大阪大学大学院情報科学研究科"}]},"item_18_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Information Science and Technology, Osaka 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/228511/files/IPSJ-DPSWS20230012.pdf","label":"IPSJ-DPSWS20230012.pdf"},"date":[{"dateType":"Available","dateValue":"2025-10-18"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPSWS20230012.pdf","filesize":[{"value":"3.2 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":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"1fdcf995-6b92-4dfe-895c-d19ecf8ca9e1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 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":"現在の日本では，高齢人口の急速な増加によりデイケアサービスなどの介護施設への需要が高まっ ている.この中で，介護事業者が運営する介護タクシーは，被介護者の自宅から介護施設への移動を補助 する重要なサービスである．しかし，一般に車両数やドライバの数は限られており，また高齢者一人一人 の送迎希望時間は身体の状態などによって異なる場合が多い.このため効率的な送迎ルートの計画と車 両・ドライバの割り当ては重要な課題となっている．本研究では，この問題を時間制約付き巡回セールスマン問題 (TW-TSP) と車両割当問題 (VAP) として定式化し，量子近似解法 (QAOA) により解く手法 を提案する.提案手法では，TW-TSP および VAP を制約無し二次形式最適化問題に変換し，Qiskit ライブラリを用いて量子回路にマッピングする．得られた回路を量子回路シミュレータである Matrix Product State Simulator に入力し解を得る．時間制約付き巡回セールスマン問題においては，ノード数が 3 までの 場合に限り，厳密解と同等の結果を得ることができた．さらに，車両割当問題では，ノード数が 5，ドライ バー数が 2 の場合に解を見つけることができた．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"89","bibliographic_titles":[{"bibliographic_title":"第31回マルチメディア通信と分散処理ワークショップ論文集"}],"bibliographicPageStart":"82","bibliographicIssueDates":{"bibliographicIssueDate":"2023-10-18","bibliographicIssueDateType":"Issued"}}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":228511,"links":{}}