해군 직군 및 함정 업무 지정을 위한 헝가리안 알고리즘을 적용한 프로그램 이용 연구

김세라¹^{, *} ; 조룸빈² ; 허웅³ ; 김준선⁴

1해군사관학교 기초과학과 부교수
2해군사관학교 조선공학과 생도
3해군사관학교 전기전자공학과 생도
4해군사관학교 국제관계학과 생도

On the Program Applying by the Hungarian Algorithm for Assignment of Naval Jobs and Ships

Sera Kim¹^{, *} ; Rumbeen Cho² ; Woong Heo³ ; Joonseon Kim⁴

1Associate professor, Dept. of Natural Science, Republic of Korea Naval Academy
2Midshipman, Dept. of Naval Architecture and Ocean Engineering, Republic of Korea Naval Academy
3Midshipman, Dept. of Electronics and Control Engineering, Republic of Korea Naval Academy
4Midshipman, Dept. of International Relations, Republic of Korea Naval Academy

Correspondence to: ^*Sera Kim Dept. of Natural Science, Republic of Korea Naval Academy 1 Jungwon-ro, Jinhae-gu, Changwon-si, Gyungsangnam-do, 51704, Republic of Korea Tel: +82-55-907-5234 E-mail: srkim85@gmail.com

초록

이 연구는 헝가리안 알고리즘을 활용하여 개발된 파이썬 프로그램을 소개하며, 이를 이용한 해군 업무 분장 및 함정 배정 방법을 제안한다. 이 프로그램은 주어진 조건을 단시간 내에 최적으로 만족하는 매칭을 제공한다. 또한, 이 논문은 해당 프로그램이 해군 작전에 어떻게 도움을 줄 수 있는지를 보여주는 다양한 실제 사례를 포함하고 있다.

Abstract

This study presents a Python program developed using the Hungarian algorithm, proposing a method for naval job assignment and ship allocation. The program provides optimal matching that satisfies given conditions in a short time. Additionally, the paper includes various real-world examples demonstrating how the program can assist in naval operations.

Keywords:

Hungarian Algorithm, Naval Job Assignment, Naval Ship Assignment, Combat Effectiveness, Python

키워드:

헝가리안 알고리즘, 해군 직업 배정, 해군 함정 배정, 전투 효율성, 파이썬

Acknowledgments

보안성검토 결과 일부 세부사항이 삭제되었습니다. 논문에 관한 문의는 교신저자에게 연락 바랍니다.

References

Office of the Deputy Assistant Secretary of Defense for Systems Engineering, “Department of Defense Risk, Issue, and Opportunity Management Guide for Defense Acquisition Programs,” https://www.dau.edu/sites/default/files/Migrated/CopDocuments/RIO%20Guide%20January2017.pdf
Harold W. Kuhn, “The Hungarian Method for the assignment problem,” Naval Research Logistics Quarterly, 2: 83–97, 1955. Kuhn’s original publication. [https://doi.org/10.1002/nav.3800020109]
Harold W. Kuhn, “Variants of the Hungarian Method for Assignment Problems,” Naval Research Logistics Quarterly, 3: 253–258, 1956. [https://doi.org/10.1002/nav.3800030404]
Flood, Merrill M. (1956). “The Traveling-Salesman Problem,” Operations Research. 4(1): 61–75. [https://doi.org/10.1287/opre.4.1.61.ISSN0030-364X]
Munkres, “Algorithms for the Assignment and Transportation Problems,” Journal of the Society for Industrial and Applied Mathematics, 5(1): 32–38, 1957 March. [https://doi.org/10.1137/0105003]
GlobalSecurity.org, South Korea Navy Equipment, https://www.globalsecurity.org/military/world/rok/ship.htm