IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v25y2008i04ns021759590800181x.html
   My bibliography  Save this article

Automated Lecture Timetabling Using A Memetic Algorithm

Author

Listed:
  • BEREKET T. TESFALDET

    (Department of Mathematics, University of Asmara, P. O. Box — 1220, Asmara, Eritrea)

Abstract

The lecture timetabling problem is known to be a highly constrained combinatorial optimization problem. There have been many attempts to address this problem using integer programming, graph coloring and several heuristic search methods. However, since each university has its own timetable setting requirements, it is difficult to develop a general solution method. Thus, the work is generally done manually. This paper attempts to solve the lecture timetabling problem of the University of Asmara using a customized memetic algorithm that we have called ALTUMA. It is a hybrid of genetic algorithms with hill-climbing operators. The performance of ALTUMA was evaluated using data obtained from the University. Empirical results show that ALTUMA is capable of producing good results in a reasonable amount of time. Besides, the results demonstrate that incorporating local search operators with a probabilistic scheme and delta method of fitness evaluation into the memetic algorithm significantly improves the search capabilities of the algorithm.

Suggested Citation

  • Bereket T. Tesfaldet, 2008. "Automated Lecture Timetabling Using A Memetic Algorithm," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(04), pages 451-475.
    • Handle: RePEc:wsi:apjorx:v:25:y:2008:i:04:n:s021759590800181x
    DOI: 10.1142/S021759590800181X
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S021759590800181X
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S021759590800181X?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:25:y:2008:i:04:n:s021759590800181x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.