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

A Decision Support System For Exposition Timetabling Using Ant Colony Optimization

Author

Listed:
  • HSIN-YUN LEE

    (Department of Civil Engineering, National Ilan University, No. 1, Section 1, Shennong Road, I-Lan City 26047, Taiwan)

Abstract

The exposition industry has developed rapidly in recent years. For exposition centers, exposition timetabling is a complicated problem. The timetables arranged by the administrators usually result in an imbalanced usage percentage between showgrounds and a low total usage percentage for all showgrounds. In this paper, we developed a decision support system that considers the characteristics of exposition timetabling. The proposed system applies ant colony optimization for determining the near-optimal timetable of expositions. The ants are grouped into teams representing multi-layer ant paths for priority ranking. This improvement allows us to classify candidate expositions with different time preferences. The showground timetabling of an exposition center is used to validate the proposed system. The timetable proposed by the decision support system ensures a higher efficiency and a higher total usage percentage of the showgrounds than the timetable proposed by a human expert.

Suggested Citation

  • Hsin-Yun Lee, 2012. "A Decision Support System For Exposition Timetabling Using Ant Colony Optimization," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 11(03), pages 609-626.
    • Handle: RePEc:wsi:ijitdm:v:11:y:2012:i:03:n:s0219622012500137
    DOI: 10.1142/S0219622012500137
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219622012500137
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219622012500137?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Surafel Luleseged Tilahun & Hong Choon Ong, 2015. "Prey-Predator Algorithm: A New Metaheuristic Algorithm for Optimization Problems," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 14(06), pages 1331-1352, November.

    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:ijitdm:v:11:y:2012:i:03:n:s0219622012500137. 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/ijitdm/ijitdm.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.