{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032634","sets":["1164:2592:2714:2717"]},"path":["2717"],"owner":"1","recid":"32634","title":["近傍探索法の近似度推定法　―巡回セールスマン問題を対象として―"],"pubdate":{"attribute_name":"公開日","attribute_value":"1990-07-16"},"_buckets":{"deposit":"3638ccad-ecd5-400d-be75-f025f806194b"},"_deposit":{"id":"32634","pid":{"type":"depid","value":"32634","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"近傍探索法の近似度推定法　―巡回セールスマン問題を対象として―","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"近傍探索法の近似度推定法　―巡回セールスマン問題を対象として―"},{"subitem_title":"Estimation of Approximation for Neighborhood Search Method for Travelling Salesman Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1990-07-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪大学工学部"},{"subitem_text_value":"大阪大学工学部"},{"subitem_text_value":"大阪大学工学部"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Faculty of Engineering, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Osaka University","subitem_text_language":"en"},{"subitem_text_value":"Faculty of Engineering, Osaka University","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/32634/files/IPSJ-AL90016003.pdf"},"date":[{"dateType":"Available","dateValue":"1992-07-16"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL90016003.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"65709a88-92c3-41f8-a51d-6c51a3762490","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1990 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"安田, 覚"},{"creatorName":"阪本, 清和"},{"creatorName":"中野, 秀男"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Satoru, Yasuda","creatorNameLang":"en"},{"creatorName":"Kiyokazu, Sakamoto","creatorNameLang":"en"},{"creatorName":"Hideo, Nakano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"離散最適化問題に用いられる近傍探索法の良さの推定を、近似解を探索している途中で得られるデータから確率的に推定する方法について考察する。本報告では対象とする問題とその近傍探索法として、巡回セールスマン問題とλ最適法を取り上げる。50都市程度の問題例での計算結果から、あらかじめ最適値を予測した上での推定法が近似解の出現頻度推定に有効である事を確かめた。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We propose a method to estimate the accuracy of local optimal solution by many data obtained during the calculation of neighborhood search method in the combinatorial optimization problem. In this report, we consider λ-opt method for travelling salesman problem. From the computational experience of the problem instances with about 50 cities, we show that it is efficient for the estimation of the frequency distribution of local optimal values to use a method conjecturing an optimum value.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"21","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"15","bibliographicIssueDates":{"bibliographicIssueDate":"1990-07-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"58(1990-AL-016)","bibliographicVolumeNumber":"1990"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32634,"updated":"2025-01-22T16:05:04.851365+00:00","links":{},"created":"2025-01-18T23:01:40.643936+00:00"}