| 제목 | 탠덤 크레인 스케줄링 문제를 위한 분기절단법 알고리즘 연구 |
|---|---|
| Title | A strengthened ILP model and branch-and-cut algorithm for tandem quay operation problem |
| 저자 |
김동윤 (인천대학교 동북아물류대학원) 민윤홍 (인천대학교 동북아물류대학원) |
| Author |
Dongyun Kim (Graduate School of Logistics, Incheon National University) Yunhong Min (Graduate School of Logistics, Incheon National University) |
| Bibliography | Journal of Logistics Science & Technology, 6(1),1~16, 2025, |
| DOI | 10.23178/jlst.6.1.202503.001 |
| Key Words | Tandem crane, Branch-and-cut, Integer programming, Terminal operation |
| Abstract | Container terminals today are facing the challenge of accommodating larger vessels and enhancing productivity in response to the escalating global trade volumes. As part of these endeavors, a novel quay crane has been introduced, capable of equipping multiple spreaders to efficiently manage multiple container handling tasks concurrently. This study delves into the scheduling problem aimed at minimizing the makespan of discharging operations for a ship bay assigned to a quay crane equipped with two spreaders. In this problem, the quay crane can execute either a single lift using a single spreader or a tandem lift using two spreaders, contingent upon weight constraints. Moreover, the associated changeover time for each spreader mode is considered. Building upon this basis, this study introduces a novel integer linear programming (ILP) formulation for addressing this problem. Additionally, enhancement strategies and a branch-and-cut framework are applied to this formulation. This approach was evaluated in 30 instances, comprising 24 and 50 containers, respectively. The experimental results demonstrated that the novel formulation performed well on 50 container instances when compared to previous ILP formulations. Moreover, it solved instances that were previously deemed intractable within the time limit. |
| PDF download | JM_6[1]-P1~16.pdf |