Grouping and scheduling multiple sports leagues: an integrated approach.
Saved in:
| Title: | Grouping and scheduling multiple sports leagues: an integrated approach. |
|---|---|
| Authors: | Li, Miao1 (AUTHOR) miao.li@ugent.be, Goossens, Dries1,2 (AUTHOR) |
| Source: | Journal of the Operational Research Society. Apr2025, Vol. 76 Issue 4, p739-757. 19p. |
| Subjects: | Simulated annealing, Athletic leagues, Integer programming, Team sports, NP-hard problems |
| Abstract: | This paper introduces the multi-league grouping and scheduling problem, which integrates the grouping of teams into leagues and the scheduling of each league. This involves two possibly conflicting objectives: minimizing travel distance and minimizing capacity violations of venues shared by teams. We formulate this problem as a bi-objective mixed-integer programming model. Given the NP-hardness of the grouping problem, the integrated problem is particularly challenging. Hence, we design a two-layer constructive heuristic to efficiently approximate the Pareto set, using simulated annealing on the outer layer and an integer programming model on the inner layer. We further develop a speed-up version where the inner layer is solved heuristically. We develop a series of large-scale problem instances, including one based on data from the Royal Belgian Football Association. In a computational study, we compare our algorithms with an epsilon-constraint method and evaluate their results using various multi-objective solution quality metrics. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 183540913 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Grouping and scheduling multiple sports leagues: an integrated approach. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Li%2C+Miao%22">Li, Miao</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> miao.li@ugent.be</i><br /><searchLink fieldCode="AR" term="%22Goossens%2C+Dries%22">Goossens, Dries</searchLink><relatesTo>1,2</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+the+Operational+Research+Society%22">Journal of the Operational Research Society</searchLink>. Apr2025, Vol. 76 Issue 4, p739-757. 19p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Simulated+annealing%22">Simulated annealing</searchLink><br /><searchLink fieldCode="DE" term="%22Athletic+leagues%22">Athletic leagues</searchLink><br /><searchLink fieldCode="DE" term="%22Integer+programming%22">Integer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Team+sports%22">Team sports</searchLink><br /><searchLink fieldCode="DE" term="%22NP-hard+problems%22">NP-hard problems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper introduces the multi-league grouping and scheduling problem, which integrates the grouping of teams into leagues and the scheduling of each league. This involves two possibly conflicting objectives: minimizing travel distance and minimizing capacity violations of venues shared by teams. We formulate this problem as a bi-objective mixed-integer programming model. Given the NP-hardness of the grouping problem, the integrated problem is particularly challenging. Hence, we design a two-layer constructive heuristic to efficiently approximate the Pareto set, using simulated annealing on the outer layer and an integer programming model on the inner layer. We further develop a speed-up version where the inner layer is solved heuristically. We develop a series of large-scale problem instances, including one based on data from the Royal Belgian Football Association. In a computational study, we compare our algorithms with an epsilon-constraint method and evaluate their results using various multi-objective solution quality metrics. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of the Operational Research Society is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=183540913 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1080/01605682.2024.2391516 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 19 StartPage: 739 Subjects: – SubjectFull: Simulated annealing Type: general – SubjectFull: Athletic leagues Type: general – SubjectFull: Integer programming Type: general – SubjectFull: Team sports Type: general – SubjectFull: NP-hard problems Type: general Titles: – TitleFull: Grouping and scheduling multiple sports leagues: an integrated approach. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Li, Miao – PersonEntity: Name: NameFull: Goossens, Dries IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 01605682 Numbering: – Type: volume Value: 76 – Type: issue Value: 4 Titles: – TitleFull: Journal of the Operational Research Society Type: main |
| ResultId | 1 |