Browse > Article
http://dx.doi.org/10.5394/KINPR.2020.44.6.501

Requirements for Berth-Allocation Planning When Taking Pier-Available Resources and Submarine Support Service Request Schedules into Account  

Choi, Ji-Won (Graduate School of Korea University)
Choi, In-Chan (Dept of Industrial Management Engineering, Korea University)
Abstract
His paper looks more closely at the Republic of Korea's (ROK) Navy submarine berth-allocation strategies, with the study's results ultimately resulting in the proposition of an integer programming model. Current submarine berth-allocation planning problems include the need for more minimal berth-shifting and general support service failures, as a lack of efficient submarine berth-allocation often leads to submarines unable to receive the support service they need due to the inadequacy of their assigned berths. Currently, the ROK Navy allocates berths by only taking available reserve resources and the full-capacity limits of support services into account. This paper expands upon this strategy, and proposes a model which would allow for submarine berth allocation planning to also take submarine support service scheduling into account, allowing for more efficient and timely submarine servicing. This proposed model in turn minimizes berth shifting, support service failures, and allows for full coordination with the submarine support service request schedule. The construction of this model was carried out through data gathered on the ROK Navy's fleets and forces, allowing for a more nuanced analysis of existing issues with submarine berth-allocation planning.
Keywords
berth allocation; maritime logistics; integer programming; submarine servicing; navy port maintenance procedures;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Daganzo, C. F.(1989), "The crane scheduling problem" Transportation Research Part B : Methodological Vol. 23, Issue. 3, pp. 159-175.   DOI
2 Brown, G. G., Cormican, K. J., Lawphongpanich, S. and Widdis, B. D.(1998), "optimizing submarine berthing with a persistence incentive", Naval Research Logistics volume 44, Issue. 4, pp. 301-318.   DOI
3 Brown, G. G., Lawphongpanich, S. and Thurman, K. P.(1994), "Optimizing ship berthing" Naval Research Logistics, volume 41, Issue 1, pp. 1-15.   DOI
4 Hong, D. H. and Kim, C. G.(2004), "Optimized Module Design for Berth Planning of Logistics Information System Using Tabu Search Algorithm" Korea Information Processing Society B vol. 11-B, Issue. 1, pp. 63-70.
5 Hwang, J. Y.(2015), "Korean Navy Underwater Power Enhancement and Export Strategy", Degense & Technology, pp. 58-75.
6 Imai, A., Nagaiwa, K. and Tat, C. W.(1997), "Efficient Planning of Berth Allocation for Container Terminals in Asia" Journal of Advanced Transportation, Vol. 31, Issue. I, pp. 75-94.   DOI
7 Jeong, D. H., Park, Y. M., Lee, B. G., Ryu, G. R. and Kim, G. H.(2006), "A Quay Crane Scheduling Method Considering Congestions in the Yard of Container Terminals", The Korean Operations Research and Management Science Society Conference, pp. 1178-1185.
8 Jung, W. S., Kim, J. H. and Kim, S. K.(2004), "A study on Berth Allocation for Navy Surface Vessels Considering Precedence Relationship among Service", Journal of Korean Navigation and Port Research. vol. 28, Issue. 1, pp. 83-90.   DOI
9 Jung. W. S. and Lee, J. Y.(2009) "The Berth Allocation Method for the Navy Surface Vessels Considering Persistence Incentive" The Korean Operations Research and Management Science Society Academic conference, 2009.10, pp. 286-297.
10 Jung, W. S., Lee, J. Y. and Lee, Y. D.(2010), "The Berth Allocation Method for the Navy Surface Vessels Considering Uncertainty", Korea Institute of Military Service and Technology, Vol. 13, Issue. 5, pp. 748-758.
11 Lim, A.(1998), "The berth planning problem" Operations Research Letters Volume 22, Issues 2-3, pp. 105-110.   DOI
12 Lai, K. K. and Shih, K.(1992), "A Study of Container Berth Allocation," Journal of Advanced Transportation 26 (1), pp. 45-60.   DOI
13 Lee, W. B. and Koo, P. H.(2010), "Simultaneous Determination of Berth Schedule and Quay Crane Allocation", Journal of the Korean Society of Supply Chain Management, Vol. 10, Issue. 2, pp. 51-62.
14 Ministry of Defense Press Release, 2020. 8. 9. https://www.mnd.go.kr.
15 Park, Y. M. and Kim, K. H.(2011), "A Heuristic Algorithm for Berth Planning with a Limited Number of Cranes", Journal of Navigation and Port Research Vol. 35, Issue. 1. pp. 63-70.   DOI
16 Thurman, K. P.(1989) "Optimal ship berthing plans", Naval Postgraduate Thesis and Dissertation Collection.
17 Won, H. S., Ho, A. T. and Lee, S. H.(2009), "A Berth Allocation Problem to Maximize the Available Rate of Naval Vessels", The Korea Society for Simulation, vol 18. Issue. 2. pp. 19-27.