{"links":{},"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227601","sets":["1164:2592:11085:11322"]},"path":["11322"],"owner":"44499","recid":"227601","title":["巡回トーナメント問題に対するタブー効果に関する研究"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-08-30"},"_buckets":{"deposit":"128bb858-ec37-4f41-b60b-f85b04df92d4"},"_deposit":{"id":"227601","pid":{"type":"depid","value":"227601","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"巡回トーナメント問題に対するタブー効果に関する研究","author_link":["606463","606462","606460","606461","606459","606464"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"巡回トーナメント問題に対するタブー効果に関する研究"},{"subitem_title":"A Study on the Tabu Effect for Solving the Traveling Tournament Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2023-08-30","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":"Chukyo University","subitem_text_language":"en"},{"subitem_text_value":"Chukyo University","subitem_text_language":"en"},{"subitem_text_value":"Chukyo 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/227601/files/IPSJ-AL23194003.pdf","label":"IPSJ-AL23194003.pdf"},"date":[{"dateType":"Available","dateValue":"2025-08-30"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL23194003.pdf","filesize":[{"value":"2.3 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":"7e35da5e-7cf2-46a8-b8fe-7a5d6d8375d3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"市川, 槙人"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤田, 実沙"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"ハルトノ, ピトヨ"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Makito, Ichikawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Misa, Fujita","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Pitoyo, Hartono","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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"巡回トーナメント問題は，ある制約のもとで全チームの総移動距離を最小化する試合スケジュールを作成するスポーツスケジューリング問題である．巡回トーナメント問題に対する有効な解法の 1 つに，3 種類の近傍操作を組み合わせて解を探索する確率的局所探索 (SLS) がある．また，SLS にさらに 2 種類の近傍操作を追加した改良確率的局所探索 (ISLS) も提案され，SLS より良い性能を示すことが報告された．そこで本研究では，ISLS にさらにもう 1 種類の近傍操作を追加した手法を提案する．提案手法の探索過程を調査したところ，構造は異なるが目的関数値が同じ解ばかりを探索していることが明らかになった．そこで，提案手法にタブー効果を追加した手法も提案する．数値実験の結果から，提案手法ではベンチマーク問題の特徴によって効果的なタブー属性が異なることが明らかになった．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The traveling tournament problem (TTP) is one of the sports scheduling problems for generating game schedules that minimize the total travel distance over all the teams while subjected to some constraints. Some past works demonstrated that Stochastic Local Search (SLS), which introduced three types of neighborhood searches, is effective for solving TTP. Improved Stochastic Local Search (ISLS), which added two additional neighborhood searches, further improved the optimization performances of SLS. In this study, we proposed to add one additional type of neighborhood search to the ISLS. We also discovered that the proposed method explores diverse schedules but with similar objective values, thus hindering the search process. To overcome this problem, we introduced a tabu effect to the new ISLS. From our simulations, we also learned that the effective tabu attributes depend on the distance distributions of the problems. We elaborate on our proposed method with the simulation results in this paper.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"7","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-08-30","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"2023-AL-194"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:26:51.557510+00:00","updated":"2025-01-19T12:07:37.864886+00:00","id":227601}