• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.3
• /
• pp.171-179
• /
• 2011

In this paper, we deal with the vehicle routing problem that could establish operational plan of military engineer for survivability support of artillery position construction. We propose VRPTW(vehicle routing problem with time-window) model of special form that considered service level to reflect the characteristics of military operations rather than the logic of economic efficiencies in the objective function. Furthermore we suggest modified particle swarm optimization algorithm for service based vehicle routing problem solution that can be possible to search in complicated and uncertain area and control relation softly between global and local search.

• Journal of the military operations research society of Korea
• /
• v.2 no.1
• /
• pp.163-176
• /
• 1976

The artillery fire is characterized by great damage that can be inflicted simultaneously to an area through concentrated firing. The field artillery guns used in R.O.K. Army are generally old. Thus high values of their velocity errors cause wide dispersion of shell landings. Therefore effects of the concentrated firing is lessened. In this paper a general model which considers all error factors involved in firing in general, is established first. Then from this a basic model which includes the errors involved in concentrated firing only, such as the ballistic error, velocity error, target density function, and damage function, is extracted. Among many weapon systems now in use a specific one called gun 'A' is selected and its concentration effects are measured through computer simulation. The results show that as the velocity error of a battery increases, its target coverage capability, i. e. concentration effect, decreases. Therefore the need arises for the field artillery commander to know beforehand characteristics, i.e. velocity errors, of the guns in his unit and also to carefully examine the problem of battery arrangement with the gun characteristics in mind in order to maximize the damage effects of his artillery unit.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.359-363
• /
• 2008

In recent warfare, importance of counter-fire is increased. New weapon system and counter-fire have critical impact on defeating of the enemy. At an initial battle counter-fire, we need to study about striking plan against the enemy mine artillery. In this paper, we studied, using MANA(agent based model), how much cannon's hit probability and UAV-based target acquisition have influence on striking the mine artillery. We constructed MANA model based on the characteristics of a regional database of Korean peninsula. If we develop detail database of the ROK Army, the proposed MANA model can be used as a war-game model for the regimental level of the Army.

• Journal of the military operations research society of Korea
• /
• v.18 no.1
• /
• pp.74-85
• /
• 1992

Increasing the number of artillery units requires more deployment space in the field operation area. However, there is limited space available in FEBA due to mountainous terrains. Therefore most artillery units cannot occupy enough deployment space which is proposed in the field artillery mannual(FM) to maximize the firing-effectiveness and to minimize the enemy threat. This paper studies the problems of reducing the size of a battery deployment space being applied currently without decreasing the firing-effectiveness of the battery. The optimum size of a battery position is obtained by using Lemus and David's allocation model and Supper Quick II Model which produces the probability of kill data with various input data. The result shows that the battery deployment space can be reduced without decreasing the firing-effectiveness in the example problem.

• Journal of the military operations research society of Korea
• /
• v.36 no.1
• /
• pp.15-27
• /
• 2010

Fire sequencing problem is to find a sequence of firing on the targets. The latest, because the korea artillery force is inferior in number as compared with north korea force. It is an important question to give a fatal damage to the enemy force by using prompt and accurate fire in order to overcome the lack of artillery force. Minimizing the fire finishing time will secure the adapt ability in tactical operation. In this paper, we developed a mathematical model to do allocation the fire on the targets to decrease to total fire operation time. In order to work out the fire sequencing problem, MIP is developed and the optimum solution is obtained by using ILOG OPL. If this analytical model is applied to the field artillery unit, it will improve the artillery fire force enhancement.

• Journal of the military operations research society of Korea
• /
• v.17 no.2
• /
• pp.31-43
• /
• 1991

The fire effectiveness and the operationability of the ground weapon system (such as tank, armored vehicle, howitzer, MLRS, ${\cdots}$), whose operations are usually happened on the ground, are dependent not only on their performances but also on the terrain environments. Especially, the artillery weapons systems' effectiveness is largely varied, because their maneuverability (such as translation, occupation of their sites) and the fire effectiveness are very dependent on the terrain. In this paper, presented are the methods how to analyze the terrain using the digital terrain data. And a software (which are implemented on the IBM PC compatible personal computer) is developed for the analysis of the terrain using the various method of computer Aided Geometric Design and Modeling. The S/W is expected to be very useful for the evaluation of the artillery weapon systems and for the commanders' decision making.

• Journal of the military operations research society of Korea
• /
• v.8 no.2
• /
• pp.17-30
• /
• 1982

This paper offers an optimal artillery deployment scheme for the defending unit when two forces are confronted at a military front line. When proposed gun sites, types and number of guns as well as targets are given, the solutions of the two models in this paper direct each (unit of) guns to a certain location. The aim of the models is to maximize the number of guns which can hit important targets. Unlike widely used target assignment models, these models are formulated using the set covering problem concept. These models do not contain probabilities and time. Thus they are simple as models, easy in implementation, and yield tractable solutions. The dynamic and probabilistic feature of battle situations is implicitly reflected on the models. The first model is for the case that enemies' approaching route is clearly predictable, while the second model is for the unpredictable approaching route case.

• Korean Management Science Review
• /
• v.34 no.1
• /
• pp.47-56
• /
• 2017

We focus on the Real time Fire Scheduling Problem (RFSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing threatening probability to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We suggest mathematical modeling for RFSP and several heuristic algorithms. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithms outperform the firing method which is generally adopted in the field artillery.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.1
• /
• pp.47-65
• /
• 2010

In this study the artillery fire system is investigated in consideration of the characteristics of the troop and the target. Two kinds of decision are to be made on the target allocation with fire ammunition and the fire sequencing for the target with duties in charge. The objective is to minimize the completion time for all troops. Each target has the specified amount of load of fire, which can be accomplished by a single troop or the combination of the troops having different capabilities. Mathematical model is suggested, and the heuristic algorithm which yields a solution within a reasonable computation time is developed. The algorithm consists of iterative three steps : the initial solution generation, the division improvement, and the exchange improvement. The performance of the heuristic is evaluated through the computational experiment

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.50-70
• /
• 1986

When the ICM is fired in the artillery weapon, it is necessary to determine rounds of munitions for sufficient damage to targets of different sizes and shapes. This paper analyzes all kinds of delivery errors involved in ICM firing, and then develops the target coverage model appropriate for ICM salvos. This model is evaluated through computer simulation. The expected target coverage is measured according to number of salvos, range and probable error, velocity error, battery arrangement, target size, and shell reliability respectively.