Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    Scheduling The Italian Football League

    Uploaded by

    David Moh
    This document describes an approach to scheduling the Italian football league using integer linear programming. It involves 3 phases: 1) generating feasible scheduling patterns, 2) assigning patterns to time periods while satisfying constraints, and 3) matching patterns to teams. The approach was tested on real league data from 2001-2004 and produced schedules with a minimum number of breaks between 48 matches.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Scheduling The Italian Football League

    Uploaded by

    David Moh
    35 views24 pages
    This document describes an approach to scheduling the Italian football league using integer linear programming. It involves 3 phases: 1) generating feasible scheduling patterns, 2) assigning patterns to time periods while satisfying constraints, and 3) matching patterns to teams. The approach was tested on real league data from 2001-2004 and produced schedules with a minimum number of breaks between 48 matches.

    Original Description:

    Scheduling the Italian Football League

    Original Title

    Scheduling the Italian Football League

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document describes an approach to scheduling the Italian football league using integer linear programming. It involves 3 phases: 1) generating feasible scheduling patterns, 2) assigning patterns to time periods while satisfying constraints, and 3) matching patterns to teams. The approach was tested on real league data from 2001-2004 and produced schedules with a minimum number of breaks between 48 matches.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    35 views24 pages

    Scheduling The Italian Football League

    Uploaded by

    David Moh
    This document describes an approach to scheduling the Italian football league using integer linear programming. It involves 3 phases: 1) generating feasible scheduling patterns, 2) assigning patterns to time periods while satisfying constraints, and 3) matching patterns to teams. The approach was tested on real league data from 2001-2004 and produced schedules with a minimum number of breaks between 48 matches.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 24

    Scheduling the Italian

    Football League
    F. Della Croce, D. Oliveri
    David Moh

    Overview

    Introduction

    Problem Description

    Requirements

    Approach

    Solution

    Phase 1

    Phase 2

    Phase 3

    Example

    Result

    Real Data

    Conclusion

    Overview

    Introduction

    Problem Description

    Requirements

    Approach

    Solution

    Result

    Introduction
    Problem Description

    Scheduling the Italian Major Football League tournament calendar ( Serie A )

    Set N of n teams

    All in different towns

    Scheduling a double round robin tournament

    Team plays twice one home and one away

    Travel distance is not an issue

    A team much have a break between two consecutive home or away matches

    Matches can be played simultaneously

    2 TV company airing the home matches live

    Create a schedule with minimal breaks while keeping a balanced TV coverage

    Introduction
    Requirements

    Each city is represented by max of two football team

    Each city has one stadium, so for city with two football team need to have
    complementary home/away schedules

    Each team plays 2 times with another team, one home and one away

    Best teams in the previous year (seeded teams) cannot occur in the first and
    last weeks of the calendar

    City with two football team that are playing against each other cannot occur
    in the first and last weeks of the calendar

    Home matches of teams are divided equally over the 2 TV

    Introduction
    Approach

    ILP based approach

    Pattern

    String of symbols: A= away and H=home

    Problem solved in 3 phases

    Create feasible pattern sets

    Create feasible timetable from the pattern sets

    Create final calendar from the timetable

    Overview

    Introduction

    Solution

    Phase 1

    Phase 2

    Phase 3

    Example

    Result

    Solution
    Phase 1

    Only patterns with no more than 4 breaks are allowed

    Only pattern set composed of complementary patterns pairs

    , {0, 1}

    1, if pattern i is assigned to TV k

    0, otherwise

    number of breaks of pattern I

    Total number of teams assigned to TV k (home)

    , {0, 1}

    1, if pattern i plays at home on week j


    0, if pattern i plays at away on week j

    The set of complementary patterns pairs

    Solution
    Phase 1

    Solution
    Phase 1

    Solution
    Phase 1

    Solution
    Phase 1

    P1, P2, P3, P4, P5, P6 chosen

    P2, P3, P5, P6 assigned to TV1

    P1, P4, assigned to TV2

    Solution
    Phase 2

    ,, {0, 1} 1, if pattern i is matched to pattern j in week t


    0, otherwise

    The set of patterns playing home in week t


    where pattern i plays away

    Solution
    Phase 2

    Solution
    Phase 2

    P1, P2, P3, P4, P5, P6 chosen from phase 1

    Solution
    Phase 3

    , {0, 1}

    1, if pattern i is matched to team j


    0, otherwise

    Cost coefficient of pattern i for team j

    Set pattern assigned in phase 1 to TV k

    Set teams assigned to TV k

    Set of complementary patterns pairs

    Set of team pairs belonging to the same city

    Set of pattern i that cannot be matched to a seeded team

    Set of pattern i that cannot be matched to a team

    Set of seeded teams

    Solution
    Phase 3

    Solution
    Example

    We have 6 teams: A, B, C, D, E, F

    A, B, C, D belongs to TV 1 and E, F to TV 2

    Seeded teams A, E

    Same city teams A, B

    =1

    P2, P3, P5, P6 assigned to B, A, C, D respectively

    P1, P4 assigned to F, E respectively

    Solution
    Example

    P2, P3, P5, P6 assigned to B, A, C, D respectively

    P1, P4 assigned to F, E respectively

    Solution
    Example

    A, B, C, D belongs to TV 1 and E, F to TV 2

    Seeded teams A, E

    Same city teams A, B

    =1

    Overview

    Introduction

    Solution

    Result

    Real Data

    Conclusion

    Result
    Real data

    Real data from year 2001-2002, 2002-2003, 2003-2004

    18 teams

    All data had 4 seeded teams

    Same town team

    2001-2002 & 2002-2003

    3 pair of teams

    2003-2004

    2 pair of teams

    Minimum number of breaks: 48

    Result
    Real data

    For each year 5 calendars were made

    Result
    Conclusion

    ILP approach works for double round robin calendar

    Requirements

    Improvement of the calendar

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy