Performance Analysis of a Combination of Carry-in and Remarshalling Algorithms
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Purpose: The container terminal is an area that plays an important role in the country's import and export. As the volume of containers increased worldwide, competition between terminals became fiercer, and increasing the productivity of terminals became more important. Re-handling is a serious obstacle that lowers the productivity of terminal. There are two ways to reduce re-handling in the terminal yard. The first method is to load containers in terminal yards using effective carry-in algorithms that reduce re-handling. The second method is to carry out effective remarshalling. In this paper, the performance of various carry-in algorithms and various remarshalling algorithms are reviewed. Next, we try to find the most effective combination of carry-in algorithm and remarshalling algorithm. Research design, data and methodology: In this paper, we analyze the performance of the four carry-in algorithms, AP, MDF, LVF, RP and the four remarshalling algorithms, ASI, ASI+, ASO, ASO+. And after making all the combinations of carry-in algorithms and remarshalling algorithms, we compare their performance to find the best combination. To that end, many experiments are conducted with eight types of 100 bays through simulation. Results: The results of experiments showed that AP was effective among the carry-in algorithms and ASO+ was effective among remarshalling algorithms. In the case of the LVF algorithm, the effect of carrying in was bad, but it was found to be effective in finding remarshalling solution. And we could see that ASI+ and ASO+, algorithms that carry out remarshalling even if they fail to find remarshalling solution, are also more effective than ASI and ASO. And among the combinations of carry-in algorithms and remarshalling algorithms, we could see that the combination of AP algorithm and ASO+ algorithm was the most effective combination. Conclusion: We compared the performance of the carry-in algorithms and the remarshalling algorithms and the performance of their combination. Since the performance of the container yard has a significant effect on the performance of the entire container terminal, it is believed that the results of this experiment will be effective in improving the performance of the container terminal when carrying-in or when remarshalling.
Abstract
Purpose: The container terminal is an area that plays an important role in the country's import and export. As the volume of containers increased worldwide, competition between terminals became fiercer, and increasing the productivity of terminals became more important. Re-handling is a serious obstacle that lowers the productivity of terminal. There are two ways to reduce re-handling in the terminal yard. The first method is to load containers in terminal yards using effective carry-in algorithms that reduce re-handling. The second method is to carry out effective remarshalling. In this paper, the performance of various carry-in algorithms and various remarshalling algorithms are reviewed. Next, we try to find the most effective combination of carry-in algorithm and remarshalling algorithm. Research design, data and methodology: In this paper, we analyze the performance of the four carry-in algorithms, AP, MDF, LVF, RP and the four remarshalling algorithms, ASI, ASI+, ASO, ASO+. And after making all the combinations of carry-in algorithms and remarshalling algorithms, we compare their performance to find the best combination. To that end, many experiments are conducted with eight types of 100 bays through simulation. Results: The results of experiments showed that AP was effective among the carry-in algorithms and ASO+ was effective among remarshalling algorithms. In the case of the LVF algorithm, the effect of carrying in was bad, but it was found to be effective in finding remarshalling solution. And we could see that ASI+ and ASO+, algorithms that carry out remarshalling even if they fail to find remarshalling solution, are also more effective than ASI and ASO. And among the combinations of carry-in algorithms and remarshalling algorithms, we could see that the combination of AP algorithm and ASO+ algorithm was the most effective combination. Conclusion: We compared the performance of the carry-in algorithms and the remarshalling algorithms and the performance of their combination. Since the performance of the container yard has a significant effect on the performance of the entire container terminal, it is believed that the results of this experiment will be effective in improving the performance of the container terminal when carrying-in or when remarshalling.
참고문헌 (23)
- 차상현, "컨테이너터미널에서 생산성 향상을 위한 이송장비 풀링시스템 적용방안에 관한 연구", 한국항해항만학회지, 38(4), pp.399~407 (2014), 한국항해항만학회[DOI]
- 차상현, "컨테이너터미널에서 야드 이송장비 자동화 적용방안에 관한 연구", 한국항해항만학회지, 42(3), pp.217~226 (2018), 한국항해항만학회[DOI]
- 정창윤, "컨테이너 터미널의 효율적인 듀얼 사이클을 위한 야드 운영", 한국항해항만학회지, 35(1), pp.71~76 (2011), 한국항해항만학회
- 하병현, "컨테이너 터미널에서 베이 내 컨테이너의 최적 재정돈을 위한 A* 알고리즘", 대한산업공학회지, 38(2), pp.157~172 (2012), 대한산업공학회[DOI]
- Analysis of Combined Productivity at Automated Container Terminal Using Simulation, "Ha, T. Y.", The Korean Operations Research and Management Science Society, 643~646 (2004)
- 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)
- Kang, J., "Deriving Stacking Strategies for Export Containers with Uncertain Weight Information", Journal of Intelligent Manufacturing, 17, pp.399~410 (2006)
- 김보성, "레일기반 컨테이너 터미널의 재정돈버퍼 위치 결정 모델 연구", 로지스틱스연구, 26(3), pp.1~16 (2018), 한국로지스틱스학회[DOI]
- 김지은, "제한된 유휴시간을 고려한 자동화 컨테이너 터미널의 재정돈 컨테이너 선택 방안", 한국항해항만학회지, 33(10), pp.715~722 (2009), 한국항해항만학회
- Kim, K. H., "A slot assignment method in the container yard for export containers considering their weights", Journal of the Korean I nstitute of Industrial Engineers, 22(4), pp.753~770 (1996)
- 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., "Evaluation of Yard Layouts of Automated Container Terminals by Using the Simulation", International Journal of Management Science, 1(1), pp.418~421 (2001)
- 김태광, "재정돈을 포함한 장치장 크레인의 작업 할당 전략 최적화", 한국항해항만학회지, 38(2), pp.155~162 (2014), 한국항해항만학회[DOI]
- 이시우, "A Genetic Algorithm for the Container Pick-Up Problem", 산업공학(IE interfaces), 24(4), pp.362~372 (2011), 대한산업공학회
- Mohammad Bazzazi, "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" (1998), USA Morgan Kaufmann Publishers, Inc
- 오명섭, "복수 크레인을 활용한 블록 내 컨테이너 이적 계획", 한국항해항만학회지, 29(4), pp.447~456 (2005), 한국항해항만학회
- 박영규, "컨테이너 터미널에서 이웃 베이를 활용한 컨테이너 재정돈 계획", 한국항해항만학회지, 40(3), pp.113~120 (2016), 한국항해항만학회[DOI]
- 박영규, "컨테이너 터미널내의 수출 컨테이너 재취급 감소를 위한 반입 컨테이너 선처리 방안", 한국항해항만학회지, 35(1), pp.77~82 (2011), 한국항해항만학회
- 서정훈, "레일기반 컨테이너 이송 시스템의 교착에 관한 시뮬레이션 연구", 한국항해항만학회지, 42(1), pp.47~56 (2018), 한국항해항만학회[DOI]
- Zhang, C., "Storage Space Allocation in Container Terminals", Transportation Research Part B Methodological, 37(10), pp.883~903 (2003)