Q-learning for outbound container stacking at container terminals
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lim, Aaron | - |
dc.contributor.author | Lee, Seokchan | - |
dc.contributor.author | Hong, Jeongyoon | - |
dc.contributor.author | Noh, Younghoo | - |
dc.contributor.author | Cho, Sung Won | - |
dc.contributor.author | Lee, Wonhee | - |
dc.date.accessioned | 2025-01-08T07:30:20Z | - |
dc.date.available | 2025-01-08T07:30:20Z | - |
dc.date.issued | 2024-08-26 | - |
dc.identifier.uri | https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/10817 | - |
dc.description.abstract | The efficient stacking of outbound containers presents a significant challenge within container terminal operations. It's crucial to minimize the antic-ipated need for rehandling, as this directly impacts yard productivity and overall terminal efficiency. To address this challenge, we introduce a novel approach based on reinforcement learning. Our method employs Q-learning, incorporating Monte Carlo techniques to identify optimal storage locations by maximizing re-ward values. Furthermore, we've developed effective strategies for determining storage placements through extensive training iterations. Through numerical ex-perimentation using real-world container terminal data, we've compared our model with existing algorithms. Numerical results highlight the robustness of our approach in navigating uncertain operational environments, its ability to support real-time decision-making, and its effectiveness in minimizing rehandling re-quirements. | - |
dc.title | Q-learning for outbound container stacking at container terminals | - |
dc.type | Conference | - |
dc.citation.conferenceName | Logistics and Maritime Systems (LOGMS) | - |
dc.citation.conferencePlace | 독일 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(34103) 대전광역시 유성구 유성대로1312번길 32042-866-3114
COPYRIGHT 2021 BY KOREA RESEARCH INSTITUTE OF SHIPS & OCEAN ENGINEERING. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.