{"created":"2025-01-19T01:13:13.425126+00:00","updated":"2025-01-19T17:34:02.015022+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00212228","sets":["934:989:10456:10630"]},"path":["10630"],"owner":"44499","recid":"212228","title":["Cartesian Genetic Programmingを用いた転用可能な積み付けアルゴリズムの自動生成"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-08-10"},"_buckets":{"deposit":"01326ebb-86c1-4aeb-841c-c12e47c720f3"},"_deposit":{"id":"212228","pid":{"type":"depid","value":"212228","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"Cartesian Genetic Programmingを用いた転用可能な積み付けアルゴリズムの自動生成","author_link":["540996","540998","540994","541000","540995","540997","540993","541001","540992","540999"],"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_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] 遺伝的プログラミング，アルゴリズム自動生成，積み付け最適化","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2021-08-10","item_3_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_3_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/212228/files/IPSJ-TOM1403003.pdf","label":"IPSJ-TOM1403003.pdf"},"date":[{"dateType":"Available","dateValue":"2023-08-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1403003.pdf","filesize":[{"value":"5.0 MB"}],"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":"d5af0b7f-e04b-4be5-a1f6-1f90268b39fd","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_3_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_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yusuke, Hiruta","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kei, Nishihara","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yuji, Koguma","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masakazu, Fujii","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masaya, Nakata","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":"本論文では，人手による積み付けパターン設計の自動化を目的とし，Cartesian Genetic Programming（CGP）を用いた転用可能な積み付けアルゴリズムの自動生成技術を提案する．提案法は，積み方の種類と積み付け位置を同時に考慮した選択ルールを定義し，CGPで同ルールの実行順を最適化することで，少ない評価回数で積み付けアルゴリズムを生成できる．数値実験では，提案法が200回の評価回数でベースラインと競合する積み付けアルゴリズムを生成可能であり，導出した積み付けアルゴリズムが段ボール箱の種類と個数が異なる問題に転用可能であることを示した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"This paper proposes an automatic construction technique of transferable loading algorithms based on Cartesian Genetic Programming. The proposed method aims to construct the loading algorithm with a few hundred fitness evaluations by optimizing the execution order of rules to decide a type of multiple cardboard boxes and their loadable positions simultaneously. Experimental results show that auto-constructed loading algorithms can derive competitive performances to defined baselines under two hundred fitness evaluations on similar problems without any additional fitness evaluation.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"26","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"11","bibliographicIssueDates":{"bibliographicIssueDate":"2021-08-10","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"14"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":212228,"links":{}}