• Title/Summary/Keyword: Ammunition allocation

Search Result 8, Processing Time 0.028 seconds

Ammunition Allocation Model using an Interactive Multi-objective Optimization(MOO) Method (상호작용 다목적 최적화 방법론을 이용한 전시 탄약 할당 모형)

  • Jeong, Min-Seop;Park, Myeong-Seop
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.513-524
    • /
    • 2006
  • The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.

  • PDF

A Study on Ammunition Resupply Allocation Model (전시탄약 재보급 할당에 관한 연구)

  • Lee Young-Shin
    • Journal of the military operations research society of Korea
    • /
    • v.30 no.2
    • /
    • pp.133-140
    • /
    • 2004
  • In this paper, with the limited range of ammunition supply point(ASP) at ammunition battalion in specific corps and light automobile battalion(LAB) directly supports its vehicle for ammunition supply, we propose optimal model to minimize transportation time and logistics cost using integer programming(IP) for efficient ammunition resupply allocation during a given operation period of front combat unit. And then, we consider ammunition treatment and supply capacity of ammunition supply point(ASP), constraint elements of transportation ability considering time and cost, ammunition storage capacity of combat unit, combat situation and unit mission to propose this model. Finally, through numerical example, we examine the applicable feasibility of proposed model.

Study of Estimation Model for Wartime Stockpile Requirement of Intelligent Ammunition against Enemy Armored Vehicles (장갑차량 공격용 지능형 포탄의 전시 소요량 산정 모형에 관한 연구)

  • Cho, Hong-Yong;Chung, Byeong-Hee
    • Journal of the military operations research society of Korea
    • /
    • v.34 no.2
    • /
    • pp.143-162
    • /
    • 2008
  • This paper aims to formulate the method of estimating the wartime stockpile requirement of 155mm self-propelled artillery including intelligent ammunition for armored vehicles, currently being developed. The usual method of utilizing war-game simulation results in considerable margins in expected occupancy ratio between ground forces and air forces for each weapon system for armored vehicles. Also, the method tends to produce excessive output greater than the minimal stockpile requirements; therefore, the study aims to overcome limitations like these by the allocation method for each weapon system according to targets. This allocation method is better than war-game simulation method.

The Berth Allocation Method for the Navy Surface Vessels Considering Uncertainty (불확실성을 고려한 해군함정 선석 할당 방안)

  • Jung, Whan-Sik;Lee, Jae-Yeong;Lee, Yong-Dae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.5
    • /
    • pp.748-758
    • /
    • 2010
  • Navy surface vessels require pier services such as emergency repair, oil supply, arm loading/unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services and the uncertainty of the arrival and departure for each vessel. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 6.0 and ILOG CPLEX 11.1., which shows a reasonable result.

A Study on Berth Allocation for Navy Surface Vessel Considering Precedence Relationship among Services (서비스 전후 우선순위를 고려한 해군함정의 부두 할당에 관한 연구)

  • 정환식;김승권
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.350-353
    • /
    • 2003
  • Navy surface vessels require pier services such as emergency repair, oil supply, fm loading/unloading, crane, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. The study suggests Mixed Integer Programing (MIP) model for bath allocation problem, considering precedence relationships among services. For a effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG Cplex 7.0. The results of the model show reduction of berth shifts and increasement of service benefits. And thus, it would be a possibility of contribution in the improvement of fleet readiness.

  • PDF

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

A Study on Model for Target Assignment and Gun Ammunition Required for Naval Surface Warfar (수상전에서의 표적할당 및 포탄소요양 결정모형)

  • Min Gye-Ryo;Kim Heung-Man
    • 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.

  • PDF

A Study on Berth Allocation for Navy Surface Vessels Considering Precedence Relationships among Services (서비스 전후 우선순위를 고려한 해군함정의 선석 할당에 관한 연구)

  • Jung, Whan-Sik;Kim, Jae-Hee;Kim, Sheung-Kwon
    • Journal of Navigation and Port Research
    • /
    • v.28 no.1
    • /
    • pp.83-90
    • /
    • 2004
  • Navy surface vessels require pier services such as emergency repair, oil supply, arm loading / unloading, craning, standby readiness, normal repair, gun arrangement, ammunition loading, and food loading during the period in port. The purpose of this study is to establish efficient berth allocation plan for navy surface vessels in home port under the limited resources of piers and equipments. This study suggests Mixed Integer Programming model for berth allocation problem, considering precedence relationships among services. For an effective analysis, the model is implemented by ILOG OPL(Optimization Programming Language) Studio 3.1 and ILOG CPLEX 7.0. The results of the model show reduction of berth shifts and increasement of service benefits.