A local search for the timetabling problem.

Rossi-Doria, Olivia, Blum, Christian, Knowles, Joshua, Sampels, Michael, Socha, Krzysztof and Paechter, Ben (2002) A local search for the timetabling problem. In: PATAT 2002 Proceedings of the 4th international conference on the Practice And Theory of Automated Timetabling. Department of Industrial Engineering, Gent, Belgium, pp. 124-127. ISBN 90-806096-1-7

[img] PDF
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial.

Download (107kB) | Request a copy


    This work is part of the Metaheuristic Network, a European
    Commission project that seeks to empirically compare the performance of
    various metaheuristics on di�erent combinatorial optimization problems.
    In this paper we de�ne a representation, a neighbourhood structure and a
    local search for a university course timetabling problem. Our motivation
    is to provide a common search landscape for the metaheuristics that we
    aim to compare, allowing us to make a fair and meaningful analysis of
    the relative performance of these methods on a timetabling problem

    Item Type: Book Section
    ISBN: 90-806096-1-7
    Uncontrolled Keywords: metaheuristics; combinatorial optimization problems; timetabling;
    University Divisions/Research Centres: Faculty of Engineering, Computing and Creative Industries > School of Computing
    Dewey Decimal Subjects: 000 Computer science, information & general works > 000 Computer science, knowledge & systems > 005 Computer programming, programs & data
    Library of Congress Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Item ID: 3350
    Depositing User: Computing Research
    Date Deposited: 11 May 2010 12:35
    Last Modified: 04 Feb 2014 14:14

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...

    Edinburgh Napier University is a registered Scottish charity. Registration number SC018373