• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.28-44
• /
• 1987

This thesis presents a model to assign targets and to determine gun ammunitions required for naval surface warfare. Delivery errors of weapon systems and vulnerability of moving targets are analyzed, then probability to kill moving battle sihps is computed. A weapon-target allocation model is proposed by using the Out of Kilter technique. A model to determine ammunitions required for killing moving targets is also designed. The models are evaluated by simulation and sensitivity analysis.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.614-622
• /
• 2018

As multiple weapons are fired simultaneously in multi-target and multi-weapon environments, a possibility always exists in the collision occurred by the intersection between weapon trajectories. The collision between weapons not only hinders the rapid reaction but also causes the loss of the asset of weapons of friendly force to weaken the responsive power against the threat by an enemy. In this paper, we propose an intersection validation and interference elimination algorithm between weapon trajectories in multi-target and multi-weapon environments. The core points of our algorithm are to confirm the possible interference through the analysis on the intersections between weapon trajectories and to eliminate the mutual interference. To show the superiority of our algorithm, we implement the evaluation and verification of performances through the simulation and visualization of our algorithm. Our experimental results show that the proposed algorithm performs effectively the interference elimination regardless of the number of targets and weapon groups by showing that no cross point exists.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.4
• /
• pp.441-450
• /
• 2015

The tactical communications network has to be deployed rapidly at military operation area and support the communications between the military command systems and the weapon systems. For that, the frequency assignment is required for backbone wireless links of tactical communications network without frequency interferences. In this paper, we propose a frequency assignment method using net filter discrimination (NFD) and graph coloring to avoid frequency interferences. The proposed method presents frequency assignment problem of tactical communications network as vertex graph coloring problem of a weighted graph. And it makes frequency assignment sequences and assigns center frequencies to communication links according to the priority of communication links and graph coloring. The evaluation shows that this method can assign center frequencies to backbone communication links without frequency interferences. It also shows that the method can improve the frequency utilization in comparison with HTZ-warfare that is currently used by Korean Army.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.10a
• /
• pp.227-231
• /
• 2004

본 연구에서는 군용선 설계 시 중요한 요소인 무장탑재 및 무장 할당 문제 해결을 위해, ACO(Ant Colony Optimization) 알고리즘과 Lanchester 법칙이 결합된 방법론을 제안하고 적용 결과를 검토하는 것을 내용으로 하고 있다.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.6
• /
• pp.733-738
• /
• 2009

In this paper, we have proposed the design and implementation for efficient Command Control and Alert(C2A). Information fusion must be done for knowing the state and identification of targets using multi-sensor. The threat priority of targets which are processed and identified by information fusion is calculated by air-defence operation logic. The threat targets are assigned to the valid and effective weapons by nearest neighborhood algorithm. Furthermore, the assignment result allows operators to effectively operate C2A by providing the operators with visualizing symbol color and the assignment pairing color line. We introduce the prototype which is implemented by the proposed design and algorithm.

• Korean Management Science Review
• /
• v.25 no.1
• /
• pp.55-74
• /
• 2008

In recent warfare, the performance improvement of air weapon systems enables an aircraft to strike multiple targets on a single sortie. Further, aircrafts attacking targets may carry out an operation as a strike package that is composed of bombers, escort aircrafts, SEAD (Suppression of Enemy Air Defenses) aircrafts and etc. In this paper, we present an aircraft allocation model that allocates multiple targets to a single sortie in the form of a strike package. A mixed integer programming is developed and solved by using a commercially available software. The new model is better than existing ones because not only it allocates aircrafts to multiple targets but also it models the concept of the strike package. We perform a computational experiment to compare the result of the new model with that of existing ones, and perform sensitivity analysis by varying a couple of important parameters.

• Journal of the military operations research society of Korea
• /
• v.37 no.1
• /
• pp.147-159
• /
• 2011

Recently, the military service period has been shortened continuously. Meanwhile, more skilled airmen are needed as the complexity of weapon systems increase. This phenomenon could lead to a disastrous result such as deteriorating the level of the readiness and the fighting power. We suggest a method to improve recruit's maintenance capability rapidly by assigning airmen to jobs appropriate to their characteristics using Datamining methods (K-menas and CART). We focus on the assigning method for air force's air-munition maintenance airmen since they are requested more skilled than other airmen. Grouping airmen with k-means method and devising classification rule with CART algorithm, we found that airmen's proficiency arrival period could be shortened by 1.79 months when they are assigned in the suggested way.

• Korean Management Science Review
• /
• v.32 no.1
• /
• pp.49-63
• /
• 2015

This paper investigates an aircraft-target assignment problem in consideration of deconfliction. The aircraft-target assignment problem is the problem to assign available aircrafts and weapons to targets that should be attacked, where the objective function is to minimize the total expected damage of aircrafts. Deconfliction is the way of dividing airspaces for aircraft flight to ensure the safety while performing the mission. In this paper, mixed integer programming model is suggested, where it considers deconfliction between aircrafts. However, the suggested MIP model is non-linear and limited to get solution for large size problem. The 2-phase decomposition model is suggested for efficiency and computation, where in the first phase target area is divided into sectors for deconfliction and in the second phase aircrafts and weapons are assigned to given targets for minimizing expected damage of aircraft. The proposed decomposition model shows outperforms the model developed for comparison in the computational experiment.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.2
• /
• pp.235-245
• /
• 2018

This study first analyzes the necessity and the validity of procuring nuclear-powered submarines, and presents an optimization model as an integer program to determine a minimum required level of them. For an optimization model, we characterize a submarine's mission, ability and availability, and apply these to the model by constraints. Then, we assign the submarines available currently and the nuclear-powered submarines, that will be newly introduced, to the predefined missions over the planning time periods in a way that the number of nuclear-powered submarines be minimized. Randomly generated missions are employed to solve a mission assignment problem, and the results show that our integer programming model provides an optimal solution as designed, and this can provide a guideline for other weapon system procurement processes.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.05a
• /
• pp.55-58
• /
• 2003

본 논문에서는 유전자 알고리즘을 이용한 무장할당 문제를 제안하였다. 무장할당이란 적의 공격으로부터 방어대상물의 손상을 최소화하거나 적의 공격물 또는 표적의 격추 확률이 최대가 되도록 표적에 대한 방어무기의 적절한 할당을 목적으로 하는 최적화 문제로서, 본 논문에서는 무장할당 문제에 전역 최적화의 강점을 가진 유전자 알고리즘을 적용하였다. 무장할당문제에 적합한 유전자 알고리즘 형태와 파라메타를 선정하는 방법을 제시하였고, 시뮬레이션을 통해서 기존의 전통적인 최적화 기법과의 성능 비교를 수행한 결과, 제안된 방법이 우수함을 입증하였다.