IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i21p7722-7742.html
   My bibliography  Save this article

Real-time AGV scheduling optimisation method with deep reinforcement learning for energy-efficiency in the container terminal yard

Author

Listed:
  • Lin Gong
  • Zijie Huang
  • Xi Xiang
  • Xin Liu

Abstract

The increasing vessel size and automation level have shifted the productivity bottleneck of automated container terminals from the terminal side to the yard side. Operating an automated container terminal (ACT) yard with a big number of automated guided vehicles (AGV) is challenging due to the complexity and dynamics of the system, severely affecting the operational efficiency and energy use efficiency. In this paper, a hybrid multi-AGV scheduling algorithm is proposed to minimise the energy consumption and the total makespan of AGVs in an ACT yard. This framework first models the AGV scheduling process as a Markov decision process (MDP). Furthermore, a novel scheduling algorithm called MDAS is proposed based on multi-agent deep deterministic policy gradient (MADDPG) to facilitate online real-time scheduling decision-making. Finally, simulation experiments show that the proposed method can effectively enhance the operational efficiency and energy use performance of AGVs in ACT yards of various scales by comparing with benchmarking methods.

Suggested Citation

  • Lin Gong & Zijie Huang & Xi Xiang & Xin Liu, 2024. "Real-time AGV scheduling optimisation method with deep reinforcement learning for energy-efficiency in the container terminal yard," International Journal of Production Research, Taylor & Francis Journals, vol. 62(21), pages 7722-7742, November.
  • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:21:p:7722-7742
    DOI: 10.1080/00207543.2024.2325583
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2325583
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2325583?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:tprsxx:v:62:y:2024:i:21:p:7722-7742. 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/TPRS20 .

    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.