{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00165292","sets":["934:1022:8505:8711"]},"path":["8711"],"owner":"11","recid":"165292","title":["観光ルート推薦のための効率的な制約条件"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-06-29"},"_buckets":{"deposit":"793ec9a0-785f-4354-b1d8-584dee2bb643"},"_deposit":{"id":"165292","pid":{"type":"depid","value":"165292","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"観光ルート推薦のための効率的な制約条件","author_link":["326875","326876","326877","326873","326878","326874"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"観光ルート推薦のための効率的な制約条件"},{"subitem_title":"Efficient Constraints for Tour Recommendation","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[研究論文] 観光ルート推薦，Twitter","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2016-06-29","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"岡山大学大学院自然科学研究科"},{"subitem_text_value":"株式会社両備システムソリューションズ"},{"subitem_text_value":"岡山大学大学院自然科学研究科"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Natural Science and Technology, Okayama University","subitem_text_language":"en"},{"subitem_text_value":"Ryobi System Solutions","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Natural Science and Technology, Okayama 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/165292/files/IPSJ-TOD0902006.pdf","label":"IPSJ-TOD0902006.pdf"},"date":[{"dateType":"Available","dateValue":"2018-06-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOD0902006.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":"13"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"920e1928-32eb-4508-840c-37b71566776a","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"新妻, 弘崇"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"新井, 晃平"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"太田, 学"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hirotaka, Niitsuma","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kohei, Arai","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Manabu, Ohta","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464847","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7799","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"観光ルート推薦の問題は，なんらかの目的関数を最大化する最適化問題として定式化することができる．たとえば旅行者の興味や満足度をスコアとして表した関数の値を最大化する観光ルートを求める問題として定式化することができる．この最適なルートを求める問題はTravelling Salesman Problem（TSP）と類似した整数計画問題として記述することができる．しかしTSPと同様の定式化をすると不適切な解が頻繁に計算される問題が生じる．たとえば一筆書きにならない途切れたルートが頻繁に計算される問題が生じる．この問題を解決する制約条件を本研究では提案する．提案する制約条件には計算時間が大幅に増大する問題がある．そこで計算時間を短縮する制約条件をさらに追加する手法を提案する．提案手法の有効性を示すために2種類の目的関数を使った実験を行った．1つ目は訪問する観光スポットの人気度の総和，2つ目は旅行者をマルコフ遷移モデルで表した場合の対数尤度を目的関数として設定し実験を行った．どちらの目的関数を使用した実験でも，提案手法によって計算される観光ルートは，Greedyな解法で計算したルートと比べておおよそ2倍の目的関数の値を与えることを確認した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Tour recommendation can be formulated as finding an optimized tour that maximizes a given objective function. For example, tour recommendation can be formulated as maximizing the score that represents the degree of a user's interest as an objective function. The optimization problem can be solved as the integer programming problem using the similar formulation as used in Travelling Salesman Problem (TSP). However, the integer programming problem gives invalid solutions frequently. For example, the optimized tour frequently includes interrupted routes. This research proposes additional constraints for the integer programming problem that can resolve this problem. However, the integer programming problem including the proposed additional constraint requires huge computational time to solve. This research also proposes other additional constraints that can resolve this computational time problem. The proposed formulations are evaluated using two objective functions. The first objective function is the score which represents the popularity of each spot. The second objective function is the likelihood of a Markov chain model of tourists. We show the formulation using these additional constraints can compute better solutions that have almost a twice better score than a greedy method using these two objective functions.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"45","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌データベース（TOD）"}],"bibliographicPageStart":"34","bibliographicIssueDates":{"bibliographicIssueDate":"2016-06-29","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"9"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":165292,"updated":"2025-01-20T10:29:05.653071+00:00","links":{},"created":"2025-01-19T00:37:01.471479+00:00"}