IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v3y2012i2p1-21.html
   My bibliography  Save this article

Artificial Bee Colony Algorithm for Solving Educational Timetabling Problems

Author

Listed:
  • Asaju La’aro Bolaji

    (Universiti Sains Malaysia, Malaysia, & University of Ilorin, Nigeria)

  • Ahamad Tajudin Khader

    (Universiti Sains Malaysia, Malaysia)

  • Mohammed Azmi Al-Betar

    (Universiti Sains Malaysia, Malaysia, & Jadara University, Jordan)

  • Mohammed A. Awadallah

    (Universiti Sains Malaysia, Malaysia)

Abstract

This paper presents an artificial bee colony algorithm (ABC) for Education Timetabling Problem (ETP). It is aimed at developing a good-quality solution for the problem. The initial population of solutions was generated using Saturation Degree (SD) and Backtracking Algorithm (BA) to ensure the feasibility of the solutions. At the improvement stage in the solution method, ABC uses neighbourhood structures iteratively within the employed and onlooker bee operators, in order to rigorously navigate the UTP search space. The technique was evaluated using curriculum-based course timetabling (CB-CTT) and Uncapacitated Examination Timetabling Problem (UETP) problem instances. The experimental results on UETP showed that the technique is comparable with other state-of-the-art techniques and provides encouraging results on CB-CTT.

Suggested Citation

  • Asaju La’aro Bolaji & Ahamad Tajudin Khader & Mohammed Azmi Al-Betar & Mohammed A. Awadallah, 2012. "Artificial Bee Colony Algorithm for Solving Educational Timetabling Problems," International Journal of Natural Computing Research (IJNCR), IGI Global, vol. 3(2), pages 1-21, April.
  • Handle: RePEc:igg:jncr00:v:3:y:2012:i:2:p:1-21
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2012040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jncr00:v:3:y:2012:i:2:p:1-21. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.