{"created":"2025-01-18T23:30:56.659289+00:00","updated":"2025-01-21T22:40:12.708557+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00072671","sets":["934:989:6318:6319"]},"path":["6319"],"owner":"11","recid":"72671","title":["遺伝的アルゴリズムにおける最適解がはじめて出現する世代数の実験的解析"],"pubdate":{"attribute_name":"公開日","attribute_value":"2011-01-26"},"_buckets":{"deposit":"9f0ddcf5-0acf-4560-addb-87579f574150"},"_deposit":{"id":"72671","pid":{"type":"depid","value":"72671","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"遺伝的アルゴリズムにおける最適解がはじめて出現する世代数の実験的解析","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝的アルゴリズムにおける最適解がはじめて出現する世代数の実験的解析"},{"subitem_title":"Experimental Analysis of the First Appearing Time of Optimum Solution in Genetic Algorithm","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"事例紹介論文","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2011-01-26","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"宮崎大学大学院農学工学総合研究科"},{"subitem_text_value":"宮崎大学工学部"},{"subitem_text_value":"宮崎大学工学部"},{"subitem_text_value":"宮崎大学工学部"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Interdisciplinary Graduate School of Agriculture and Engineering, University of Miyazaki","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, University of Miyazaki","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, University of Miyazaki","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, University of Miyazaki","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/72671/files/IPSJ-TOM0401009.pdf"},"date":[{"dateType":"Available","dateValue":"2013-01-26"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM0401009.pdf","filesize":[{"value":"699.5 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":"feff4928-03f5-4070-b911-863d727e0467","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2011 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"張, 玉安"},{"creatorName":"馬, 青蓮"},{"creatorName":"坂本, 眞人"},{"creatorName":"古谷, 博史"}],"nameIdentifiers":[{}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yu-an, Zhang","creatorNameLang":"en"},{"creatorName":"QingLian, Ma","creatorNameLang":"en"},{"creatorName":"Makoto, Sakamoto","creatorNameLang":"en"},{"creatorName":"Hiroshi, Furutani","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":"最適化手法として遺伝的アルゴリズム （GA） の有効性が数多く報告されている．しかし GA は多大な計算量を必要とする．そのため，GA の計算性能を高めるためには，計算時間の研究が重要である．本研究では，最適解が集団中にはじめて出現する世代数の平均Tと平均収束時間 Tconv，成功確率 S，および最適解の平均生存時間aの関係について実験的に調べた．ここで，S は GA を M 回繰り返し計算し，そのうち集団中に最適解が存在する割合，a は集団が最適解を保持する時間数 （世代数） の平均と定義する．適応度として積型適応度関数を用いた数値実験を行い，T と Tconv，S，a の間の関係について解析した結果について報告する．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"There are many reports which support the effectiveness of genetic algorithm (GA) as an optimization method. However, a major drawback of GA is its heavy computational load. Therefore, it is important to study the computing time for improving calculation performance of GA. In this study, we examine experimentally the relationship of the average hitting time T of optimum solution, the average convergence time Tconv，success probability S and the mean survival time of optimum solution a. We define S as the probability  which a population contains optimal solution in M repeated runs, a as the average generations  containing the optimum solution in a population. We report results of the analysis for the relations between T and Tconv, S, a through numerical experiments  by using the multiplicative fitness function.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"88","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"82","bibliographicIssueDates":{"bibliographicIssueDate":"2011-01-26","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"4"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":72671,"links":{}}