• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.74-83
• /
• 2018

It is very crucial activities that Korean army have to detect and recognize enemy's locations and types of weapon of their artillery firstly for effective operation of friendly force's artillery weapons during wartime. For these activities, one of the most critical artillery weapon systems is the anti-artillery radar (hereafter; radars) for immediate counter-fire operations against the target. So, in early wartime these radar's roles are very important for minimizing friendly force's damage because arbiters have to recognize a several enemy's artillery positions quickly and then to take an action right away. Up to date, Republic of Korea Army for tactical artillery operations only depends on individual commander's intuition and capability. Therefore, we propose these radars allocation model based on integer programming that combines ArcGIS (Geographic Information System) analysis data and each radar's performances which include allowable specific ranges of altitude, azimuth (FOV; field of view) and distances for target detection, and weapons types i.e., rocket, mortars and cannon ammo etc. And we demonstrate the effectiveness of their allocation's solution of available various types of radar asset through several experimental scenarios. The proposed model can be ensured the optimal detection coverage, the enhancement of artillery radar's operations and assisting a quick decision for commander finally.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.37-44
• /
• 2012

This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.2
• /
• pp.175-184
• /
• 2013

In counterfire warfare, it is important to detect and attack enemy targets faster than the enemy using sensing and shooting assets. The artillery assets of North Korea are mostly mine artillery and much more than those of South Korea. To cope with sudden fire attacks from North Korea, we need to improve capability of our artillery. In this paper, we discuss issues and problems of our counterfire warfare systems and processes to overcome numerical inferiority and defend against the mine artillery. We develop a simulation model for counterfire warfare and analyze effectiveness of our counterfire weapon systems and operations based on various counterfire warfare scenarios. Finally, we propose methods of tactical operations and acquisition strategies of counterfire weapon systems, including detaction, firing, and protection assets.

• Korean Management Science Review
• /
• v.34 no.2
• /
• pp.103-113
• /
• 2017

The artillery is a key element of the ground forces operation during wartime, and the military engineers support the artillery position development operation to support the smooth operation of the artillery. In establishing the artillery position development operation plan, the commander requires more than his intuition to find the best option reflecting a number of elements of the battlefield situation which changes every minute. Moreover, the number of available equipment is smaller than the number of required position developments, and the effective equipment operation becomes essential element of this issue. This study quantified the capability of the available engineering equipment, organized a number of teams enabling equipment to put out the maximum capacity based on the quantified figures, and formed the model which allocates the team to the developing points to minimize the developing time. The goal programming method was applied to resolve the problem. The developed model was applied to compare the total mission duration following the number of teams, the variable for commander's decision, and the result of this study can be used as the quantitative data for commander's decision making process in establishing the artillery position development support operation through effective equipment management.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.154-161
• /
• 2010

This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• Journal of the military operations research society of Korea
• /
• v.33 no.1
• /
• pp.105-115
• /
• 2007

It is essential to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. During the artillery fire operations, minimizing the firing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to schedule the artillery fire on the multiple targets to decrease total fire operation time. To design a program to describe a real firing situation, we consider many possible circumstances of changes such as commander's intention, firing constraints, target priority, and contingency plan to make a fire plan in an artillery unit. In order to work out the target sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to a field artillery unit, it will improve the efficiency of the artillery fire force operations.

• Journal of the military operations research society of Korea
• /
• v.36 no.2
• /
• pp.11-24
• /
• 2010

Quick precision-strike capability of the artillery will be an important factor in modern and future war and it's represented by NCW and EBO. This study is based on artillery which has time limitation of firing, such as artillery which hides when not firing, and modeling various situations to decide firing order and who to shoot. The main purpose of this study is to suggest a mathematical programming model and a genetic algorithm which satisfies the limitation of firing time. The objective function is to minimize the total firing time to spend. The results of the suggested algorithm quickly gives a best solution for a large scale field artillery targeting problems.

• Journal of the military operations research society of Korea
• /
• v.31 no.2
• /
• pp.28-44
• /
• 2005

The previous studies approach the field artillery fire scheduling problem as deterministic and do not explicitly include information on the potential scenario changes. Unfortunately, the effort used to optimize fire sequences and reduce the total time of engagement is often inefficient as the collected military intelligence changes. Instead of modeling the fire sequencing problem as deterministic model, we consider a stochastic artillery fire scheduling model and devise a solution methodology to integrate possible enemy attack scenarios in the evaluation of artillery fire sequences. The goal is to use that information to find robust solutions that withstand disruptions in a better way, Such an approach is important because we can proactively consider the effects of certain unique scheduling decisions. By identifying more robust schedules, cascading delay effects will be minimized. In this paper we describe our stochastic model for the field artillery fire sequencing problem and offer revised robust stochastic model which considers worst scenario first. The robust stochastic model makes the solution more stable than the general two-stage stochastic model and also reduces the computational cost dramatically. We present computational results demonstrating the effectiveness of our proposed method by EVPI, VSS, and Variances.

• Journal of the military operations research society of Korea
• /
• v.34 no.1
• /
• pp.1-11
• /
• 2008

A methodology for the improvement of simulation based training system for the artillery is proposed in this paper. The complex nonlinear relationship inherent among parameters in artillery firing is difficult to model and analyze. By introducing neural network based simulation, accurate representation of artillery firing is made possible. The artillery training system can greatly benefit from the improved prediction. Neural networks learning is conducted using the conjugate gradient algorithm. The evaluation of the proposed methodology is performed through simulation. Prediction errors of both regression analysis model and neural networks model are analyzed. Implementation of neural networks to training system enables more realistic training, improved combat power and reduced budget.

• Journal of the military operations research society of Korea
• /
• v.23 no.2
• /
• pp.155-170
• /
• 1997

Currently, increasing the number of artillery units requires more deployment space in FABA. However, available positions of artillery units in FEBA is limited due to mountainous terrains. Therefore, it is hard to find enough artillery position space in accordance with the field artillery mannual. This paper studies on determination of the size of battery position in order to maximize the firing-effectiveness and to minimize the enemy threat. Also, it studies the possibility of reducing the size of a battery position. The optimum size of a battery position id obtained by using Dantzig's model and Supper Quick II model which produces the probability of kill data with various input data. As a result, it shows that the size of battery position can be reduced without decreasing the firing-effectiveness.