{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:00:53Z","timestamp":1778270453915,"version":"3.51.4"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8]]},"abstract":"<jats:p>The Traveling Tournament Problem is a well-known benchmark problem in tournament timetabling, which asks us to design a schedule of home\/away games of n teams (n is even) under some feasibility requirements such that the total traveling distance of all the n teams is minimized. In this paper, we study TTP-2, the traveling tournament problem where at most two consecutive home games or away games are allowed, and give an effective algorithm for n\/2 being odd. Experiments on the well-known benchmark sets show that we can beat previously known solutions for all instances with n\/2 being odd by an average improvement of 2.66%. Furthermore, we improve the theoretical approximation ratio from 3\/2+O(1\/n) to 1+O(1\/n) for n\/2 being odd, answering a challenging open problem in this area.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/578","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"4206-4212","source":"Crossref","is-referenced-by-count":5,"title":["The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved  Approximation Bound"],"prefix":"10.24963","author":[{"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[{"name":"University of Electronic Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","theme":"Artificial Intelligence","location":"Montreal, Canada","acronym":"IJCAI-2021","number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2021,8,19]]},"end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:04:08Z","timestamp":1628679848000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/578"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2021\/578","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}