{"id":241666,"updated":"2025-01-19T07:35:11.511120+00:00","links":{},"created":"2025-01-19T01:46:24.286038+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00241666","sets":["1164:1579:11464:11813"]},"path":["11813"],"owner":"44499","recid":"241666","title":["グリッドグラフを対象とするOrder/Degree問題における多段階探索交叉を用いた遺伝的アルゴリズムの提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-12-09"},"_buckets":{"deposit":"3abde6f2-f7ea-4140-afc1-625b2e0d1a36"},"_deposit":{"id":"241666","pid":{"type":"depid","value":"241666","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"グリッドグラフを対象とするOrder/Degree問題における多段階探索交叉を用いた遺伝的アルゴリズムの提案","author_link":["665718","665723","665722","665720","665717","665719","665716","665721"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グリッドグラフを対象とするOrder/Degree問題における多段階探索交叉を用いた遺伝的アルゴリズムの提案"},{"subitem_title":"Development of Genetic Algorithm with Multi-Step Search Crossover for Grid Graph in Order/Degree Problem","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"自動最適化","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2024-12-09","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/241666/files/IPSJ-ARC24259001.pdf","label":"IPSJ-ARC24259001.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC24259001.pdf","filesize":[{"value":"1.6 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"b4106f75-5086-4de2-a26c-f2c17c218153","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 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":"AN10096105","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-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"Order/Degree Problems（ODP）におけるグリッドグラフは所与の頂点数（Order），次数（Degree），および辺の最大長をもつ 2 次元格子上に頂点が配置された無向連結グラフにおいて，頂点間の平均距離を最小化する組合せ最適化問題である．遺伝的アルゴリズム（GA）を組合せ最適化問題に適用するにあたり，交叉オペレータの設計は重要な課題である．本研究では，ODP グリッドグラフに対して，局所探索性能に優れた交叉手法である dMSXF を導入した GA を提案する．提案手法の探索性能について，ODP のための国際的なコンペティションである Graph Golf で提供されているベンチマーク問題を用いて評価する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Grid graphs in Order/Degree Problems (ODP) are combinatorial optimization problems that minimize the average distance between vertices in an undirected connected graph whose vertices are arranged on a 2-dimensional grid with a given number of vertices (Order), degree (Degree), and maximum edge length. In applying genetic algorithms (GAs) to combinatorial optimization problems, the design of crossover operators is an important issue. In this study, we propose a GA for ODP grid graphs by introducing dMSXF, a crossover method with excellent local search performance. The search performance of the proposed method is evaluated using benchmark problems provided by Graph Golf, an international competition for ODP.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2024-12-09","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2024-ARC-259"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}