{"created":"2023-05-15T12:30:52.129010+00:00","id":440,"links":{},"metadata":{"_buckets":{"deposit":"934fa7e7-1fa8-43f7-a9e7-9dd22baa3327"},"_deposit":{"created_by":2,"id":"440","owners":[2],"pid":{"revision_id":0,"type":"depid","value":"440"},"status":"published"},"_oai":{"id":"oai:fit.repo.nii.ac.jp:00000440","sets":["256:257:299"]},"author_link":["2090","2085","2087","2086","2089","2088"],"item_3_alternative_title_23":{"attribute_name":"タイトル（ヨミ）","attribute_value_mlt":[{"subitem_alternative_title":"イデンテキ アルゴリズム ニヨル ネットワーク セツゾク ノ サイテキカ"}]},"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-09-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"10","bibliographicPageStart":"7","bibliographicVolumeNumber":"41","bibliographic_titles":[{"bibliographic_title":"福岡工業大学研究論集"}]}]},"item_3_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_3_description_47":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"論文(Article)","subitem_description_type":"Other"}]},"item_3_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"The optimum connection of networks under a certain conditions is investigated by using the genetic algorithm. The condition employed by Hiroyasu and Suzuki in an analysis of a complex network is to minimize the average distance of the shortest path between every two nodes, by fixing the number of all links. However this condition does not guarantee the minimum cost. Instead we propose alternative conditions to minimize the following two factors: (1) construction cost of links; (2) average distance of the shortest path between every two nodes. In obtaining the shortest path we use the method proposed by Dijkstra. Optimization is performed for the case of 50 nodes, which are randomly located in some closed area, by changing the weighting factor between the above two conditions. As a result, the relation of the average distance versus the construction cost is obtained. Such computations are performed within three hours by using a conventional personal computer.","subitem_description_type":"Other"}]},"item_3_full_name_2":{"attribute_name":"著者(ヨミ)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"2087","nameIdentifierScheme":"WEKO"}],"names":[{"name":"カワゾエ, ユウキ"}]},{"nameIdentifiers":[{"nameIdentifier":"2088","nameIdentifierScheme":"WEKO"}],"names":[{"name":"カトウ, トモヒコ"}]}]},"item_3_full_name_3":{"attribute_name":"別言語の著者","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"2089","nameIdentifierScheme":"WEKO"}],"names":[{"name":"KAWAZOE, Yuhki"}]},{"nameIdentifiers":[{"nameIdentifier":"2090","nameIdentifierScheme":"WEKO"}],"names":[{"name":"KATO, Tomohiko"}]}]},"item_3_publisher_37":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"福岡工業大学"}]},"item_3_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"02876620","subitem_source_identifier_type":"ISSN"}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10036974","subitem_source_identifier_type":"NCID"}]},"item_3_subject_20":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"007.1","subitem_subject_scheme":"NDC"}]},"item_3_text_18":{"attribute_name":"形態","attribute_value_mlt":[{"subitem_text_value":"1586362 bytes"}]},"item_3_text_38":{"attribute_name":"出版者（ヨミ）","attribute_value_mlt":[{"subitem_text_value":"フクオカ コウギョウ ダイガク"}]},"item_3_text_39":{"attribute_name":"別言語の出版者","attribute_value_mlt":[{"subitem_text_value":"Fukuoka Institute of Technology"}]},"item_3_text_48":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_3_text_49":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_3_text_50":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_3_text_51":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"02"}]},"item_3_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"川添, 勇気"}],"nameIdentifiers":[{"nameIdentifier":"2085","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"加藤, 友彦"}],"nameIdentifiers":[{"nameIdentifier":"2086","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2020-09-14"}],"displaytype":"detail","filename":"11478-968_p7 加藤　友彦.pdf","filesize":[{"value":"1.6 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"11478-968_p7 加藤　友彦.pdf","url":"https://fit.repo.nii.ac.jp/record/440/files/11478-968_p7 加藤　友彦.pdf"},"version_id":"0c264414-edf4-47be-8061-b48d9ee6aedf"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"network connection","subitem_subject_scheme":"Other"},{"subitem_subject":"optimization, genetic algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"method of Dijkstra","subitem_subject_scheme":"Other"},{"subitem_subject":"network connection","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"optimization, genetic algorithm","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"method of Dijkstra","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"遺伝的アルゴリズムによるネットワーク接続の最適化","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"遺伝的アルゴリズムによるネットワーク接続の最適化"},{"subitem_title":"Optimization of Network Connections by Genetic Algorithm","subitem_title_language":"en"}]},"item_type_id":"3","owner":"2","path":["299"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-06-21"},"publish_date":"2018-06-21","publish_status":"0","recid":"440","relation_version_is_last":true,"title":["遺伝的アルゴリズムによるネットワーク接続の最適化"],"weko_creator_id":"2","weko_shared_id":2},"updated":"2023-05-15T12:56:23.052102+00:00"}