메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

논문 기본 정보

저자정보
(부경대학교) (삼성중공업) (동의대학교) (부경대학교) (부경대학교)
저널정보
(사)한국CDE학회 한국CDE학회 논문집 한국CDE학회 논문집 제29권 제4호
오류 신고하기

피인용 2

검색

    초록·키워드

    This paper presents a study on the development of an optimal container stowage plan using rein- forcement learning to minimize the number of re-handles. Typically, container stowage plans are manually created by planners who consider factors such as destination, size, type, and weight of the cargo, making the process time-consuming and error-prone. To address this issue, we employed the DQN (Deep Q-N etwork) algorithm, a type of reinforcement learning, to establish an optimal container stowage plan. We proposed a method for defining state using the character- istics of the containers and compared it with traditional methods, using constraints such as desti- nation port and weight. The state definition method proposed in this study has the advantage of not exponentially increasing the number of states with the size of the stowage space by using characteristic values related to the loading status of each row. Initially, the performance of the DQN algorithm was verified using destination port as the only constraint. Subsequently, weight constraints were added to the state definition method that showed better performance. The study results show that the proposed method successfully established a stowage plan that satisfies all constraints in a 4×4 stowage space without causing re-handles, across nine test container lists.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-151-25-02-091217747