{"created":"2025-01-19T00:45:59.368158+00:00","updated":"2025-01-20T05:54:27.288791+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00176335","sets":["934:989:8398:8952"]},"path":["8952"],"owner":"11","recid":"176335","title":["蟻コロニー最適化と遺伝的アルゴリズムの間"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-12-14"},"_buckets":{"deposit":"3482d576-4f52-4710-8ce0-d1c39a9150f3"},"_deposit":{"id":"176335","pid":{"type":"depid","value":"176335","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"蟻コロニー最適化と遺伝的アルゴリズムの間","author_link":["370837","370836","370835","370838"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"蟻コロニー最適化と遺伝的アルゴリズムの間"},{"subitem_title":"Between Ant Colony Optimization and Generic Algorithm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] 蟻コロニー最適化，遺伝的アルゴリズム，イジング・モデル，投票モデル","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2016-12-14","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"金融庁"},{"subitem_text_value":"日本電気株式会社"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Financial Services Agency","subitem_text_language":"en"},{"subitem_text_value":"NEC Corporation","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/176335/files/IPSJ-TOM0903004.pdf","label":"IPSJ-TOM0903004.pdf"},"date":[{"dateType":"Available","dateValue":"2018-12-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM0903004.pdf","filesize":[{"value":"371.8 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":"ae51bec4-075d-4206-ab2a-dec878d11a22","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":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Masato, Hisakado","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masafumi, Hino","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","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-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"情報カスケードは人々の模倣行為によって，情報が連鎖的に伝達する現象である．バンク・ランをはじめとして，誤った情報が連鎖的に伝わることが，研究対象にされることも多い．その一方，情報カスケードは正しい情報を効率的に伝える，という役割を果たすこともある．蟻コロニー最適化（ACO）は蟻のフェロモンに反応して他者を模倣する行為を利用して最適化を行うアルゴリズムであり，巡回セールスマン問題（TSP）などで有効なアルゴリズムであることが知られている．遺伝的アルゴリズムは子の遺伝子は親の遺伝子を模倣することと突然変異を利用するアルゴリズムである．我々はこの3つのモデルの関係を調べ，情報カスケードのモデルである投票モデルで記述できることを示した．この情報カスケードのモデルは数理的な解析が可能であり，また情報カスケード転移という相転移があることが分かっている．このことを利用して蟻コロニー最適化と遺伝的アルゴリズムのハイブリッドであるアルゴリズムを考えた．またこのアルゴリズムを利用し，2択のクイズでの最適化を行った．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"In this paper, we discuss a relation among ant colony optimization, generic algorithm and a voting model. The voting model represents how voters are given the public perceptions. A voting model is constructed by two types of voters-herders and independents and two candidates. The voting of independents is based on their fundamental values; on the other hand, the voting of herders is based on the number of previous votes. Herders corresponds to ants that follow pheromone trail and independents are dull ants which cannot trail the pheromone in ant colony optimization. In generic algorithm, herders corresponds to the DNA which is succeeded from parents to children and independents corresponds to mutations. We made a new algorithm between ant colony optimization and generic algorithm and apply it to the a two-choice quiz optimization.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"14","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"8","bibliographicIssueDates":{"bibliographicIssueDate":"2016-12-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"9"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":176335,"links":{}}