IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i8p803-816.html
   My bibliography  Save this article

Congestion-aware dynamic routing for an overhead hoist transporter system using a graph convolutional gated recurrent unit

Author

Listed:
  • Kyuree Ahn
  • Kanghoon Lee
  • Juneyoung Yeon
  • Jinkyoo Park

Abstract

Overhead hoist transportors (OHT) that transport semiconductor wafers between tools/stockers, is a crucial component of an Automated Material Handling System (AMHS). As semiconductor fabrication plants (FABs) become larger, more OHT vehicles need to be operated. This necessitates the development of a scalable algorithm to effectively operate these OHTs and increase the productivity of the AMHS. This study proposes an algorithm that can predict the entire traveling times of the edges in an OHT rail network by utilizing past traffic information. The model first represents the OHT rail network and the dynamic traffic conditions using a graph. A sequence of graphs that represent the past traffic is then used as an input to produce a sequence of graphs that predicts the future traffic conditions as an output. Using the AutoMod simulator, we have shown that the proposed model scalably and effectively predicts the future edge-traveling time. We have also demonstrated that the predicted values can be used to reroute the OHTs optimally to avoid congestion.

Suggested Citation

  • Kyuree Ahn & Kanghoon Lee & Juneyoung Yeon & Jinkyoo Park, 2022. "Congestion-aware dynamic routing for an overhead hoist transporter system using a graph convolutional gated recurrent unit," IISE Transactions, Taylor & Francis Journals, vol. 54(8), pages 803-816, August.
    • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:8:p:803-816
    DOI: 10.1080/24725854.2021.2000680
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2021.2000680
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2021.2000680?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.

    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:taf:uiiexx:v:54:y:2022:i:8:p:803-816. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.