{"id":163920,"updated":"2025-01-20T11:04:26.095843+00:00","links":{},"created":"2025-01-19T00:35:48.535285+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00163920","sets":["6504:8291:8749"]},"path":["8749"],"owner":"6748","recid":"163920","title":["カッコウ探索と2opt法のハイブリッド化による巡回セールスマン問題の解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-03-17"},"_buckets":{"deposit":"803cf207-384e-44ab-b6c5-75feb4423a0f"},"_deposit":{"id":"163920","pid":{"type":"depid","value":"163920","revision_id":0},"owners":[6748],"status":"published","created_by":6748},"item_title":"カッコウ探索と2opt法のハイブリッド化による巡回セールスマン問題の解法","author_link":["322181","322179","322180","322182"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"カッコウ探索と2opt法のハイブリッド化による巡回セールスマン問題の解法"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ソフトウェア科学・工学","subitem_subject_scheme":"Other"}]},"item_type_id":"22","publish_date":"2015-03-17","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":"工学院大"},{"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/163920/files/IPSJ-Z77-4K-01.pdf","label":"IPSJ-Z77-4K-01.pdf"},"date":[{"dateType":"Available","dateValue":"2016-06-10"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-Z77-4K-01.pdf","filesize":[{"value":"495.7 kB"}],"mimetype":"application/pdf","priceinfo":[{"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":"dc21c134-6086-4517-85bc-e751757f4de5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 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":[{}]},{"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":"巡回セールスマン問題には様々な解法が存在し，その一つに進化的計算であるカッコウ探索（CS：Cuckoo Search）がある．CSは，カッコウの繁殖行動である托卵にレヴィフライトを組み合わせたアルゴリズムである．レヴィフライトは，ほとんどが規則性のない短距離の移動だが，時折長距離の移動をするランダムウォークである．本研究では，初期生成段階での精度を上げることで，従来のCSよりも精度の高い解を得られると考え，局所探索法である2opt法を組み合わせたCS-2optを提案する． この手法でTSPLIBのeil51とa280を解いた結果，従来のCSに比べ，より精度の高い解を得た．","subitem_description_type":"Other"}]},"item_22_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"256","bibliographic_titles":[{"bibliographic_title":"第77回全国大会講演論文集"}],"bibliographicPageStart":"255","bibliographicIssueDates":{"bibliographicIssueDate":"2015-03-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicVolumeNumber":"2015"}]},"relation_version_is_last":true,"weko_creator_id":"6748"}}