IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v32y2019i4p450-467.html
   My bibliography  Save this article

Hybridising plant propagation and local search for uncapacitated exam scheduling problems

Author

Listed:
  • Meryem Cheraitia
  • Salim Haddadi
  • Abdellah Salhi

Abstract

The uncapacitated exam scheduling problem (UESP) is a well-known computationally intractable combinatorial optimisation problem. It aims at assigning exams to a predefined number of periods, avoiding conflicts over the same period, and spreading exams as evenly as possible. Here, we suggest a new hybrid algorithm combining the plant propagation algorithm (PPA) and local search (LS) for it. PPA is a population-based metaheuristic that mimics the way plants propagate. To the best of our knowledge, this is the first time this idea is exploited in the context of UESP. Extensive testing on the University of Toronto benchmark dataset, and comparison against a large number of new as well as well-established methods shows that this new metaheuristic is competitive and represents a substantial addition to the arsenal of tools for solving the problem.

Suggested Citation

  • Meryem Cheraitia & Salim Haddadi & Abdellah Salhi, 2019. "Hybridising plant propagation and local search for uncapacitated exam scheduling problems," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 32(4), pages 450-467.
  • Handle: RePEc:ids:ijsoma:v:32:y:2019:i:4:p:450-467
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=99477
    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:ijsoma:v:32:y:2019:i:4:p:450-467. 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=150 .

    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.