{"created":"2023-07-25T10:25:34.162574+00:00","id":3956,"links":{},"metadata":{"_buckets":{"deposit":"b84b55f0-e955-4393-b330-f82724cbb608"},"_deposit":{"created_by":4,"id":"3956","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"3956"},"status":"published"},"_oai":{"id":"oai:naist.repo.nii.ac.jp:00003956","sets":["34:35"]},"author_link":["7260","7261","7262","215","7263"],"item_7_alternative_title_1":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"Stamina-Aware Sightseeing Tour Scheduling Method","subitem_alternative_title_language":"en"}]},"item_7_biblio_info_9":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2013-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"1152","bibliographicPageStart":"1141","bibliographicVolumeNumber":"54","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌","bibliographic_titleLang":"ja"}]}]},"item_7_description_7":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"観光においては，ユーザの好む観光スポットをより多く回るスケジュールを立案することが望ましい．しかし各観光スポットにつき，観光方式や観光時間によって必要な体力が異なり，ユーザの体力がスケジュールを遂行できない場合がある．本論文では，観光中に休憩を適宜に行うことで体力の範囲内で最も満足度が高くなる観光スケジュールを求める問題を取り扱う．本問題はNP困難であり，問題例の規模が大きいときには，実用時間で最適解を算出することは困難である．実用時間で準最適解を得るため，ヒューリスティックな探索法である捕食法に基づいて複数の観光スポットを回る休憩なしのスケジュールを求めたうえ，局所探索を用いて適宜に休憩を差し挟むことで解を求める．提案手法を評価するため，異なる観光地候補数を有する複数のインスタンスを用いてシミュレーション実験を行った．その結果，候補数10の場合，提案手法は全探索で得られた解の95.65%の満足度を有するスケジュールを13秒で得られることを確認した．","subitem_description_language":"ja","subitem_description_type":"Abstract"},{"subitem_description":"Tour schedules are required to include multiple sightseeing spots taking into account the user's preference, but the stamina of tourists may be depleted during sightseeing. In this paper, we formulate the sightseeing scheduling problem to maximize the user's satisfaction taking stamina into account. In this problem, break times are allocated in schedules to hold constraint of stamina. This problem is NP-hard, and thus it is difficult to be solved in practical time. In order to obtain a semi-optimal solution in practical time, we propose a method that derives a schedule visiting multiple sightseeing spots with no break times based on a predatory search technique and then allocates the break times in the schedule using a local search technique. To evaluate the proposed method, we compared our method with conventional methods through computer simulations for several different instances containing 10 sightseeing spots. As a result, the proposed method composed the schedule whose expected satisfaction is 95.65% of the optimum solution in 13 sec.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_7_publisher_10":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"一般社団法人情報処理学会","subitem_publisher_language":"ja"}]},"item_7_rights_11":{"attribute_name":"出版者URL","attribute_value_mlt":[{"subitem_rights":"http://id.nii.ac.jp/1001/00091305"}]},"item_7_rights_18":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"ここに掲載した著作物の利用に関する注意 本著作物の著作権は情報処理学会に帰属します。本著作物は著作権者である情報処理学会の許可のもとに掲載するものです。ご利用に当たっては「著作権法」ならびに「情報処理学会倫理綱領」に従うことをお願いいたします。Notice for the use of this material The copyright of this material is retained by the Information Processing Society of Japan (IPSJ). This material is published on this web site with the agreement of the author (s) and the IPSJ. Please be complied with Copyright Law of Japan and the Code of Ethics of the IPSJ if any users wish to reproduce, make derivative work, distribute or make available to the public any part or whole thereof.","subitem_rights_language":"ja"},{"subitem_rights":"Copyright c 2013 by the Information Processing Society of Japan","subitem_rights_language":"en"}]},"item_7_source_id_12":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_7_source_id_14":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA1150953X","subitem_source_identifier_type":"NCID"}]},"item_7_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"武, 兵","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7260","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"孫, 為華","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7261","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"村田, 佳洋","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7262","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"安本, 慶一","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"215","nameIdentifierScheme":"WEKO"},{"nameIdentifier":"40273396","nameIdentifierScheme":"e-Rad","nameIdentifierURI":"https://kaken.nii.ac.jp/ja/search/?qm=40273396"}]},{"creatorNames":[{"creatorName":"伊藤, 実","creatorNameLang":"ja"}],"nameIdentifiers":[{"nameIdentifier":"7263","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2023-03-02"}],"displaytype":"detail","filename":"IPSJ-JNL5403016.pdf","filesize":[{"value":"1.3 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"fulltext","objectType":"fulltext","url":"https://naist.repo.nii.ac.jp/record/3956/files/IPSJ-JNL5403016.pdf"},"version_id":"61fa2331-7be2-4da6-8955-74b2ab5769e7"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ナビゲーションシステム","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"広域・近傍探索","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"巡回スケジューリング","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"組合せ最適化アルゴリズム","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"navigation system","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"extensiveand area-restricted search","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"travelscheduling","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"combinatory optimization algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"ユーザの体力変化に対応可能な観光スケジュールの立案手法","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ユーザの体力変化に対応可能な観光スケジュールの立案手法","subitem_title_language":"ja"}]},"item_type_id":"7","owner":"4","path":["35"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-11-24"},"publish_date":"2016-11-24","publish_status":"0","recid":"3956","relation_version_is_last":true,"title":["ユーザの体力変化に対応可能な観光スケジュールの立案手法"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-11-14T10:52:49.133295+00:00"}