{"created":"2025-01-19T01:31:15.645064+00:00","updated":"2025-01-19T10:52:39.181832+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00231100","sets":["1164:2240:11176:11408"]},"path":["11408"],"owner":"44499","recid":"231100","title":["遺伝的アルゴリズムによるOrder/Degree問題におけるグリッドグラフの一解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-11-28"},"_buckets":{"deposit":"7c70f446-226b-42c4-a071-8d732b038099"},"_deposit":{"id":"231100","pid":{"type":"depid","value":"231100","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"遺伝的アルゴリズムによるOrder/Degree問題におけるグリッドグラフの一解法","author_link":["623369","623373","623372","623374","623370","623368","623375","623371"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝的アルゴリズムによるOrder/Degree問題におけるグリッドグラフの一解法"},{"subitem_title":"Development of Genetic Algorithm for Grid Graph in Order/Degree Problem","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"AIとグラフ","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2023-11-28","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"関西大学システム理工学部"},{"subitem_text_value":"関西大学システム理工学部"},{"subitem_text_value":"理化学研究所計算科学研究センター"},{"subitem_text_value":"理化学研究所計算科学研究センター"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering Science, Kansai University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering Science, Kansai University","subitem_text_language":"en"},{"subitem_text_value":"RIKEN Center for Computational Science","subitem_text_language":"en"},{"subitem_text_value":"RIKEN Center for Computational Science","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/231100/files/IPSJ-HPC23192022.pdf","label":"IPSJ-HPC23192022.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-HPC23192022.pdf","filesize":[{"value":"2.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"14"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"9877f390-6097-41c9-8ed4-32174bad32b6","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"木村, 弘登"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"花田, 良子"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"中尾, 昌広"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"山本, 啓二"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroto, Kimura","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yoshiko, Hanada","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masahiro, Nakao","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Keiji, Yamamoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10463942","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-8841","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Order/Degree 問題の一種であるグリッドグラフにおいて遺伝的アルゴリズムによる解法を提案する．グリッドグラフは，頂点数（Order）と最大次数（Degree），および辺の最大長が与えられたもと，2 次元格子の節点上に配置された頂点からなる無向の連結グラフの中で，最小の平均頂点間距離となるものを求める最適化問題である． ODP に関する国際コンペティション GraphGolf で出題された例題を用いて，提案手法の解探索性能を検証する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a genetic algorithm for solving grid graph that is a kind of Order/Degree problems (ODP). Grid graph is an optimization problem to find the minimum average distance between vertices in an undirected connected graph consisting of vertices placed on nodes of a two-dimensional grid, given the number of vertices (Order), the maximum degree (Degree), and the maximum length of edges. We verify the performance of the proposed method using instances presented by Graph Golf, an international ODP competition.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告ハイパフォーマンスコンピューティング（HPC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-11-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"22","bibliographicVolumeNumber":"2023-HPC-192"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":231100,"links":{}}