{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00233934","sets":["1164:3865:11476:11605"]},"path":["11605"],"owner":"44499","recid":"233934","title":["介護タクシー配車最適化のための巡回セールスマン問題のQUBO定式化手法による性能評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-05-08"},"_buckets":{"deposit":"a9aec9a4-c38c-412a-a77b-2f149605c9e4"},"_deposit":{"id":"233934","pid":{"type":"depid","value":"233934","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"介護タクシー配車最適化のための巡回セールスマン問題のQUBO定式化手法による性能評価","author_link":["636539","636541","636540"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"介護タクシー配車最適化のための巡回セールスマン問題のQUBO定式化手法による性能評価"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[ITS]経路計画","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-05-08","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"現在，大阪大学大学院情報科学研究科"},{"subitem_text_value":"現在，大阪大学大学院情報科学研究科"},{"subitem_text_value":"現在，大阪大学大学院情報科学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Presently with Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Presently with Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Presently with Graduate School of Information Science and Technology, Osaka University","subitem_text_language":"en"}]},"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/233934/files/IPSJ-MBL24111013.pdf","label":"IPSJ-MBL24111013.pdf"},"date":[{"dateType":"Available","dateValue":"2026-05-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MBL24111013.pdf","filesize":[{"value":"1.1 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":"35"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"eca46ccb-b282-474c-998c-3bfb90712a4e","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"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":"AA11851388","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-8817","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"現在の日本では，高齢人口の急速な増加によりデイケアサービスなどの介護施設への需要が高まっている．この中で，介護事業者が運営する介護タクシーは，被介護者の自宅から介護施設への移動を補助する重要なサービスである．しかし，一般に車両数やドライバの数は限られており，また高齢者一人一人の送迎希望時間は身体の状態などによって異なる場合が多い．このため効率的な送迎ルートの計画と車両・ドライバの割り当ては重要な課題となっている．本研究では，この問題を時間制約付き巡回セールスマン問題（TW-TSP）として定式化する手法を提案する．提案手法では，TW-TSP を制約無し二次形式最適化問題に変換し，簡易版 TW-TSP では Qiskit ライブラリを用いて量子回路にマッピングする．得られた回路を量子回路シミュレータである Matrix Product State Simulator に入力し解を得た．また本問題設定および QUBO 定式化の実問題への適用可能性を検証するため，実際の介護タクシー事業者から提供された複数の被介護者の住所および介護施設の位置情報に基づいて TW-TSP の問題インスタンスを構築し，CPLEX を用いて求解可能であることを確かめた．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告モバイルコンピューティングと新社会システム（MBL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-05-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"13","bibliographicVolumeNumber":"2024-MBL-111"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T09:55:58.249490+00:00","created":"2025-01-19T01:35:35.942150+00:00","links":{},"id":233934}