Catalog Home Page

Memetic algorithm behavior on timetabling infeasibility

Budiono, T.A. and Wong, K.W. (2011) Memetic algorithm behavior on timetabling infeasibility. In: IEEE Region 10 Conference: Trends and Development in Converging Technology Towards 2020, TENCON 2011, 21 - 24 November, Bali, Indonesia pp. 93-97.

[img]
Preview
PDF - Authors' Version
Download (206kB) | Preview
    Link to Published Version: http://dx.doi.org/10.1109/TENCON.2011.6129070
    *Subscription may be required

    Abstract

    Memetic Algorithm is one of the metaheuristic techniques commonly used to solve timetabling problems due to its explorative as well as exploitative properties to produce feasible timetables. To design a memetic algorithm effectively, we need to characterize its behavior on a range of timetabling problems so that its performance can be fine tuned accordingly. In this work, we present our analysis on the memetic algorithm behavior on university course timetabling problems to produce feasible timetables. Results show the specification of Memetic Algorithm operators affect the range of problem size in which the algorithm behaves properly.

    Publication Type: Conference Paper
    Murdoch Affiliation: School of Information Technology
    Publisher: IEEE
    Copyright: © 2011 IEEE.
    URI: http://researchrepository.murdoch.edu.au/id/eprint/7241
    Item Control Page

    Downloads

    Downloads per month over past year