{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00193662","sets":["6164:6165:6640:9657"]},"path":["9657"],"owner":"44499","recid":"193662","title":["POIを考慮した経路長指定の複数巡回経路探索手法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-06-27"},"_buckets":{"deposit":"b783452d-f7bd-45c8-b1ab-80d27d676622"},"_deposit":{"id":"193662","pid":{"type":"depid","value":"193662","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"POIを考慮した経路長指定の複数巡回経路探索手法","author_link":["454243","454244","454242","454245","454246"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"POIを考慮した経路長指定の複数巡回経路探索手法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ITS","subitem_subject_scheme":"Other"}]},"item_type_id":"18","publish_date":"2018-06-27","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":"ゼンリンデータコム"},{"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/193662/files/IPSJ-DICOMO2018235.pdf","label":"IPSJ-DICOMO2018235.pdf"},"date":[{"dateType":"Available","dateValue":"2020-06-27"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DICOMO2018235.pdf","filesize":[{"value":"1.3 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":"44"}],"accessrole":"open_date","version_id":"6c3d5f22-d377-4a34-94b3-3dfe3d7b9473","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2018 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":[{}]},{"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":"地図アプリケーションリの普及により，ユーザの嗜好を考慮した経路や，出発地に戻る巡回経路といった，散策での経路探索が注目されている．散策での巡回経路ではユーザの検索興味対象である POI (Point of Interest) を寄り道したり，ユーザが満足する経路を選択できるように複数候補の巡回経路を提示することが望ましい．体調や空き時間に応じて望まれる経路長も変わるため，ユーザが経路長を指定したり，同一地点の通過も避ける必要もある．これに対し，ユーザの嗜好を考慮した経路探索は巡回経路に対応していない．加えて，従来の巡回経路探索手法は，指定経路長と同一地点の通過の回避の両方を満たさない．本稿では，同一地点の通過を避け多くの POI を経由し，指定経路長で巡回経路を複数個探索する手法を提案する．提案手法では，指定経路長に基づき巡回の基準点を複数個生成する．基準点を配置することで指定経路長かつ複数個の巡回経路を得られ，しかも迂回が少なく経由可能な POI を多く経由する経路を探索できる．加えて，基準点の間の非巡回経路のつなぎ合わせとして巡回経路を得られ，適当な重み付けで同一地点の通過も避けられる．提案手法では，従来手法と比較して，経路長を指定経路長に近づけたうえで，同一地点の通過回数を80%以上削減し，POI 経由数も約 1.24 倍に増加した．","subitem_description_type":"Other"}]},"item_18_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"1621","bibliographic_titles":[{"bibliographic_title":"マルチメディア，分散協調とモバイルシンポジウム2018論文集"}],"bibliographicPageStart":"1612","bibliographicIssueDates":{"bibliographicIssueDate":"2018-06-27","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2018"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"updated":"2025-01-19T23:50:47.928670+00:00","created":"2025-01-19T00:58:52.495552+00:00","id":193662}