Industrial Engineering and Management Systems

  • 제11권1호
  • /
  • Pages.103-113
  • /
  • 2012
  • /
  • 1598-7248(pISSN)
  • /
  • 2234-6473(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

A Simulation Study on a Workload-based Operation Planning Method in Container Terminals

  • Jeong, Yeon-Ho (Department of Logistics Information Technology, Pusan National University) ;
  • Kim, Kap-Hwan (Department of Industrial Engineering, Pusan National University) ;
  • Woo, Youn-Ju (Department of Industrial Engineering, Pusan National University) ;
  • Seo, Bo-Hyeon (Department of Industrial Engineering, Pusan National University)
  • 투고 : 2011.11.30
  • 심사 : 2012.02.13
  • 발행 : 2012.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A yard in a container terminal is a temporary storage space before containers are loaded onto the target vessel or delivered to consignees. For improving the utilization of the space in the yard and the efficiency of loading and discharging operations, it is important that operation plans must be carefully constructed in advance. A heuristic method is suggested to solve operation space planning problems considering workloads on handling equipment as well as space availabilities. The operation plans in this paper includes quay crane (QC) schedules and space plans for multiple vessels considering the workload in the container yard of container terminals. This paper evaluates the effectiveness of a space planning method and the performance of a new QC scheduling method using a simulation model.

키워드

참고문헌

  1. Bazzazi, M., Safaei, N., and Javadian, N. (2009), A genetic algorithm to solve the storage space allocation problem in a container terminal, Computers and Industrial Engineering, 56, 44-52. https://doi.org/10.1016/j.cie.2008.03.012
  2. Bierwirth, C. and Meisel, F. (2009), A fast heuristic for quay crane scheduling with interference constraints, Journal of Scheduling, 12, 345-360. https://doi.org/10.1007/s10951-009-0105-0
  3. Daganzo, C. F. (1989), The crane scheduling problem, Transportation Research Part B: Methodological, 23, 159-175. https://doi.org/10.1016/0191-2615(89)90001-5
  4. Jung, D. H., Park, Y. M., Lee, B. K, Kim, K. H., and Ryu, K. R. (2006), A quay crane scheduling method considering interference of yard cranes in container terminals, Advances in Artificial Intelligence, LNAI, 4293, 461-471.
  5. Kim, K. H. and Kim, H. B. (1999), Segregating space allocation models for container inventories in port container terminals, International Journal of Production Economics, 59, 415-423. https://doi.org/10.1016/S0925-5273(98)00028-0
  6. Kim, K. H. and Park, K. T. (2003), A note on a dynamic space allocation method for outbound containers, European Journal of Operational Research, 148, 92-101. https://doi.org/10.1016/S0377-2217(02)00333-8
  7. Kim, K. H. and Park, Y. M. (2004), A crane scheduling method for port container terminals, European Journal of Operational Research, 156, 752-768. https://doi.org/10.1016/S0377-2217(03)00133-4
  8. Kim, K. H., Park, Y. M., and Ryu, K. R. (2000), Deriving decision rules to locate export containers in storage yards, European Journal of Operational Research, 124, 89-101. https://doi.org/10.1016/S0377-2217(99)00116-2
  9. Lee, L. H., Chew, E. P., Tan, K. C., and Han, Y. (2006), An optimization model for storage yard management in transshipment hubs, OR Spectrum, 28, 539-561. https://doi.org/10.1007/s00291-006-0045-4
  10. Meisel, F. and Wichmann, M. (2010), Container sequencing for quay cranes with internal reshuffles, OR Spectrum, 32, 569-591. https://doi.org/10.1007/s00291-009-0191-6
  11. Nishimura, E., Imai, A., Janssens, G. K., and Papadimitriou, S. (2009), Container storage and transshipment marine terminals, Transportation Research, 45E, 771-786.
  12. Peterkofsky, R. I. and Daganzo, C. F. (1990), A branch and bound solution method for the crane scheduling problem, Transportation Research Part B: Methodological, 24, 159-172. https://doi.org/10.1016/0191-2615(90)90014-P
  13. Taleb-Ibrahimi, M., de Castilho, B., and Daganzo, C. F. (1993), Storage space vs handling work in con-tainer terminals, Transportation Research, 27B, 13-32.
  14. Wang, Y. (2008), A Quay Crane Scheduling Method Considering Congestion in the Yard of Container Terminal, Master's thesis, Pusan National University.
  15. Wang, Y. and Kim, K. H. (2011), A quay crane scheduling algorithm considering the workload, Journal of intelligent manufacturing, 22, 459-470. https://doi.org/10.1007/s10845-009-0303-9
  16. Won, S. H. (2009), Operational Planning in Container Terminals under Resource Restrictions, Ph. D. thesis, Pusan National University.
  17. Won, S. H. and Kim, K. H. (2009), Integrated framework for various operation plans in container terminals, Polish Maritime Research, 36, 51-61.
  18. Won, S. H. and Kim, K. H. (2009), Yard planning considering the load profile of resources in container terminals, Journal of the Korean Institute of Industrial Engineers, 35, 58-72.
  19. Zhang, C., Liu, J., Wan, Y., Murty, K. G., and Linn, R. J. (2003), Storage space allocation in container terminals, Transportation Research, 37B, 883-903.
  20. Zhang, X. (2011), Space Planning Method Considering Workloads in Container Terminals, Master's thesis, Pusan National University.

피인용 문헌

  1. Algorithm for Optimal Intra-bay Container Pre-marshalling Plan vol.38, pp.2, 2012, https://doi.org/10.7232/JKIIE.2012.38.2.157
  2. Simulation-Based Optimization for Storage Allocation Problem of Outbound Containers in Automated Container Terminals vol.2015, pp.1563-5147, 2015, https://doi.org/10.1155/2015/548762
  3. Storage Allocation in Automated Container Terminals: the Upper Level vol.23, pp.1, 2016, https://doi.org/10.1515/pomr-2016-0061
  4. 컨테이너 터미널의 선처리 알고리즘 성능분석과 최적선택 제안 vol.16, pp.12, 2018, https://doi.org/10.15722/jds.16.12.201812.95
  5. Performance Analysis of a Combination of Carry-in and Remarshalling Algorithms vol.11, pp.10, 2012, https://doi.org/10.13106/jidb.2020.vol11.no10.75
  6. Efficient stowage plan with loading and unloading operations for shipping liners using foldable containers and shift cost-sharing vol.48, pp.6, 2012, https://doi.org/10.1080/03088839.2020.1821109