Elective course student sectioning at Danish high schools

Simon Kristiansen, Thomas Riis Stidsen

    Research output: Contribution to journalJournal articleResearchpeer-review

    221 Downloads (Pure)

    Abstract

    The Elective Course Student Sectioning (ECSS) problem is a yearly recurrent planning problem at the Danish high schools. The problem is of assigning students to elective classes given their requests such that as many requests are fulfilled and the violations of the soft constraints are minimized. This paper presents an Adaptive Large Neighborhood Search heuristic for the ESCC. The algorithm is applied to 80 real-life instances from Danish high schools and compared with solutions found by using the state-of-the-art MIP solver Gurobi. The algorithm has been implemented in the commercial product Lectio, and is thereby available for approximately 200 high schools in Denmark.
    Original languageEnglish
    JournalAnnals of Operations Research
    Volume239
    Issue number1
    Pages (from-to)99-117
    Number of pages19
    ISSN0254-5330
    DOIs
    Publication statusPublished - 2016

    Keywords

    • Education timetabling
    • High school timetabling
    • Student sectioning
    • Elective course planning
    • Adaptive large neighborhood search
    • Integer programming

    Cite this

    @article{5e97621015454000922aa90cf841b676,
    title = "Elective course student sectioning at Danish high schools",
    abstract = "The Elective Course Student Sectioning (ECSS) problem is a yearly recurrent planning problem at the Danish high schools. The problem is of assigning students to elective classes given their requests such that as many requests are fulfilled and the violations of the soft constraints are minimized. This paper presents an Adaptive Large Neighborhood Search heuristic for the ESCC. The algorithm is applied to 80 real-life instances from Danish high schools and compared with solutions found by using the state-of-the-art MIP solver Gurobi. The algorithm has been implemented in the commercial product Lectio, and is thereby available for approximately 200 high schools in Denmark.",
    keywords = "Education timetabling, High school timetabling, Student sectioning, Elective course planning, Adaptive large neighborhood search, Integer programming",
    author = "Simon Kristiansen and Stidsen, {Thomas Riis}",
    year = "2016",
    doi = "10.1007/s10479-014-1593-7",
    language = "English",
    volume = "239",
    pages = "99--117",
    journal = "Annals of Operations Research",
    issn = "0254-5330",
    publisher = "Springer New York",
    number = "1",

    }

    Elective course student sectioning at Danish high schools. / Kristiansen, Simon; Stidsen, Thomas Riis.

    In: Annals of Operations Research, Vol. 239, No. 1, 2016, p. 99-117.

    Research output: Contribution to journalJournal articleResearchpeer-review

    TY - JOUR

    T1 - Elective course student sectioning at Danish high schools

    AU - Kristiansen, Simon

    AU - Stidsen, Thomas Riis

    PY - 2016

    Y1 - 2016

    N2 - The Elective Course Student Sectioning (ECSS) problem is a yearly recurrent planning problem at the Danish high schools. The problem is of assigning students to elective classes given their requests such that as many requests are fulfilled and the violations of the soft constraints are minimized. This paper presents an Adaptive Large Neighborhood Search heuristic for the ESCC. The algorithm is applied to 80 real-life instances from Danish high schools and compared with solutions found by using the state-of-the-art MIP solver Gurobi. The algorithm has been implemented in the commercial product Lectio, and is thereby available for approximately 200 high schools in Denmark.

    AB - The Elective Course Student Sectioning (ECSS) problem is a yearly recurrent planning problem at the Danish high schools. The problem is of assigning students to elective classes given their requests such that as many requests are fulfilled and the violations of the soft constraints are minimized. This paper presents an Adaptive Large Neighborhood Search heuristic for the ESCC. The algorithm is applied to 80 real-life instances from Danish high schools and compared with solutions found by using the state-of-the-art MIP solver Gurobi. The algorithm has been implemented in the commercial product Lectio, and is thereby available for approximately 200 high schools in Denmark.

    KW - Education timetabling

    KW - High school timetabling

    KW - Student sectioning

    KW - Elective course planning

    KW - Adaptive large neighborhood search

    KW - Integer programming

    U2 - 10.1007/s10479-014-1593-7

    DO - 10.1007/s10479-014-1593-7

    M3 - Journal article

    VL - 239

    SP - 99

    EP - 117

    JO - Annals of Operations Research

    JF - Annals of Operations Research

    SN - 0254-5330

    IS - 1

    ER -