{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00214727","sets":["6504:10735:10805"]},"path":["10805"],"owner":"44499","recid":"214727","title":["疲労を考慮したクラスタリングによる巡回セールスマン問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-03-04"},"_buckets":{"deposit":"c797be49-092c-4073-9d79-f585fc82c473"},"_deposit":{"id":"214727","pid":{"type":"depid","value":"214727","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"疲労を考慮したクラスタリングによる巡回セールスマン問題の解法","author_link":["552032","552031"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"疲労を考慮したクラスタリングによる巡回セールスマン問題の解法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2021-03-04","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_22_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京都市大"},{"subitem_text_value":"東京都市大"}]},"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/214727/files/IPSJ-Z83-7J-03.pdf","label":"IPSJ-Z83-7J-03.pdf"},"date":[{"dateType":"Available","dateValue":"2021-12-28"}],"format":"application/pdf","filename":"IPSJ-Z83-7J-03.pdf","filesize":[{"value":"382.1 kB"}],"mimetype":"application/pdf","accessrole":"open_date","version_id":"a666031a-3814-4289-acdf-3a65f9cea185","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_22_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"内田, 純平"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"穴田, 一"}],"nameIdentifiers":[{}]}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_5794","resourcetype":"conference paper"}]},"item_22_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN00349328","subitem_source_identifier_type":"NCID"}]},"item_22_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"最も効率が良い組み合わせを求める組み合わせ最適化問題には, 与えられた全ての都市を巡る最短経路を求める巡回セールスマン問題(Traveling Salesman Problem, TSP)がある. TSPには多くの工学的応用分野が存在し, これらの応用分野が扱う問題は年々大規模化している. しかし, TSPの最適解を求めることはNP困難と呼ばれる問題クラスに属しており, 大規模TSPに対しては最適解を求める厳密解法よりも, 実用的な時間内にできるだけ良い解を求める近似解法の研究が盛んである.　そこで本研究では, 新たな近似解法として疲労を考慮した階層型クラスタリングによって構成した最後のクラスタの重心で初期経路を生成し, その階層をもとにもどしながら経路生成を行うアルゴリズムを構築した.","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"240","bibliographic_titles":[{"bibliographic_title":"第83回全国大会講演論文集"}],"bibliographicPageStart":"239","bibliographicIssueDates":{"bibliographicIssueDate":"2021-03-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2021"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":214727,"updated":"2025-01-19T16:29:47.366540+00:00","links":{},"created":"2025-01-19T01:15:31.694028+00:00"}