IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p137-15010.1007-s10479-010-0719-9.html
   My bibliography  Save this article

An ILS heuristic for the traveling tournament problem with predefined venues

Author

Listed:
  • Fabrício Costa
  • Sebastián Urrutia
  • Celso Ribeiro

Abstract

The Traveling Tournament Problem with Predefined Venues (TTPPV) is a single round robin variant of the Traveling Tournament Problem, in which the venue of each game to be played is known beforehand. We propose an Iterated Local Search (ILS) heuristic for solving real-size instances of the TTPPV, based on two types of moves. Initial solutions are derived from an edge coloring algorithm applied to complete graphs. We showed that canonical edge colorings should not be used as initial solutions in some situations. Instead, the use of Vizing’s edge coloring method lead to considerably better results. We also establish that the solution space defined by some commonly used neighborhoods in the sport scheduling literature is not connected in the case of single round robin tournaments, which explains the hardness of finding high quality solutions to some problem instances. Computational results show that the new ILS heuristic performs much better than heuristics based on integer programming and that it improves the best known solutions for benchmark instances. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:137-150:10.1007/s10479-010-0719-9
    DOI: 10.1007/s10479-010-0719-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0719-9
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0719-9?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. Knust, Sigrid, 2010. "Scheduling non-professional table-tennis leagues," European Journal of Operational Research, Elsevier, vol. 200(2), pages 358-367, January.
    2. 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.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Roberto Maria Rosati & Matteo Petris & Luca Di Gaspero & Andrea Schaerf, 2022. "Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021," Journal of Scheduling, Springer, vol. 25(3), pages 301-319, June.
    2. George H. G. Fonseca & Túlio A. M. Toffolo, 2022. "A fix-and-optimize heuristic for the ITC2021 sports timetabling problem," Journal of Scheduling, Springer, vol. 25(3), pages 273-286, June.
    3. Tasbih Tuffaha & Burak Çavdaroğlu & Tankut Atan, 2023. "Round-robin scheduling with regard to rest differences," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 269-301, July.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Goller, Daniel & Krumer, Alex, 2020. "Let's meet as usual: Do games played on non-frequent days differ? Evidence from top European soccer leagues," European Journal of Operational Research, Elsevier, vol. 286(2), pages 740-754.
    6. 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.
    7. Xiajie Yi & Dries Goossens, 2023. "Strategies for dealing with uncertainty in time-relaxed sports timetabling," Annals of Operations Research, Springer, vol. 320(1), pages 473-492, January.
    8. Dong, Zhi-Long & Ribeiro, Celso C. & Xu, Fengmin & Zamora, Ailec & Ma, Yujie & Jing, Kui, 2023. "Dynamic scheduling of e-sports tournaments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    9. Tasbih Tuffaha & Burak Çavdaroğlu & Tankut Atan, 2023. "Round-robin scheduling with regard to rest differences," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 269-301, July.
    10. Briskorn, Dirk & Horbach, Andrei, 2009. "A Lagrangian approach for minimum cost tournaments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 647, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Jaeseob Han & Seung-Hyun Jeon & Gyeong-Ho Lee & Sangdon Park & Jun-Kyun Choi, 2023. "Power and Frequency Band Allocation Mechanisms for WPT System with Logarithmic-Based Nonlinear Energy Harvesting Model," Sustainability, MDPI, vol. 15(13), pages 1-27, July.
    12. Michael A. Trick & Hakan Yildiz & Tallys Yunes, 2012. "Scheduling Major League Baseball Umpires and the Traveling Umpire Problem," Interfaces, INFORMS, vol. 42(3), pages 232-244, June.
    13. Jari Kyngäs & Kimmo Nurmi & Nico Kyngäs & George Lilley & Thea Salter & Dries Goossens, 2017. "Scheduling the Australian Football League," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(8), pages 973-982, August.
    14. Dries Goossens & Jeroen Beliën, 2023. "Teaching Integer Programming by Scheduling the Belgian Soccer League," INFORMS Transactions on Education, INFORMS, vol. 23(3), pages 164-172, May.
    15. 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.
    16. 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.
    17. van Doornmalen, Jasper & Hojny, Christopher & Lambers, Roel & Spieksma, Frits C.R., 2023. "Integer programming models for round robin tournaments," European Journal of Operational Research, Elsevier, vol. 310(1), pages 24-33.
    18. 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.
    19. Roel Lambers & Dries Goossens & Frits C. R. Spieksma, 2023. "The flexibility of home away pattern sets," Journal of Scheduling, Springer, vol. 26(5), pages 413-423, October.
    20. 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.

    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:194:y:2012:i:1:p:137-150:10.1007/s10479-010-0719-9. 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.