• Title/Summary/Keyword: Artillery Fire

Search Result 35, Processing Time 0.024 seconds

Algorithms for Fire Sequencing Problem in Unplanned Artillery Attack Operation (포병부대 비계획 사격순서 결정 알고리즘)

  • Choi, Yong-Baek;Kim, Kyung-Sup
    • 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.

A Two-Stage Stochastic Approach to the Artillery Fire Sequencing Problem (2단계 추계학적 야전 포병 사격 순서 결정 모형에 관한 연구)

  • Jo, Jae-Young
    • 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.

An Optimization of the Planned Target Sequencing Problem Using Scheduling Method (스케줄링을 이용한 계획표적 사격순서의 최적화 방안)

  • Hwang, Won-Shik;Lee, Jae-Yeong
    • 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.

Installation of Sound Barrier to Prevent Damage to Structures Caused by Artillery Fire Impact Sound (포 사격 충격음의 구조물 손상 방지를 위한 방음벽 설치 방안)

  • Park, June;Ha, Yonghoon
    • Journal of the Korea Society for Simulation
    • /
    • v.30 no.3
    • /
    • pp.31-39
    • /
    • 2021
  • During artillery fire, an excessive level of impulse noise propagating in the form of a storm wave is generated. Since the sound of impact from the fire affects the stability of the surrounding structures, the artillery and the structures must be separated from each other by the proper distance to avoid damages from friendly fire. However, if they have already been built within the distance, it is possible to prevent the damages by building sound barriers between them. In this study, the proper separation distance between the artillery and the structure was calculated, and the insertion losses due to various heights and shapes of the sound barrier were simulated by using the BEM(Boundary Element Method), and conclusively the optimal sound barrier was selected.

A Study on the Preplanned Target Allocation Problem for Minimizing Fire Time of Field Artillery (포병부대 계획표적 사격시간 단축을 위한 표적할당에 관한 연구)

  • Hwang, Won-Shik;Chun, Youn-Hwan;Phak, Hyon-Su;Youn, Sang-Heom
    • 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.

A Branch-and-Bound Algorithm on the Fire Sequencing for Planned Artillery Operations (포병부대 사격순서결정을 위한 분지한계 알고리즘 연구)

  • Yoon, Sang-Hum;Hwang, Won-Shik;Juhn, Jae-Ho;Lee, Ik-Sun
    • 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.

A Study on Mine Artillery Hit Using DEVS (DEVS을 이용한 갱도포병 타격에 관한 연구)

  • Chung, Young-Ho;Shin, Ki-Tae;Park, Jin-Woo
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.3
    • /
    • pp.45-51
    • /
    • 2008
  • The enemy will attempt to destroy our troop's core facilities using various fire supports at the beginning of war. Among these fire supports, artillery is given a most deal of weight and mine artillery is a great threat to our troops because it has a superior predominance on the ability of survival. A study about hitting mine artillery has been developed inside the military field only. However, these studies had been mostly qualitative analyses, thus having limitations in the aspects of nonobjectiveness and simplicity. Current study attempts to develop theory on hitting mine artillery beginning from mine opening until the target got hit, based on the assumption that one side which has inferior force will attack first. We studied on hitting mine artillery in a quantitative way using DEVS method.

  • PDF

A study on the mine artillery striking method using agent based modeling & simulation (에이전트 기반모의를 통한 갱도포병 타격방안 연구)

  • Kim, Se-Yong
    • 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.

  • PDF

Optimal Allocation Model of Anti-Artillery Radar by Using ArcGIS and its Specifications (지형공간정보와 제원 특성을 적용한 대포병레이더 최적배치모형)

  • Lee, Moon Gul
    • 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.

Heuristic for the Simultaneous Target Allocation and Fire Sequencing Problem (표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법)

  • Kim, Dong-Hyun;Lee, Young-Hoon
    • 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