• 제목/요약/키워드: Artillery Operations

검색결과 37건 처리시간 0.035초

포병화력 생존성지원을 위한 진지구축경로문제 연구 (Study on Vehicle Routing Problem of Artillery Position Construction for Survivability Support)

  • 문정현;이상헌
    • 대한산업공학회지
    • /
    • 제37권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.

야전포병 무기체계의 속도오차 허용한계 (Acceptable Velocity Errors Tolerance For Field Artillery Weapon System)

  • 민계료;배도선
    • 한국국방경영분석학회지
    • /
    • 제2권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.

  • PDF

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

  • 김세용
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2008년도 추계학술대회 및 정기총회
    • /
    • 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

포병진지 규모의 축소 가능성에 관한 연구 (A Study for the Possibility of Reducing the Size of Battery Position)

  • 고재홍;강성진
    • 한국국방경영분석학회지
    • /
    • 제18권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.

  • PDF

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

  • 황원식;천윤환;박현수;윤상흠
    • 한국국방경영분석학회지
    • /
    • 제36권1호
    • /
    • pp.15-27
    • /
    • 2010
  • 현대전에 있어서 대량의 화력, 신속한 기동력은 전승의 핵심요소이기 때문에 전쟁에서 승리하기 위해서는 이에 대한 과학적인 운용이 요구된다. 따라서 첨단기술을 이용한 치밀한 화력계획과 신속 정확한 타격으로 적에게 치명적인 피해를 줄 수 있어야 한다. 특히 사격이 작전개시 전에 미리 계획하여 수행하게 되는 경우는 표적별 사격 필요량에 의해 사격부대의 사격량을 할당함과 동시에 사격순서를 결정한 후 전체사격시간을 최소화함으로써 사격의 효과를 높일 수 있다. 따라서 본 연구에서는 이러한 사격완료시간을 최소화하기 위하여 동시에 표적을 타격하는 경우와 현재 야전부대에서 운용하고 있는 개별적으로 사격하는 문제 그리고 사격부대를 혼합하여 사격하는 경우의 최적의 사격완료시간을 비교하고, 사격시간 최소화를 위해 각 표적을 어떻게 할당할 것인지 수리모형을 이용하여 방안을 제시함으로써 작전계획에 맞는 사격계획표를 작성하는 것이다.

수치지형 자료의 모델링 및 지형분석 S/W의 개발 (Development of Terrain Analysis S/W for Military Use of DTM)

  • 문승환;최병규;황문호
    • 한국국방경영분석학회지
    • /
    • 제17권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.

  • PDF

포대의 적정배치 방안 (On an Optimal Artillery Deployment Plan)

  • 윤상윤;김성식
    • 한국국방경영분석학회지
    • /
    • 제8권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.

  • PDF

비계획 사격상황에서 적 위협 최소화를 위한 실시간 사격순서 결정 연구 (Real-time Algorithms to Minimize the Threatening Probability in a Fire Scheduling Problem for Unplanned Artillery Attack Operation)

  • 차영호;방준영;심상오
    • 경영과학
    • /
    • 제34권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.

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

  • 김동현;이영훈
    • 한국경영과학회지
    • /
    • 제35권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

개량고폭탄의 표적제압에 관한 연구 (A Study on the Target Coverage of the ICM)

  • 최광묵;민계료
    • 한국국방경영분석학회지
    • /
    • 제12권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.

  • PDF