{"created":"2025-01-19T01:42:10.954192+00:00","updated":"2025-01-19T08:27:54.829033+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00238869","sets":["6201:6202:9108:11762"]},"path":["11762"],"owner":"44499","recid":"238869","title":["粘菌ネットワークを用いた可変待ち時間有TSPの最適化"],"pubdate":{"attribute_name":"公開日","attribute_value":"2024-09-29"},"_buckets":{"deposit":"b2cbe78a-ba7d-4753-a8c6-22b72ba10194"},"_deposit":{"id":"238869","pid":{"type":"depid","value":"238869","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"粘菌ネットワークを用いた可変待ち時間有TSPの最適化","author_link":["654281","654280","654283","654282"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"粘菌ネットワークを用いた可変待ち時間有TSPの最適化"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"可変待ち時間有TSP 、粘菌ネットワーク、経路探索","subitem_subject_scheme":"Other"}]},"item_type_id":"19","publish_date":"2024-09-29","item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_19_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"和歌山工業高等専門学校"},{"subitem_text_value":"和歌山工業高等専門学校"},{"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/238869/files/IPSJ-Kansai2024(69).pdf","label":"IPSJ-Kansai2024(69).pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-29"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Kansai2024(69).pdf","filesize":[{"value":"665.5 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"8"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e18a32d3-efb6-4aff-bcf3-1c1fc3f33918","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2024 by the Information Processing Society of Japan"}]},"item_19_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"宇野, 友翔"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"謝, 孟春"}],"nameIdentifiers":[{}]},{"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_19_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1884-197X","subitem_source_identifier_type":"ISSN"}]},"item_19_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"粘菌ネットワークは最短経路を探索する有力的な手法の一つである。本研究では、テーマパークを対象とし、待ち時間が変化する環境において、粘菌ネットワーク手法を用いて最短時間で巡回する経路の探索を検討する。","subitem_description_type":"Other"}]},"item_19_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographic_titles":[{"bibliographic_title":"2024年度 情報処理学会関西支部 支部大会 講演論文集"}],"bibliographicIssueDates":{"bibliographicIssueDate":"2024-09-29","bibliographicIssueDateType":"Issued"},"bibliographicVolumeNumber":"2024"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":238869,"links":{}}