Sports Scheduling

Michael A. Trick ()
Additional contact information
Michael A. Trick: Carnegie Mellon University

A chapter in Hybrid Optimization, 2011, pp 489-508 from Springer

Abstract: Abstract Sports scheduling has been an extremely active area of research over the past twenty 20years. One important reason for this is that the computational methods for creating playable sports schedules have improved enough to be useful to real sports leagues. A key aspect to these computational improvements has been the development of hybrid methods that combine two or more of integer programming, constraint programming, metaheuristics, or other core optimization approaches. While there is a broad range of models and applications in sports scheduling, there have been two main classes of problems studied: break minimization problems and travel minimization problems. I illustrate how hybrid methods can be used for these two problems, as well as provide some comments on other, lesser studied problems. I also give some directions for further research in this area.

Keywords: Integer Programming; Constraint Programming; Master Problem; Major League Baseball; Large Neighborhood Search (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-1644-0_15

Ordering information: This item can be ordered from
http://www.springer.com/9781441916440

DOI: 10.1007/978-1-4419-1644-0_15

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().