{"id":218604,"updated":"2025-01-19T15:06:41.683458+00:00","links":{},"created":"2025-01-19T01:18:57.583520+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00218604","sets":["1164:2735:10865:10962"]},"path":["10962"],"owner":"44499","recid":"218604","title":["ローカルコミュニケーションを考慮したMAX-MIN Ant System with Memory"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-06-20"},"_buckets":{"deposit":"ba3445d5-cecb-446c-bf44-f3c6c3bf9332"},"_deposit":{"id":"218604","pid":{"type":"depid","value":"218604","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"ローカルコミュニケーションを考慮したMAX-MIN Ant System with Memory","author_link":["568922","568924","568923","568921"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"ローカルコミュニケーションを考慮したMAX-MIN Ant System with Memory"},{"subitem_title":"MAX-MIN Ant System with Memory Considering Local Communication","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-06-20","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都市大学大学院総合理工学研究科"},{"subitem_text_value":"東京都市大学大学院総合理工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Integrative Science and Engineering, Tokyo City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Integrative Science and Engineering, Tokyo City 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/218604/files/IPSJ-MPS22138034.pdf","label":"IPSJ-MPS22138034.pdf"},"date":[{"dateType":"Available","dateValue":"2024-06-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS22138034.pdf","filesize":[{"value":"521.9 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"31456d67-2cc4-4864-ad21-14e51f0621cc","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 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":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroto, Endo","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hajime, Anada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","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-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"現実社会の多くの問題は，組み合わせ最適化問題に帰着することができる．代表的な問題に巡回セールスマン問題 (TSP) があるが，この問題は規模が大きくなるにつれて計算量が爆発的に増加するため，近似解を高速かつ高精度に解く必要がある．近似解を求める手法の 1 つに，アリの採餌行動を模倣したアルゴリズムであるアントコロニー最適化法 (ACO) がある．ACO の一種である MAX-MIN Ant System with Memory は非常に興味深い手法であるが，フェロモンによるグローバルなコミュニケーションのみしか考慮されていない．そこで本研究では，現実のアリが実際に行っているローカルコミュニケーションを考慮した新たな ACO を構築し，TSP に適用して有効性を確認した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-06-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"34","bibliographicVolumeNumber":"2022-MPS-138"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}