IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v239y2016i1d10.1007_s10479-014-1586-6.html
   My bibliography  Save this article

A combined local search and integer programming approach to the traveling tournament problem

Author

Listed:
  • Marc Goerigk

    (Technische Universität Kaiserslautern)

  • Stephan Westphal

    (Universität Göttingen)

Abstract

The traveling tournament problem is a well-known combinatorial optimization problem with direct applications to sport leagues scheduling, that sparked intensive algorithmic research over the last decade. With the Challenge Traveling Tournament Instances as an established benchmark, the most successful approaches to the problem use meta-heuristics like tabu search or simulated annealing, partially heavily parallelized. Integer programming based methods on the other hand are hardly able to tackle larger benchmark instances. In this work we present a hybrid approach that draws on the power of commercial integer programming solvers as well as the speed of local search heuristics. Our proposed method feeds the solution of one algorithm phase to the other one, until no further improvements can be made. The applicability of this method is demonstrated experimentally on the galaxy instance set, resulting in currently best known solutions for most of the considered instances.

Suggested Citation

  • Marc Goerigk & Stephan Westphal, 2016. "A combined local search and integer programming approach to the traveling tournament problem," Annals of Operations Research, Springer, vol. 239(1), pages 343-354, April.
    • Handle: RePEc:spr:annopr:v:239:y:2016:i:1:d:10.1007_s10479-014-1586-6
    DOI: 10.1007/s10479-014-1586-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-014-1586-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-014-1586-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ribeiro, Celso C. & Urrutia, Sebastian, 2007. "Heuristics for the mirrored traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 775-787, June.
    2. Irnich, Stefan, 2010. "A new branch-and-price algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 218-228, July.
    3. Lim, A. & Rodrigues, B. & Zhang, X., 2006. "A simulated annealing and hill-climbing algorithm for the traveling tournament problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1459-1478, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hoshino, Richard & Kawarabayashi, Ken-ichi, 2011. "A multi-round generalization of the traveling tournament problem and its application to Japanese baseball," European Journal of Operational Research, Elsevier, vol. 215(2), pages 481-497, December.
    2. Bender Marco & Westphal Stephan, 2016. "A combined approximation for the traveling tournament problem and the traveling umpire problem," Journal of Quantitative Analysis in Sports, De Gruyter, vol. 12(3), pages 139-149, September.
    3. Alireza Tajbakhsh & Kourosh Eshghi & Azam Shamsi, 2012. "A hybrid PSO-SA algorithm for the travelling tournament problem," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 6(1), pages 2-25.
    4. M B Wright, 2009. "50 years of OR in sport," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 161-168, May.
    5. Brigitte Werners & Thomas Wülfing, 2007. "Optimierung von Spielplänen am Beispiel der Fußball-Bundesliga-Saison 2006/07," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 18(2), pages 207-221, August.
    6. Flavia Bonomo & Andrés Cardemil & Guillermo Durán & Javier Marenco & Daniela Sabán, 2012. "An Application of the Traveling Tournament Problem: The Argentine Volleyball League," Interfaces, INFORMS, vol. 42(3), pages 245-259, June.
    7. Stephan Westphal & Karl Noparlik, 2014. "A 5.875-approximation for the Traveling Tournament Problem," Annals of Operations Research, Springer, vol. 218(1), pages 347-360, July.
    8. Rasmussen, Rasmus V. & Trick, Michael A., 2008. "Round robin scheduling - a survey," European Journal of Operational Research, Elsevier, vol. 188(3), pages 617-636, August.
    9. Guillermo Durán, 2021. "Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 125-155, April.
    10. David Van Bulck & Dries Goossens & Jo¨rn Scho¨nberger & Mario Guajardo, 2020. "An Instance Data Repository for the Round-robin Sports Timetabling Problem," Management and Labour Studies, XLRI Jamshedpur, School of Business Management & Human Resources, vol. 45(2), pages 184-200, May.
    11. Young Dae Ko & Seung Hwan Jung & Sung Hee Kim & Sung Wook Lee, 2018. "Sustainable Sport Scheduling Approach Considering Team Equity for the Korean Professional Baseball League," Sustainability, MDPI, vol. 10(2), pages 1-11, February.
    12. Kadri Sylejmani & Edon Gashi & Adrian Ymeri, 2023. "Simulated annealing with penalization for university course timetabling," Journal of Scheduling, Springer, vol. 26(5), pages 497-517, October.
    13. Di Mattia, Alessandro & Krumer, Alex, 2023. "Fewer teams, more games, larger attendance? Evidence from the structural change in basketball's EuroLeague," European Journal of Operational Research, Elsevier, vol. 309(1), pages 359-370.
    14. Yun-Chia Liang & Yen-Yu Lin & Angela Hsiang-Ling Chen & Wei-Sheng Chen, 2021. "Variable Neighborhood Search for Major League Baseball Scheduling Problem," Sustainability, MDPI, vol. 13(7), pages 1-18, April.
    15. Richard Hoshino & Ken-ichi Kawarabayashi, 2013. "An Approximation Algorithm for the Bipartite Traveling Tournament Problem," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 720-728, November.
    16. Abilio Lucena & Celso Ribeiro & Andréa Santos, 2010. "A hybrid heuristic for the diameter constrained minimum spanning tree problem," Journal of Global Optimization, Springer, vol. 46(3), pages 363-381, March.
    17. Goller, Daniel & Krumer, Alex, 2019. "Let’s meet as usual: Do games on non-frequent days differ? Evidence from top European soccer leagues," Economics Working Paper Series 1907, University of St. Gallen, School of Economics and Political Science.
    18. Rasmus Rasmussen & Michael Trick, 2009. "The timetable constrained distance minimization problem," Annals of Operations Research, Springer, vol. 171(1), pages 45-59, October.
    19. Fabrício Costa & Sebastián Urrutia & Celso Ribeiro, 2012. "An ILS heuristic for the traveling tournament problem with predefined venues," Annals of Operations Research, Springer, vol. 194(1), pages 137-150, April.
    20. Ioannis G. Tsoulos & Alexandros Tzallas & Evangelos Karvounis, 2024. "Using Optimization Techniques in Grammatical Evolution," Future Internet, MDPI, vol. 16(5), pages 1-20, May.

    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:spr:annopr:v:239:y:2016:i:1:d:10.1007_s10479-014-1586-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.