{"updated":"2025-01-19T18:44:10.901995+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00208747","sets":["1164:2735:10153:10432"]},"path":["10432"],"owner":"44499","recid":"208747","title":["Cartesian genetic programmingを用いた転移利用可能な積み付けアルゴリズムの自動生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2020-12-10"},"_buckets":{"deposit":"3b9c9f76-d2e5-4bef-8c3b-06e453cc3b63"},"_deposit":{"id":"208747","pid":{"type":"depid","value":"208747","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Cartesian genetic programmingを用いた転移利用可能な積み付けアルゴリズムの自動生成","author_link":["524537","524535","524538","524534","524536"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Cartesian genetic programmingを用いた転移利用可能な積み付けアルゴリズムの自動生成"},{"subitem_title":"Automated construction of Transferable loading algorithm with Cartesian genetic programming","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2020-12-10","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"横浜国立大学"},{"subitem_text_value":"横浜国立大学"},{"subitem_text_value":"株式会社IHI"},{"subitem_text_value":"横浜国立大学／株式会社IHI"},{"subitem_text_value":"横浜国立大学"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Yokohama National University","subitem_text_language":"en"},{"subitem_text_value":"Yokohama National University","subitem_text_language":"en"},{"subitem_text_value":"IHI Corporation","subitem_text_language":"en"},{"subitem_text_value":"Yokohama National University / IHI Corporation","subitem_text_language":"en"},{"subitem_text_value":"Yokohama National University","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/208747/files/IPSJ-MPS20131010.pdf","label":"IPSJ-MPS20131010.pdf"},"date":[{"dateType":"Available","dateValue":"2022-12-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS20131010.pdf","filesize":[{"value":"567.8 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":"bc6205a5-075b-4951-beba-a13aca5c5be3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2020 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":[{}]},{"creatorNames":[{"creatorName":"小熊, 祐司"}],"nameIdentifiers":[{}]},{"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":"本論文では，定義された目的関数のもとで，Cartesian genetic programming（CGP）を用いた転移利用可能な積み付けアルゴリズムの自動生成技術を提案する．提案法では，積み付け候補から選択する基準として選択ルールを複数定義し，その実行順位を出力するモデルを CGP で構築する．類似問題へ転移利用するシミュレーション実験では，提案法がベースラインと同等の性能を導出できることを示す．これは，自動生成された積み付けアルゴリズムが，ヒトによる追加評価なしで，類似問題へ転移利用できる可能性を示す意義がある．","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":"2020-12-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"10","bibliographicVolumeNumber":"2020-MPS-131"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:10:07.385332+00:00","id":208747,"links":{}}