대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제38권2호
  • /
  • Pages.157-172
  • /
  • 2012
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

컨테이너 터미널에서 베이 내 컨테이너의 최적 재정돈을 위한 A* 알고리즘

A* Algorithm for Optimal Intra-bay Container Pre-marshalling Plan

  • 하병현 (부산대학교 산업공학과) ;
  • 김상수 (부산대학교 산업공학과)
  • Ha, Byung-Hyun (Dept. of Industrial Engineering, Pusan National University) ;
  • Kim, Sang-Su (Dept. of Industrial Engineering, Pusan National University)
  • 투고 : 2012.03.12
  • 심사 : 2012.05.19
  • 발행 : 2012.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In most container terminals, containers are piled up and stored in a yard in order to utilize the space efficiently. Hence, it requires unproductive container-handling operations to retrieve a container that is not placed on the top of a container stack. As a result, to streamline container-loading operations by which containers are transferred from a yard to a vessel, it is necessary to pre-marshal (i.e., shuffle in advance) containers in accordance with container-loading plan. We propose $A^*$ algorithm to find the optimal container-relocation sequence for the intra-bay container pre-marshalling problem. To work out the heuristic estimate for the proposed $A^*$ algorithm, we introduce the container rearrangement problem and obtain the lower bound of the length of the optimal relocation sequence. The performance of the algorithm is validated extensively by the numerical experiments on the problem instances that are given in the previous studies and generated randomly with various parameters.

키워드

참고문헌

  1. Caserta, M., Voss, S., and Sniedovich, M. (2011), Applying the Corridor Method to a Blocks Relocation Problem, OR Spectrum, 33, 915-929. https://doi.org/10.1007/s00291-009-0176-5
  2. Caserta, M. and Voss, S. (2009), A Corridor Method-Based Algorithm for the Pre-marshalling Problem, Lecture Notes in Computer Science, 5484, 788-797.
  3. Choe, R., Park, T., Oh, M.-S., Kang, J., and Ryu, K. R. (2011), Generating a Rehandling-free Intra-block Remarshaling Plan for an Automated Container Yard, Journal of Intelligent Manufacturing, 22, 201-217. https://doi.org/10.1007/s10845-009-0273-y
  4. Huang, S.-H. and Lin, T.-H. (2012), Heuristic Algorithms for Container Pre-marshalling Problems, Computers and Industrial Engineering, 62(1), 13-20. https://doi.org/10.1016/j.cie.2011.08.010
  5. Imai, A., Sasaki, K., Nishimura, E., and Papadimitriou, S. (2006), Multi-objective Simultaneous Stowage and Load Planning for a Container Ship with Container Rehandle in Yard Stacks, European Journal of Operational Research, 171(2), 373-389. https://doi.org/10.1016/j.ejor.2004.07.066
  6. Jeong, Y. H., Kim, K. H., Woo, Y. J., and Seo, B. H. (2012), A Simulation Study on a Workload-based Operation Planning Method in Container Terminals, Industrial Engineering and Management Systems, 11(1), 103-113. https://doi.org/10.7232/iems.2012.11.1.103
  7. Kang, J., Ryu, K. R., and Kim, K. H. (2006), Deriving Stacking Strategies for Export Containers with Uncertain Weight Information, Journal of Intelligent Manufacturing, 17, 399-410. https://doi.org/10.1007/s10845-005-0013-x
  8. Kim, K. H. (2007), Decision-making Problems for the Operation of Container Terminals, Journal of the Korean Institute of Industrial Engineers, 33(3), 290-302.
  9. Kim, K. H. and Bae, J. W. (1998), Re-marshalling Export Containers in Port Container Terminals, Computers and Industrial Engineering, 35(3-4), 655-658. https://doi.org/10.1016/S0360-8352(98)00182-X
  10. Kim, K. H. and Hong, G.-P. (2006), A Heuristic Rule for Relocating Blocks, Computers and Operations Research, 33, 940-954. https://doi.org/10.1016/j.cor.2004.08.005
  11. Kim, K. H., Kang, J. S., and Ryu, K. R. (2004), A Beam Search Algorithm for the Load Sequencing of Outbound Containers in Port Container Terminals, OR Spectrum, 26(1), 93-116. https://doi.org/10.1007/s00291-003-0148-0
  12. Kim, K. T. and Kim, K. M. (2011), Metaheuristics of the Rail Crane Scheduling Problem, IE Interface, 24(4), 281-294. https://doi.org/10.7232/IEIF.2011.24.4.281
  13. Kim, K. H., Kim, K. Y., and Ko, C. S. (1997), Load Scheduling Using a Genetic Algorithm in Port Container Terminals, Journal of the Korean Institute of Industrial Engineers, 23(4), 645-660.
  14. Kim, K. H. and Park, Y. M. (1996), A Slot Assignment Method in the Container Yard for Export Containers Considering Their Weights, Journal of the Korean Institute of Industrial Engineers, 22(4), 753-770.
  15. 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
  16. Kim, K. H., Park, Y. M., and Ryu, K.-R. (2000), Deriving Decision Rules to Locate Export Containers in Container Yards, European Journal of Operational Research, 124, 89-101. https://doi.org/10.1016/S0377-2217(99)00116-2
  17. Ku, L. P., Lee, L. H., Chew, E. P., and Tan, K. C. (2010), An Optimisation Framework for Yard Planning in a Container Terminal : Case with Automated Rail-mounted Gantry Cranes, OR Spectrum, 32, 519-541. https://doi.org/10.1007/s00291-010-0200-9
  18. Lee, S. W. (2011), A Genetic Algorithm for the Container Pick-Up Problem, IE Interface, 24(4), 362-372. https://doi.org/10.7232/IEIF.2011.24.4.362
  19. Lee, Y. and Chao, S-L. (2009), A Neighborhood Search Heuristic for Pre-marshalling Export Containers, European Journal of Operational Research, 196, 468-475. https://doi.org/10.1016/j.ejor.2008.03.011
  20. Lee, Y. and Lee Y.-J. (2010), A Heuristic for Retrieving Containers from a Yard, Computers and Operations Research, 37, 1139-1147. https://doi.org/10.1016/j.cor.2009.10.005
  21. Lee, Y. and Hsu, N.-Y. (2007), An Optimization Model for the Container Pre-marshalling Problem, Computers and Operations Research, 34, 3295-3313. https://doi.org/10.1016/j.cor.2005.12.006
  22. Nilsson, N. J. (1998), Artificial Intelligence: A New Synthesis, Morgan Kaufmann Publishers, Inc., San Francisco, CA.
  23. Russell, S. and Norvig, P. (2003), Artificial Intelligence : A Modern Approach, 2nd Ed., Pearson Education, Upper Saddle River, NJ.
  24. Wan, Y.-W., Liu, J., and Tsai, P.-C. (2009), The Assignment of Storage Locations to Containers for a Container Stack, Naval Research Logistics, 56, 699-713. https://doi.org/10.1002/nav.20373
  25. Winston, W. L. (2004), Operations Research : Applications and Algorithms, 4th Ed., Thomson Learning, Inc., Belmont, CA.
  26. 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(1), 58-72.
  27. Zhang, C., Liu, J., Wan, Y-W., Murty, K. G., and Linn, R. J. (2003), Storage Space Allocation in Container Terminals, Transportation Research Part B, 37, 883-903. https://doi.org/10.1016/S0191-2615(02)00089-9

피인용 문헌

  1. A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process vol.30, pp.3, 2013, https://doi.org/10.7737/KMSR.2013.30.3.099
  2. Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm vol.41, pp.1, 2015, https://doi.org/10.7232/JKIIE.2015.41.1.001
  3. Remarshalling Plan Using Neighboring Bay in Container Terminal vol.40, pp.3, 2016, https://doi.org/10.5394/KINPR.2016.40.3.113