{"links":{},"id":177430,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00177430","sets":["1164:2735:9079:9080"]},"path":["9080"],"owner":"11","recid":"177430","title":["移住を低減するエリート保存方式をもつ分散遺伝的アルゴリズムの検討"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-02-20"},"_buckets":{"deposit":"6d220bb7-5558-4cf9-9838-95e94b3e92da"},"_deposit":{"id":"177430","pid":{"type":"depid","value":"177430","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"移住を低減するエリート保存方式をもつ分散遺伝的アルゴリズムの検討","author_link":["376455","376454"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"移住を低減するエリート保存方式をもつ分散遺伝的アルゴリズムの検討"}]},"item_type_id":"4","publish_date":"2017-02-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":"JAIST / Salesian Polytechnic","subitem_text_language":"en"},{"subitem_text_value":"JAIST","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/177430/files/IPSJ-MPS17112002.pdf","label":"IPSJ-MPS17112002.pdf"},"date":[{"dateType":"Available","dateValue":"2019-02-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS17112002.pdf","filesize":[{"value":"585.3 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":"590d22de-0f6a-4932-bb33-67564f9c4521","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 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_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":"従来より少ない移住量で解探索を可能とする分散遺伝的アルゴリズムを提案する．移住の少ない分散遺伝的アルゴリズムは，並列計算の際に計算ノード間の情報交換や同期によるオーバーヘッドを抑えることを可能とし，並列システムでの効率良い並列化を期待できる．提案法は，移住の頻度が低く頻繁に遺伝子情報を交換できず解探索が停滞する状況において，従来法より多くのエリート個体を個体群に残し解探索に関わらせる特徴を持ち，移住量の少ない環境での解探索の悪化を改善する．提案手法をベンチマーク問題に適用した結果，各島の個体数が適切に設定されている状況において，提案法は半分程度の移住量で従来と同等の解探索を可能とすることがわかった．","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":"2017-02-20","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"2017-MPS-112"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:46:59.378335+00:00","updated":"2025-01-20T05:28:12.183253+00:00"}