IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v6y2014i2p236-257.html
   My bibliography  Save this article

A new approach for university timetabling problems

Author

Listed:
  • Rakesh P. Badoni
  • D.K. Gupta
  • Anil K. Lenka

Abstract

A general university timetabling problem formulated as a constraint satisfaction problem is solved by a new backtrack-free algorithm. This algorithm incrementally constructs a solution as is done by the usual backtracking algorithm. Whenever a dead-end is encountered, rather than backtracking to the previously assigned variable, it resolves its cause by using a local search min-conflicts-hill-climbing algorithm and then continues further progressively. The proposed algorithm is tested on a small dataset and its representative timetable is presented. It is also tested on a number of randomly generated university timetabling problems. The performance of the algorithm measured in terms of the number of iterations and the amount of CPU time in seconds required is compared with the backtracking algorithm and the min-conflicts-hill-climbing algorithm. It is observed that our algorithm takes less CPU time and less number of iterations.

Suggested Citation

  • Rakesh P. Badoni & D.K. Gupta & Anil K. Lenka, 2014. "A new approach for university timetabling problems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 6(2), pages 236-257.
    • Handle: RePEc:ids:ijmore:v:6:y:2014:i:2:p:236-257
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=59537
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:ijmore:v:6:y:2014:i:2:p:236-257. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.