{"created":"2023-05-15T12:16:54.756479+00:00","id":394,"links":{},"metadata":{"_buckets":{"deposit":"9eef5547-2739-4239-aeb6-31f490cf3597"},"_deposit":{"created_by":3,"id":"394","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"394"},"status":"published"},"_oai":{"id":"oai:tuis.repo.nii.ac.jp:00000394","sets":["1:4:44:59"]},"author_link":["1610","1611","1612","1613","1614","1615","1616","1617","1618","1619","1620","1621"],"control_number":"394","item_1701328008552":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"東京情報大学","subitem_publisher_language":"ja"}]},"item_1_biblio_info_14":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2011-09-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"117","bibliographicPageStart":"100","bibliographicVolumeNumber":"15","bibliographic_titles":[{"bibliographic_title":"東京情報大学研究論集","bibliographic_titleLang":"ja"}]}]},"item_1_creator_6":{"attribute_name":"著者名(日)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"島影, 秀征","creatorNameLang":"ja"},{"creatorName":"シマカゲ, ヒデユキ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"山口, 崇志","creatorNameLang":"ja"},{"creatorName":"ヤマグチ, タカシ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"マッキン,  ケネス ジェームス","creatorNameLang":"ja"},{"creatorName":"マッキン,  ケネス ジェームス","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"永井, 保夫","creatorNameLang":"ja"},{"creatorName":"ナガイ, ヤスオ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shimakage, Hideyuki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamaguchi, Takashi","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Mackin, Kenneth James","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Nagai, Yasuo","creatorNameLang":"en"}]}]},"item_1_creator_7":{"attribute_name":"著者名よみ","attribute_type":"creator","attribute_value_mlt":[{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]}]},"item_1_creator_8":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]},{"nameIdentifiers":[{}]}]},"item_1_description_1":{"attribute_name":"ページ属性","attribute_value_mlt":[{"subitem_description":"P(論文)","subitem_description_type":"Other"}]},"item_1_description_11":{"attribute_name":"抄録(日)","attribute_value_mlt":[{"subitem_description":"本研究ではテーマパークやイベント会場において経路決定の支援を行うシステムを構築することを最終目標とし、その部分問題であるコストの変動する重み付きグラフにおける経路探索問題に対して、AntNetを適用した。AntNetとは蟻コロニー最適化の考えを応用して提案された経路探索手法である。AntNetのアルゴリズムは、複数の蟻が以下のステップを任意の回数まで繰り返す。まず、蟻が始点から目的頂点までフェロモンを参照しながら、確率的に経路を選択していく。次に、完成した経路の評価に応じてフェロモンを分泌する。実験の結果、AntNetはグラフの規模が大きくなるほど、探索時間の面で有効であることを示した。しかし、コストの変動間隔が長い場合に、フェロモンの過成熟によって経路が固定されてしまい、解の精度が下がってしまう問題が明らかになった。そこで、この問題を解決するために、フェロモンの過成熟を防ぐことで解の精度を上げる手法を提案し、その評価を行った。結果として、実験を行った環境においては解精度が通常のAntNetによる探索と比較して3.89倍の精度と非常に良い結果が得られることを示した。","subitem_description_language":"ja","subitem_description_type":"Other"}]},"item_1_description_12":{"attribute_name":"抄録(英)","attribute_value_mlt":[{"subitem_description":"In this research, we applied AntNet to shortest path problems in weighted graphs with weight changes. AntNet is a previously proposed method applying ant colony optimization. In the AntNet algorithm multiple ants repeat the following steps. First, each ant selects a path stochastically while referring to pheromone values from the source vertex to destination vertex. Next, pheromone is secreted according to the evaluation of each completed route. Through experiment it was verified that AntNet showed strong advantage over compared methods in calculation time for very large graphs. On the other hand, when the time interval between weight changes is extended, over-maturation of pheromone trails caused the search route to be fixed, leading to an increase in error. In order to overcome this problem, a new method to improve the accuracy by preventing over-maturation was proposed. It was verified by experiment that under the same conditions, the proposed method showed approximately 3.89 times search accuracy compared to normal AntNet.","subitem_description_language":"en","subitem_description_type":"Other"}]},"item_1_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15029/00000393","subitem_identifier_reg_type":"JaLC"}]},"item_1_source_id_13":{"attribute_name":"雑誌書誌ID","attribute_value_mlt":[{"subitem_source_identifier":"AA11155514","subitem_source_identifier_type":"NCID"}]},"item_1_text_10":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"Tokyo University of Information Sciences, Graduate School of Informatics"},{"subitem_text_language":"en","subitem_text_value":"Tokyo University of Information Sciences, Faculty of Informatics, Department of Information Systems"}]},"item_1_text_9":{"attribute_name":"著者所属(日)","attribute_value_mlt":[{"subitem_text_language":"ja","subitem_text_value":"東京情報大学大学院総合情報学研究科"},{"subitem_text_language":"ja","subitem_text_value":"東京情報大学総合情報学部情報システム学科"},{"subitem_text_language":"ja","subitem_text_value":"東京情報大学総合情報学部情報システム学科"},{"subitem_text_language":"ja","subitem_text_value":"東京情報大学総合情報学部情報システム学科"}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2011-09-30"}],"displaytype":"detail","filename":"KJ00007276439.pdf","filesize":[{"value":"652.2 kB"}],"format":"application/pdf","license_note":"TUIS","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"KJ00007276439","url":"https://tuis.repo.nii.ac.jp/record/394/files/KJ00007276439.pdf"},"version_id":"038982b4-6c64-4958-8cfd-3e98e1a89876"}]},"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":"ACO","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"AntNet","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"群知能","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"Path Search","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Graph Theory","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"ACO","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"AntNet","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Swarm intelligence","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":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"コストの変動するグラフにおける経路探索手法:AntNetの適用と改良","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"コストの変動するグラフにおける経路探索手法:AntNetの適用と改良","subitem_title_language":"ja"},{"subitem_title":"Path Search Method for Weighted Graphs with Weight Changes:Application and Improvement of AntNet","subitem_title_language":"en"}]},"item_type_id":"1","owner":"3","path":["59"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2011-09-30"},"publish_date":"2011-09-30","publish_status":"0","recid":"394","relation_version_is_last":true,"title":["コストの変動するグラフにおける経路探索手法:AntNetの適用と改良"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-12-22T02:41:52.620539+00:00"}