{"created":"2023-05-15T12:25:31.644187+00:00","id":821,"links":{},"metadata":{"_buckets":{"deposit":"f664ac4a-9e73-4ff6-b93e-19afc161f7e4"},"_deposit":{"created_by":4,"id":"821","owners":[4],"pid":{"revision_id":0,"type":"depid","value":"821"},"status":"published"},"_oai":{"id":"oai:kait.repo.nii.ac.jp:00000821","sets":["2:16:41:112"]},"author_link":[],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1998-03-20","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"101","bibliographicPageStart":"95","bibliographicVolumeNumber":"22","bibliographic_titles":[{"bibliographic_title":"神奈川工科大学研究報告.B,理工学編"}]}]},"item_10002_description_19":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"It is well known that traveling salesm皿problem(for short. TSP) is one of most important problems\nfor optimization, and almost all optimization problems result in TSP. This paper describes on an\neffective solution of TSP using genetic algorithm.\nThe features of our method are summarized as follows: (1) By using division and unification method, a\nlarge problem is replaced with some small ones. (2) Smoothing method proposed in this paper enables us\nto obtain a fine approximate solution globally. Accordingly, demerits caused by division and unification\nmethod are decreased. (3) Parallel operation is available because all divided problems are independent of\neach other.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_10002_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.34411/00000814","subitem_identifier_reg_type":"JaLC"}]},"item_10002_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"神奈川工科大学"}]},"item_10002_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10074179","subitem_source_identifier_type":"NCID"}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09161902","subitem_source_identifier_type":"PISSN"}]},"item_10002_version_type_20":{"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":"荒木, 智行","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"山本, 富士男","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"巽, 久行","creatorNameLang":"ja"}]},{"creatorNames":[{"creatorName":"Araki, Tomoyuki","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Yamamoto, Fujio","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Tatsumi, Hisayuki","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2010-02-03"}],"displaytype":"detail","filename":"kkb-022-016.pdf","filesize":[{"value":"3.1 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kkb-022-016.pdf","objectType":"fulltext","url":"https://kait.repo.nii.ac.jp/record/821/files/kkb-022-016.pdf"},"version_id":"a4aa27d4-e25a-407b-9421-75799c50963f"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"traveling salesm皿problem,genetic algorithm, parallelism, smoothing method","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_language":"ja"},{"subitem_title":"An Approximate Solution Considering Parallelism for Traveling Salesman Problem Using Genetic Algorithm","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"4","path":["112"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2020-11-24"},"publish_date":"2020-11-24","publish_status":"0","recid":"821","relation_version_is_last":true,"title":["遺伝的アルゴリズムによる巡回セールスマン問題の並列化を考慮した近似解法"],"weko_creator_id":"4","weko_shared_id":-1},"updated":"2023-08-18T03:24:06.662894+00:00"}