{"updated":"2025-01-20T17:56:13.193537+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00146512","sets":["1164:2735:7896:8400"]},"path":["8400"],"owner":"11","recid":"146512","title":["改良型Memoryを用いたMAX-MIN Ant System"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-12-08"},"_buckets":{"deposit":"3e9cc761-8591-4355-b48b-3f257652bcf7"},"_deposit":{"id":"146512","pid":{"type":"depid","value":"146512","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"改良型Memoryを用いたMAX-MIN Ant System","author_link":["228967","228968","228965","228966"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"改良型Memoryを用いたMAX-MIN Ant System"},{"subitem_title":"MAX-MIN Ant System with Improved Memory","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2015-12-08","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 Engineering, Tokyo City University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Knowledge 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/146512/files/IPSJ-MPS15106005.pdf","label":"IPSJ-MPS15106005.pdf"},"date":[{"dateType":"Available","dateValue":"2017-12-08"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS15106005.pdf","filesize":[{"value":"430.1 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":"97fa08c9-d10c-412c-88c7-d9343e5f830d","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 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":"Takashi, Isozaki","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":"本研究では新たなアントコロニー最適化技法 (ACO) を提案する．ACO はアリの採餌行動をモデル化したメタヒューリスティクスで，巡回セールスマン問題 (TSP) などの組み合わせ最適化問題の近似解を求めることができる．ACO の一種である MAX-MIN Ant System(MMAS) は高い精度で近似解を求めることができるが，収束が遅いなどの欠点がある．そこで提案手法では，MMAS 解を記憶させておくスペースである Memory を改良したものを持たせ，局所解からの脱出を目的とした近傍探索アリ，解の多様性の維持を目的とした複数のアリによるフェロモン更新を導入し，従来手法と比べて解の精度と収束速度の両方が向上したことを評価実験で確認した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We construct a new ACO algorithm by the introduction of an improved memory of individual ant into the MMAS. And we confirm the great effectiveness of our algorithm by comparing with other ACO algorithms using the benchmark problems from the TSPLIB.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2015-12-08","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2015-MPS-106"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:21:58.068981+00:00","id":146512,"links":{}}