{"updated":"2025-01-20T04:50:22.301109+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00180665","sets":["6504:9168:9184"]},"path":["9184"],"owner":"6748","recid":"180665","title":["対数感度と改良型Memoryを用いたMAX-MIN Ant Systemによる巡回セールスマン問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-03-16"},"_buckets":{"deposit":"e3f9193e-a0ae-4950-ab20-c4b0f0e940c3"},"_deposit":{"id":"180665","pid":{"type":"depid","value":"180665","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"対数感度と改良型Memoryを用いたMAX-MIN Ant Systemによる巡回セールスマン問題の解法","author_link":["390512","390513"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"対数感度と改良型Memoryを用いたMAX-MIN Ant Systemによる巡回セールスマン問題の解法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2017-03-16","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都市大"},{"subitem_text_value":"東京都市大"}]},"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/180665/files/IPSJ-Z79-3J-02.pdf","label":"IPSJ-Z79-3J-02.pdf"},"date":[{"dateType":"Available","dateValue":"2017-05-22"}],"format":"application/pdf","filename":"IPSJ-Z79-3J-02.pdf","filesize":[{"value":"877.9 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"6608935a-064d-41d5-a0bf-ffa7497d0d26","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"磯崎, 敬志"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"穴田, 一"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究では，対数感度と改良型Memory を用いたMAXMIN Ant System という新たなアントコロニー最適化技法(ACO)の提案を行い，それを組み合わせ最適化問題の一種である巡回セールスマン問題(TSP)に適用し，その有効性を検証した．本研究ではACOの一種であるMMAS の収束速度と解の精度の両方を向上させることを目的とし，ACO with Memoryで用いられたMemory の改良型の導入と，フェロモン情報およびヒューリスティック情報にウェーバー・フェヒナーの法則を用いて都市選択を行うアルゴリズムを構築した．評価実験では，TSPのベンチマーク問題を用いて従来手法との比較を行った．その結果，MMASの欠点であった収束の遅さの改善とともに，厳密解到達率の大幅な向上を確認した．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"342","bibliographic_titles":[{"bibliographic_title":"第79回全国大会講演論文集"}],"bibliographicPageStart":"341","bibliographicIssueDates":{"bibliographicIssueDate":"2017-03-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2017"}]},"relation_version_is_last":true,"weko_creator_id":"6748"},"created":"2025-01-19T00:48:29.412342+00:00","id":180665,"links":{}}