컨테이너 터미널의 선처리 알고리즘 성능분석과 최적선택 제안
Performance Analysis of Preprocessing Algorithm in Container Terminal and Suggestion for Optimum Selection
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Purpose – In order to gain the upper hand in competition between container terminals, efforts to improve container terminal productivity continue. Export containers arrive randomly in the container terminal and are carried in the container terminal yard according to the arrival order. On the other hand, containers are carried out of the container terminal yard in order based on container weight, not in order of arrival. Because the carry-in order and the carry-out order are different, rehandling may occur, which reduces the performance of the container terminals. In order to reduce rehandling number, containers can be moved in advance when they arrive, which is called preprocessing. This paper proposes an effective preprocessing algorithm and analyzes the factors that affect the productivity of the container terminals. It also provides a way to choose the best factors for preprocessing for a variety of situations. Research design, data, and methodology – To analyze the impact of factors affecting the performance of preprocessing algorithms presented in this paper, simulations are performed. The simulations are performed for two types of bays, 12 stacks with 8 tiers, and 8 stacks with 6 tiers. Results – The results of the factor analysis that affects the performance of the preprocessing algorithm were as follows. (1) As the LMF increased, preprocessing number increases and rehandling number decreased. (2) The LML effect was greatest when the LML changed from 0 to 1, and that the effect decreased when it changed above 1. (3) The sum of preprocessing number and rehandling number was then shown to be increased after decrease, as the LMF increased. (4) In the case of NCI, a decrease in NCI showed that the containers would become more grouped and thus the performance was improved. (5) There was a positive effect in the case of EFS. Conclusion – In this paper, preprocessing algorithm was proposed and it was possible to choose the best factors for preprocessing for a variety of situations through simulations. Further research related to this study needs to be carried out in the following topic : a study on the improvement of container performance by connecting the preprocessing with remarshalling.
Abstract
Purpose – In order to gain the upper hand in competition between container terminals, efforts to improve container terminal productivity continue. Export containers arrive randomly in the container terminal and are carried in the container terminal yard according to the arrival order. On the other hand, containers are carried out of the container terminal yard in order based on container weight, not in order of arrival. Because the carry-in order and the carry-out order are different, rehandling may occur, which reduces the performance of the container terminals. In order to reduce rehandling number, containers can be moved in advance when they arrive, which is called preprocessing. This paper proposes an effective preprocessing algorithm and analyzes the factors that affect the productivity of the container terminals. It also provides a way to choose the best factors for preprocessing for a variety of situations. Research design, data, and methodology – To analyze the impact of factors affecting the performance of preprocessing algorithms presented in this paper, simulations are performed. The simulations are performed for two types of bays, 12 stacks with 8 tiers, and 8 stacks with 6 tiers. Results – The results of the factor analysis that affects the performance of the preprocessing algorithm were as follows. (1) As the LMF increased, preprocessing number increases and rehandling number decreased. (2) The LML effect was greatest when the LML changed from 0 to 1, and that the effect decreased when it changed above 1. (3) The sum of preprocessing number and rehandling number was then shown to be increased after decrease, as the LMF increased. (4) In the case of NCI, a decrease in NCI showed that the containers would become more grouped and thus the performance was improved. (5) There was a positive effect in the case of EFS. Conclusion – In this paper, preprocessing algorithm was proposed and it was possible to choose the best factors for preprocessing for a variety of situations through simulations. Further research related to this study needs to be carried out in the following topic : a study on the improvement of container performance by connecting the preprocessing with remarshalling.
참고문헌 (27)
- 배종욱, "자동화 컨테이너 터미널에서 수직형 블록의 이적작업을 위한 할당 및 작업순서", 한국항해항만학회지, 30(6), pp.459~466 (2006), 한국항해항만학회
- Caserta, M., "Applying the Corridor Method to a Block Relocation Problem", OR Spectrum, 33, pp.915~929 (2011)
- 하병현, "컨테이너 터미널에서 베이 내 컨테이너의 최적 재정돈을 위한 A* 알고리즘", 대한산업공학회지, 38(2), pp.157~172 (2012), 대한산업공학회[DOI]
- Han, X., "A Proactive Approach for Simultaneous Berth and Quay Crane Scheduling Problem with Stochastic Handling Time", European Journal of Operational Research, 207(3), pp.1327~1340 (2010)
- Hirashima, Y., "A New Reinforcement Learning for Group-Based Marshalling Plan considering Desired Layout of Containers in Port Terminals", Proc. IEEE Conf. Networking, Sensing and control, pp.670~675 (2006)
- Imai, A., "Multi objective Simultaneous Stowage and Load Planning for a Container Ship with Container Rehandle in Yard Stacks", European Journal of Operational Research, 171(2), pp.373~389 (2006)
- 정연호, "A Simulation Study on a Workload-based Operation Planning Method in Container Terminals", Industrial Engineering & Management Systems, 11(1), pp.103~113 (2012), 대한산업공학회
- Kang, J. H., "Method of Inbound Container Positioning for Minimal Rehandling Considering Weight", Proceedings of The 2004 KIISS Fall Conference, pp.271~278 (2004), KIISS
- 강재호, "컨테이너 터미널 장치장에서 블록 내 이적을 위한 컨테이너 이동 순서 계획", 한국항해항만학회지, 29(1), pp.83~90 (2005), 한국항해항만학회
- Kang, J., "Deriving Stacking Strategies for Export Containers with Uncertain Weight Information", Journal of Intelligent Manufacturing, 17, pp.399~410 (2006)
- 김지은, "제한된 유휴시간을 고려한 자동화 컨테이너 터미널의 재정돈 컨테이너 선택 방안", 한국항해항만학회지, 33(10), pp.715~722 (2009), 한국항해항만학회
- 김갑환, "컨테이너터미널 운영을 위한 의사결정문제의 소개", 대한산업공학회지, 33(3), pp.290~302 (2007), 대한산업공학회
- Kim, K. H., "Load Scheduling Using a Genetic Algorithm in Port Container Terminals", Journal of the Korean Institute of Industrial Engineers, 23(4), pp.645~660 (1997)
- Kim, K. H., "Deriving Decision Rules to Locate Export Containers in Container Yards", European Journal of Operational Research, 124, pp.89~101 (2000)
- Kim, K. H., "A Heuristic Rule for Relocating Blocks", Computers and Operations Research, 33, pp.940~954 (2006)
- Kim, K. H., "A Note on a Dynamic Space-allocation Method for Outbound Containers", European Journal of Operational Research, 148, pp.92~101 (2003)
- 김태광, "재정돈을 포함한 장치장 크레인의 작업 할당 전략 최적화", 한국항해항만학회지, 38(2), pp.155~162 (2014), 한국항해항만학회[DOI]
- 이시우, "A Genetic Algorithm for the Container Pick-Up Problem", 산업공학(IE interfaces), 24(4), pp.362~372 (2011), 대한산업공학회
- Lee, Y., "A Heuristic for Retrieving Containers from a Yard", Computers and Operations Research, 37, pp.1139~1147 (2010)
- Mohammad B. A., "A genetic algorithm to solve the storage space allocation problem in a container terminal", Computers & Industrial Engineering, 56(1), pp.44~52 (2009)
- Nilsson, N. J., "Artificial Intelligence : A New Synthesis", pp.142~160 (1998), Morgan Kaufmann Publishers, Inc
- 오명섭, "복수 크레인을 활용한 블록 내 컨테이너 이적 계획", 한국항해항만학회지, 29(4), pp.447~456 (2005), 한국항해항만학회
- 박기역, "컨테이너 터미널의 재정돈 대상 컨테이너 주기적 재선택 방안", 한국항해항만학회지, 34(6), pp.503~509 (2010), 한국항해항만학회
- 박영규, "컨테이너 터미널내의 수출 컨테이너 재취급 감소를 위한 반입 컨테이너 선처리 방안", 한국항해항만학회지, 35(1), pp.77~82 (2011), 한국항해항만학회
- Young-Kyu Park, "항만유통의 컨테이너 재정돈 성능요인에 따른 알고리즘 성능비교", 유통과학연구, 14(5), pp.107~114 (2016), 한국유통과학회[DOI]
- Wan, Y. W., "The Assignment of Storage Locations to Containers for a Container Stack", Naval Research Logistics, 56, pp.699~713 (2009)
- Zhang, C., "Storage Space-Allocation in Container Terminals", Transportation Research Part B, 37, pp.883~903 (2003)