Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:bura.brunel.ac.uk:2438/5983

A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem

Authors
Publication date
1 January 2011
Publisher
Springer
Doi

    Abstract

    Copyright @ Springer-Verlag Berlin Heidelberg 2011.The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previous good solutions to guide the generation of new solutions, and two local search schemes to enhance its performance for the MOUCTP. The experimental results based on a set of test problems show that the proposed algorithm is efficient for solving the MOUCTP

    Similar works

    Full text

    thumbnail-image

    This paper was published in Brunel University Research Archive.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.