{"created":"2025-01-19T00:47:00.059245+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00177442","sets":["1164:2735:9079:9080"]},"path":["9080"],"owner":"11","recid":"177442","title":["個別機会制約条件を含む最適化問題の経験分布と差分進化による解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-02-20"},"_buckets":{"deposit":"8a1341d0-f949-42c1-a3fd-190ed6b2667f"},"_deposit":{"id":"177442","pid":{"type":"depid","value":"177442","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"個別機会制約条件を含む最適化問題の経験分布と差分進化による解法","author_link":["376532","376533"],"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_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/177442/files/IPSJ-MPS17112014.pdf","label":"IPSJ-MPS17112014.pdf"},"date":[{"dateType":"Available","dateValue":"2019-02-20"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS17112014.pdf","filesize":[{"value":"297.7 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":"c23eb470-b960-4ee8-84be-3b5ad26d0809","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":"本稿では，個別機会制約条件を含む最適化問題 （機会制約問題と呼ぶ） に対し，計算統計学の技法である経験分布と，進化アルゴリズムの 1 つである差分進化を組み合わせた解法を提案する．経験分布から分位点を推定することで，従来のモンテカルロ法よりも遥に少ない標本で解を評価できる．また，差分進化を用いることで，微分不可能な多峰性の関数を含む機会制約問題にも適用できる．さらに，経験分布による分位点の精度を高めるため，重み付き経験分布を採用する．最後に，提案した解法により機会制約問題の実効可能解が得られること，解の精度で重み付き経験分布は，経験分布に勝ることを示す．","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":"14","bibliographicVolumeNumber":"2017-MPS-112"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"links":{},"id":177442,"updated":"2025-01-20T05:28:30.974213+00:00"}