{"created":"2023-07-27T06:25:06.620558+00:00","id":8274,"links":{},"metadata":{"_buckets":{"deposit":"d42f1d12-6491-4866-8f6a-851dd823fa7c"},"_deposit":{"created_by":3,"id":"8274","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"8274"},"status":"published"},"_oai":{"id":"oai:kanazawa-u.repo.nii.ac.jp:00008274","sets":["934:935:936"]},"author_link":["11517","11518","11519","187","11520"],"item_4_biblio_info_8":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2005-05-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"37","bibliographicPageEnd":"30","bibliographicPageStart":"27","bibliographicVolumeNumber":"2005","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告. MPS, 数理モデル化と問題解決研究報告"}]}]},"item_4_description_21":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"遺伝的アルゴリズム(GA)は, 進化のメカニズムに注目した最適化手法である.GAでは常に解を改善するように個体を進化させるため, 解が改善できない状態(進化的停滞)に陥ってしまい, 最適解を得ることが難しいという問題がある.この問題を解消する1つの方法として, 集団内の多様性を維持する方法があるが, その反面収束が遅くなってしまうという問題がある.そこで, 本研究では, 解を改善する改善集団と解を改悪する改悪集団を用いることによって, 解を常に改善するのではなく, 悪くすることによって進化的停滞を回避し, さらに収束速度が低減されないGAを提案する.また, 提案手法を時間枠つき配送計画問題に適用した結果, 従来のGAと比べ, 良い結果を得られたことを示す. Genetic Algorithms (GAs) are optimization methods inspired by evolutionary mechanisms. GAs fall into states which can't improve solutions (evolutionary stagnation) because indivisuals are always evoluated in order to improve. GAs have a difficulty problem to obtain the optimal solutions. As a way in order to dissolve this problem, the diversity maintenance of population, however, the problem occurs, which convergence speed becomes slow. This paper proposes a novel GA to avoid evolutionary stagnation by corrupting the solutions and also convergence speed does't become slow, by using improving population which improves the solutions, and corrupting population which corrupts the solutions, This paper also shows that good results compared with traditional GA on vehicle routing problems with time windows and function optimization problems.","subitem_description_type":"Abstract"}]},"item_4_description_5":{"attribute_name":"提供者所属","attribute_value_mlt":[{"subitem_description":"金沢大学理工研究域電子情報学系","subitem_description_type":"Other"}]},"item_4_publisher_17":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会"}]},"item_4_relation_28":{"attribute_name":"関連URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://ci.nii.ac.jp/naid/10016155994/","subitem_relation_type_select":"URI"}},{"subitem_relation_type_id":{"subitem_relation_type_id_text":"http://www.ipsj.or.jp/","subitem_relation_type_select":"URI"}}]},"item_4_rights_23":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"利用は著作権の範囲内に限られる"}]},"item_4_source_id_11":{"attribute_name":"NCID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0919-6072","subitem_source_identifier_type":"ISSN"}]},"item_4_version_type_25":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"村田, 裕章"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"越野, 亮"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"白山, 政敏"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"林, 貴宏"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"木村, 春彦"}],"nameIdentifiers":[{},{},{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-10-03"}],"displaytype":"detail","filename":"TE-PR-KIMURA-H-27.pdf","filesize":[{"value":"376.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"TE-PR-KIMURA-H-27.pdf","url":"https://kanazawa-u.repo.nii.ac.jp/record/8274/files/TE-PR-KIMURA-H-27.pdf"},"version_id":"d26a36d5-4554-42b8-a54d-4ef20cd652d3"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"改善集団と改悪集団による進化的停滞を回避する遺伝的アルゴリズムと時間枠つき配送計画問題への適用","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"改善集団と改悪集団による進化的停滞を回避する遺伝的アルゴリズムと時間枠つき配送計画問題への適用"},{"subitem_title":"Genetic Algorithm with Improving Population and Corrupting Population to Avoid Evolutionary Stagnantion, Application of Vehilcle Routing Problem with Time Windows","subitem_title_language":"en"}]},"item_type_id":"4","owner":"3","path":["936"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-10-03"},"publish_date":"2017-10-03","publish_status":"0","recid":"8274","relation_version_is_last":true,"title":["改善集団と改悪集団による進化的停滞を回避する遺伝的アルゴリズムと時間枠つき配送計画問題への適用"],"weko_creator_id":"3","weko_shared_id":-1},"updated":"2023-07-28T02:11:23.475732+00:00"}