{"updated":"2025-01-19T23:07:23.152435+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00195414","sets":["581:9633:9636"]},"path":["9636"],"owner":"44499","recid":"195414","title":["他個体を参照した進化的計算による巡回セールスマン問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-03-15"},"_buckets":{"deposit":"cd1984ba-9d31-4d32-b465-9c4b70abca09"},"_deposit":{"id":"195414","pid":{"type":"depid","value":"195414","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"他個体を参照した進化的計算による巡回セールスマン問題の解法","author_link":["465225","465226","465227","465228"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"他個体を参照した進化的計算による巡回セールスマン問題の解法"},{"subitem_title":"A Novel Evolutionary Algorithm for Solving the Traveling Salesman Problem","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[一般論文（特選論文）] 進化的計算，進化的アルゴリズム，遺伝的アルゴリズム，巡回セールスマン問題","subitem_subject_scheme":"Other"}]},"item_type_id":"2","publish_date":"2019-03-15","item_2_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都市大学大学院工学研究科"},{"subitem_text_value":"東京都市大学大学院工学研究科"}]},"item_2_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Engineering, Tokyo City University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering, Tokyo City University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/195414/files/IPSJ-JNL6003026.pdf","label":"IPSJ-JNL6003026.pdf"},"date":[{"dateType":"Available","dateValue":"2021-03-15"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JNL6003026.pdf","filesize":[{"value":"1.9 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"a9aab852-794e-4df9-8884-b490ffe88814","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_2_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"佐藤, 豊浩"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"穴田, 一"}],"nameIdentifiers":[{}]}]},"item_2_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Toyohiro, Sato","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hajime, Anada","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_2_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00116647","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_2_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7764","subitem_source_identifier_type":"ISSN"}]},"item_2_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"進化的計算は，生物学的進化から着想を得た操作により，生物個体を模した複数の解候補を解空間上で移動させることで高精度な解を探索するという近似解法の枠組みの1つである．しかし，進化的計算の考えを基に設計された既存手法には，自然界の生物の仕組みに囚われ過ぎている部分がある．加えて，探索集団が持ち合わせない新規要素の発見が乱数に強く依存している．そこで，本研究では進化的計算の考えを基に，自然界の仕組みよりも巡回セールスマン問題を解くことに重点を置いた，乱数に強く依存しない突然変異を導入した新たなアルゴリズム，参照進化（Referential Evolution，RE）を構築した．そして，巡回セールスマン問題のベンチマーク問題を用いて，近似解を高精度かつ高速に求めることでその有効性を確認した．","subitem_description_type":"Other"}]},"item_2_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Evolutionary computation (EC) is an evolution-inspired algorithm and is one of the approximation algorithms. EC's emphasis lies in the mechanism of biological evolution. Therefore, we constructed a new algorithm named Referential Evolution (RE) whose main emphasis is not biological evolution. This was done to solve non-deterministic polynomial-time hard combinational problems. We confirmed the effectiveness of our proposed algorithm by comparing it to other EC-based algorithms using several benchmark problems taken from the TSPLIB, which is a library of traveling salesman problem.","subitem_description_type":"Other"}]},"item_2_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"933","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌"}],"bibliographicPageStart":"926","bibliographicIssueDates":{"bibliographicIssueDate":"2019-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"60"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:00:20.801998+00:00","id":195414,"links":{}}