DOI QR코드

DOI QR Code

Dual Cycle Plan for Efficient Ship Loading and Unloading in Container Terminals

컨테이너 터미널의 효율적인 선적 작업을 위한 Dual Cycle 계획

  • Chung, Chang-Yun (Graduate school of National Korea Maritime University) ;
  • Shin, Jae-Young (Dept. of Logistics Engineering, National Korea Maritime University)
  • 정창윤 (한국해양대학교 물류시스템학과 대학원) ;
  • 신재영 (한국해양대학교 물류시스템학과)
  • Published : 2009.10.31

Abstract

At container terminals, a major measurement of productivity can be work-efficiency in quay-side. At the apron, containers are loaded onto the ship and unloaded to apron by Q/C(Quay Crane). For improving the productivity of quay crane, the more efficient Y/T(Yard Tractor) operation method is necessary in container terminals. Between quay-side and yard area, current transferring methods is single-cycling which doesn't start loading unless it finishes unloading. Dual-cycling is a technique that can be used to improve the productivity of quay-side and utility of yard tractor by ship loading and unloading simultaneously. Using the dual-cycling at terminals only necessitates an operational change without purchasing extra equipment. Exactly, Y/T operation method has to be changed the dedicate system to pooling system. This paper presents an efficient ship loading and unloading plan in container terminals, which use the dual-cycling. We propose genetic and tabu search algorithm for this problem.

컨테이너 터미널의 주요 생산성 지표는 안벽에서의 작업 효율성이라 할 수 있다. 안벽에서는 Q/C(Quay Crane)이라는 장비가 접안 선박의 컨테이너를 하역한다. Q/C의 작업 생산성을 높이기 위해서는 좀 더 효율적인 Y/T(Yard Tractor)운영 방식이 필요하다. 기존 작업 방식(싱글 사이클)에서는 양하작업 이후 적하 작업이 이루어진다. 듀얼 사이클이란 양하작업과 적하 작업을 동시에 함으로써 안벽 생산성과 야드 트랙터의 이용률을 높이는 방법이다. 터미널에서 듀얼 사이클의 도입은 추가적인 장비의 도입 없이 운영에서의 변화만을 요구한다. 즉, 기존의 dedicate 시스템에서 pooling 시스템으로의 변화가 필요하다. 본 논문에서는 듀얼 사이클을 이용하는 항만에서의 작업 효율성을 증대시키기 위한 선적 계획 방법을 제시하고자 한다. 이 문제를 풀기위해 유전 알고리즘과 타부서치를 제시하였다.

Keywords

References

  1. 송장호(2007), "컨테이너터미널에서의 Double cycle 하역기법의 최적 운영방안", 한국해양대학교 석사학위논문
  2. 최용석, 하태영(2005), "운영시스템의 도입에 따른 컨테이너터미널의 생산성 향상 평가", 한국항해항만학회지, 제29권, 제1호, pp.97-104 https://doi.org/10.5394/KINPR.2005.29.1.097
  3. 최용석, 김우선, 하태영(2006), "컨테이너터미널 리모델링기술검토 : 부산항 사례, 한국항해항만학회지", 제30권, 제6호, pp. 499-508 https://doi.org/10.5394/KINPR.2006.30.6.499
  4. Daganzo, C. F.(1989), "The crane scheduling problem", Transportation research part B, Vol.23, pp.197-175
  5. Goodchild, A. V., Daganzo, C. F.(2006), "Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations", Transportation. Science. Vol.40, No.4, pp.473-483 https://doi.org/10.1287/trsc.1060.0148
  6. Goodchild, A. V., Daganzo, C. F.(2007), "Crane double cycling in container ports: Planning methods and evaluation", Transportation research part B, Vol.41, pp.875-891 https://doi.org/10.1016/j.trb.2007.02.006
  7. Kim, K. H., Park, Y. M.(2004), "A Crane scheduling method for port container terminals", European Journal of Operational Research, Vol.156, No.3, pp.752-768 https://doi.org/10.1016/S0377-2217(03)00133-4
  8. Lee, D.-H., Wang, H. Q., Miao, L.(2008a), "Quay crane scheduling with non-interference constraints in port container terminals", Transportation Research part E, Vol.44, No.1, pp.124-135 https://doi.org/10.1016/j.tre.2006.08.001
  9. Lee, D.-H., Wang, H. Q., Miao, L.(2008b), "Quay crane scheduling with handling priority in port container terminals", Engineering Optimization, Vol.40, No.2, pp.179-189 https://doi.org/10.1080/03052150701686366
  10. Lim, A., Rodrigues, B., Xiao, F., and Zhu, Y.(2004), "Crane scheduling with spatial constraints", Naval research logistics, Vol.51, No.3, pp.386-406 https://doi.org/10.1002/nav.10123
  11. Liu, J., Wan, Y., Wang, L.(2006), "Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel deartures", Naval research logistics, Vol.53, No.1, pp.60-74 https://doi.org/10.1002/nav.20108
  12. Moccia, L., Cordeau, J., Gaudioso, M., and Laporte, G.(2006), "A Branch-and-Cut Algorithm for the Quay Crane Scheduling Problem in a Container Terminal",Naval research logistics, Vol.53, No.1, pp.45-59 https://doi.org/10.1002/nav.20121
  13. Peterkofsky, R. I., Daganzo, C. F.(1990), "A branch and bound solution method for the crane scheduling problem", Transportation research part B, Vol.24 https://doi.org/10.1016/0191-2615(90)90014-P
  14. Sammarra, M., Cordeau, J., Laporte, G., and Monaco, M. F.(2007), "A tabu search heuristic for the quay crane scheduling problem", Journal of Scheduling, Vol.10, No.4/5, pp.327-336 https://doi.org/10.1007/s10951-007-0029-5
  15. Zhang, H., Kim, K. H.(2009), "Maximizing the number of dual-cycle operations of quay cranes in container terminals", Compusters & Industrial Engineering, Vol. 56, No.3, pp.979-992 https://doi.org/10.1016/j.cie.2008.09.008
  16. Zhu, Y., Lim, A.(2006), "Crane scheduling with non-crossing constraint", Journal of the Operational Research Society, Vol.57, pp.1464-1471 https://doi.org/10.1057/palgrave.jors.2602110

Cited by

  1. Dual Cycle Plan for Efficient Ship Loading and Unloading in Container Terminals vol.33, pp.8, 2009, https://doi.org/10.5394/KINPR.2009.33.8.555