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

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Quay Wall Scheduling of Ships Using Assignment Method and Tabu Search Algorithm

할당기법과 타부서치 알고리즘을 이용한 선박의 안벽배치 계획

  • Lee, Sang Hyup (Production Process and IT Research Department, Convergence Technology Research Institute, Hyundai Heavy Industries Co. Ltd.) ;
  • Hong, Soon Ik (Production Process and IT Research Department, Convergence Technology Research Institute, Hyundai Heavy Industries Co. Ltd.) ;
  • Ha, Seung Jin (Production Process and IT Research Department, Convergence Technology Research Institute, Hyundai Heavy Industries Co. Ltd.)
  • 이상협 (현대중공업 융합기술연구소 공정 IT연구실) ;
  • 홍순익 (현대중공업 융합기술연구소 공정 IT연구실) ;
  • 하승진 (현대중공업 융합기술연구소 공정 IT연구실)
  • Received : 2014.05.23
  • Accepted : 2014.12.12
  • Published : 2015.02.15
Download PDF
⟨ Previous Next ⟩

Abstract

In shipbuling processes, a quay wall is a major resource for additional operations after an erection operation at dock. A quay wall is becoming a new bottleneck instead of docks, while ship types with long operation time at quay wall are increasing recently. We developed a quay wall scheduling algorithm for the quayside operations of ships in this paper. The objective function is to minimize the sum of not assigned days of ships which have to be assigned to any quay wall under limited numbers of quay walls. The scheduling algorithm is based on an assignment method to assign each ship to a quay wall among its alternative quay walls at the time of launching or moving to another quay wall. The scheduling algorithm is also using Tabu Search algorithm to optimize assignment sequence of ships. The experiment shows that the algorithms in this paper are effective to make schedule of the quayside operations of ships.

Keywords

References

  1. Ahn, N.-S., Kang, J.-Y., Hong, S.-I., Choi, H.-Y., and Park, S.-S. (2007), An Algorithm for the Quay Assignment Scheduling Problem in Shipbuilding Industry, Proceedings of 2007 KIIE Fall Conference.
  2. Imai, A., Nishimura, E., and Papadimitriou, S. (2003), Berth Allocation with Service Priority, Transportation Research, Part B 37, 437-457. https://doi.org/10.1016/S0191-2615(02)00023-1
  3. Jung, I., Yeo, S., Wang, G., Han, K., and Lee, J. (2008), Generating Heuristic Rule for Efficient Quay Assignment of Ships. International Conferences on Computational Intelligence for Modeling, Control and Automation; Intelligent Agents, Web Technologies and Internet Commerce; and Innovation in Software Engineering, 726-731.
  4. Ha, B.-H. and Kim, S.-S. (2012), A* Algorithm for Optimal Intra-bay Container Pre-marshalling Plan, Journal of the Korean Institute of Industrial Engineers, 38(2), 157-172. https://doi.org/10.7232/JKIIE.2012.38.2.157
  5. Kim, K.-H. and Moon, K.-C. (2003), Berth Scheduling by Simulated Annealing, Transportation Research, Part B 37, 541-560. https://doi.org/10.1016/S0191-2615(02)00027-9
  6. Kim, Y.-M. (2009), An Optimization of Ship Building Mix under N Different Docks, IE Interfaces, 22(1), 38-43.
  7. Koh, S.-G., Jang, J.-H., Choi, D.-W., and Woo, S-B. (2011), Spatial Scheduling for Mega-block Assembly Yard in Shipbuilding Company, IE Interfaces, 24(1), 78-86. https://doi.org/10.7232/IEIF.2011.24.1.078
  8. Lee, D.-H. and Bae, H.-R. (2013), Analysis Framework using Process Mining for Block Movement Process in Shipyards, Journal of the Korean Institute of Industrial Engineers, 39(6), 577-586. https://doi.org/10.7232/JKIIE.2013.39.6.577
  9. Lee, S.-H., Kim, J.-O., and Moon, I.-K. (2011), Deployment Planning of Blocks from Storage Yards Using a Tabu Search Algorithm, Journal of the Korean Institute of Industrial Engineers, 37(3), 198-208. https://doi.org/10.7232/JKIIE.2011.37.3.198
  10. Lee, S.-W. (2011), A Genetic Algorithm for the Container Pick-Up Problem, IE Interfaces, 24(4), 362-372. https://doi.org/10.7232/IEIF.2011.24.4.362
  11. Lim, A. (1998), The Berth Planning Problem, Operation Research Letters, 22, 105-110. https://doi.org/10.1016/S0167-6377(98)00010-8
  12. Moccia, L., Cordeau, J. F., Gaudioso, M., and Laporte, G. (2006), A Branch-and-Cut Algorithm for the Quay Crane Scheduling Problem in a Container Terminal, Naval Research Logistics, 53, 45-59. https://doi.org/10.1002/nav.20121
  13. Nishimura, E., Imai, A., and Papadimitriou, S. (2001), Berth Allocation Planning in the Public Berth System by Genetic Algorithms, European Journal of Operational Research, 131, 282-292. https://doi.org/10.1016/S0377-2217(00)00128-4
  14. Park, C.-G. and Seo, J.-Y. (2009), On the Assembly Block Storage Location Assignment Problem, IE Interfaces, 22(2), 116-125.
  15. Park, Y.-M. and Kim, K.-H. (2003), A Scheduling Method for Berth and Quay Cranes, OR Spectrum, 25, 1-23. https://doi.org/10.1007/s00291-002-0109-z