{"created":"2025-08-22T01:17:49.577805+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:02003808","sets":["934:989:1739363130374:1752232625083"]},"path":["1752232625083"],"owner":"80578","recid":"2003808","title":["総当たりリーグ戦スケジューリングにおける重み付き残存影響度最小化問題に対する発見的解法"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2025-08-28"},"_buckets":{"deposit":"0fd49105-f669-4a05-8d78-c65e16c28f35"},"_deposit":{"id":"2003808","pid":{"type":"depid","value":"2003808","revision_id":0},"owners":[80578],"status":"published","created_by":80578},"item_title":"総当たりリーグ戦スケジューリングにおける重み付き残存影響度最小化問題に対する発見的解法","author_link":[],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"総当たりリーグ戦スケジューリングにおける重み付き残存影響度最小化問題に対する発見的解法","subitem_title_language":"ja"},{"subitem_title":"A Metaheuristic Algorithm for the Weighted Carry-Over Effect Value Minimization Problem in Round-Robin Tournaments","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"[オリジナル論文] スポーツスケジューリング・メタヒューリスティクス・残存影響度","subitem_subject_scheme":"Other"}]},"item_type_id":"3","publish_date":"2025-08-28","item_3_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"名古屋大学"},{"subitem_text_value":"静岡大学"},{"subitem_text_value":"名古屋大学"}]},"item_3_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Nagoya University","subitem_text_language":"en"},{"subitem_text_value":"Shizuoka University","subitem_text_language":"en"},{"subitem_text_value":"Nagoya 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/2003808/files/IPSJ-TOM1803003.pdf","label":"IPSJ-TOM1803003.pdf"},"date":[{"dateType":"Available","dateValue":"2027-08-28"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-TOM1803003.pdf","filesize":[{"value":"924.8 KB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"32e4f23f-9dcc-4da8-a67f-3fe966f188a0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2025 by the Information Processing Society of Japan"}]},"item_3_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"曹,贇健"}]},{"creatorNames":[{"creatorName":"呉,偉"}]},{"creatorNames":[{"creatorName":"柳浦,睦憲"}]}]},"item_3_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yunjian Cao","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Wei Wu","creatorNameLang":"en"}]},{"creatorNames":[{"creatorName":"Mutsunori Yagiura","creatorNameLang":"en"}]}]},"item_3_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA11464803","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_3_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-7780","subitem_source_identifier_type":"ISSN"}]},"item_3_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"総当たりリーグ戦は，サッカーや野球などのスポーツリーグで広く使用されており，総当たりリーグ戦の対戦表作成問題は，スポーツスケジューリングにおける代表的な問題の1つである．対戦表を評価する際には，移動距離や休憩など，様々な要素が考慮されている．これらの要素の中で，重み付き残存影響度は，対戦表の公平性を測る指標として用いられる．本論文では，重み付き残存影響度最小化問題に対し，整数計画法と反復局所探索法を組み合わせた発見的解法を提案する．提案手法は，ベースマッチングから総当たり戦の対戦表を生成する，回転法と呼ばれる手法に基づいており，まず，ベースマッチングを用いて解を表現する局所探索から始める．局所最適解が得られた後，ベースマッチングのどの頂点にどのチームを割り当てるかを二次割当問題を解くことによって最適化する．計算実験により，提案したアルゴリズムが3つの問題例の既知の最良解を更新することを確認した．","subitem_description_type":"Other"}]},"item_3_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Round-robin tournaments are widely used in sports leagues such as football and baseball leagues. The round-robin tournament scheduling problem is one of the most well-known problems in sports scheduling. In the round-robin tournament scheduling problem, various factors, such as traveling distance and breaks, are often considered as criteria for evaluation. Among these criteria, the weighted carry-over effect value is used to evaluate the fairness of a schedule. In this paper, we propose a heuristic approach combining integer programming and an iterated local search algorithm for the weighted carry-over effect value minimization problem. The proposed approach is based on the well-known circle method, in which a round-robin tournament schedule can be generated from a so-called base matching. Our approach starts with a local search using a base matching to represent a solution. Whenever a locally optimal solution is obtained, a quadratic assignment problem is solved to obtain an optimal assignment between matched vertices and teams. We confirmed that our proposed algorithm successfully updated the best-known records for three instances.","subitem_description_type":"Other"}]},"item_3_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"31","bibliographic_titles":[{"bibliographic_title":"情報処理学会論文誌数理モデル化と応用（TOM）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"2025-08-28","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicVolumeNumber":"18"}]},"relation_version_is_last":true,"weko_creator_id":"80578"},"id":2003808,"updated":"2025-08-22T01:17:54.817405+00:00","links":{}}