IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v50y2025i2p910-934.html
   My bibliography  Save this article

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2

Author

Listed:
  • Jingyang Zhao

    (School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China)

  • Mingyu Xiao

    (School of Computer Science and Engineering, School of Computer Science, University of Electronic Science and Technology of China, Chengdu 611731, China)

Abstract

The traveling tournament problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other’s home venue, minimizing the total distance traveled by all n teams ( n is even). In this paper, we consider TTP-2 (i.e., TTP under the constraint that at most two consecutive home games or away games are allowed for each team). In this paper, we propose practical algorithms for TTP-2 with improved approximation ratios. Because of the different structural properties of the problem, all known algorithms for TTP-2 are different for n /2 being odd and even, and our algorithms are also different for these two cases. For even n /2, our approximation ratio is 1 + 3 / n , improving the previous result of 1 + 4 / n . For odd n /2, our approximation ratio is 1 + 5 / n , improving the previous result of 3 / 2 + 6 / n . In practice, our algorithms are easy to implement. Experiments on well-known benchmark sets show that our algorithms beat previously known solutions for all instances with an average improvement of 5.66%.

Suggested Citation

  • Jingyang Zhao & Mingyu Xiao, 2025. "Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2," Mathematics of Operations Research, INFORMS, vol. 50(2), pages 910-934, May.
    • Handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:910-934
    DOI: 10.1287/moor.2022.0356
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2022.0356
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2022.0356?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:50:y:2025:i:2:p:910-934. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.