• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• 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.

• 한국국방경영분석학회지
• /
• 제30권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.

• 한국국방경영분석학회지
• /
• 제34권2호
• /
• pp.143-162
• /
• 2008

이 연구는 현재 개발이 진행 중인 장갑차량 상부 공격용 지능형 탄약을 포함한 155mm 포병 탄약의 전시소요량을 산정하는 방법론을 정립하려는 것이다. 종래의 워게임 시뮬레이션에 의한 방법에서는 장갑표적 공격용 무기체계별 기대점유비율이 지상군 및 공군간에 과도하게 차이가 발생하고 있다. 또한 상향식 소요산정방법은 최소소요량에 비하여 너무나 과도하게 산출하는 경향이 있으므로 이러한 점들을 보완하기 위하여 표적 수량에 따른 무기체계별 할당에 의한 하향식 모형을 구성한 것이다. 이모형이 워게임에 의한 상향식 소요산정보다는 더 믿을 만한 결과를 산출한다.

• 한국군사과학기술학회지
• /
• 제13권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.

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

• 한국경영과학회지
• /
• 제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

• 한국국방경영분석학회지
• /
• 제13권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.

• 한국항해항만학회지
• /
• 제28권1호
• /
• pp.83-90
• /
• 2004

경비, 훈련, 지원 등의 해상 임무를 종료한 해군 함정은 차기 임무를 준비하기 위해 모항에 입항하여 긴급수리, 유류수급, 무장 적하역, 크레인, 태세유지, 수리, 포 배열, 탄약적재, 부식 작업 등의 일련의 서비스를 필요로 한다. 본 연구에서는 한정된 선석과 설비 자원 하에서 여러 함정에 대한 효율적인 선석 할당 계획의 수립을 목적으로 한다. 이를 위해 불필요한 선석이동을 줄이고 계획기간 동안 각 함정이 필요로 차는 서비스를 점수화한 총점을 최대화하는 기존의 모형을 토대로, 서비스 지속 기간이 제한적이고 서비스들 간의 전후 우선순위가 존재하는 현실적인 제약을 고려하면서 전비태세를 향상시킬 수 있는 혼합 정수 계획 모형(Mixed Integer Programming)을 수립해 보았다. 효과적인 분석을 위하여 ILOG OPL(Optimization Programming Language) Studio 3.1을 사용하여 모델링 한 후 ILOG CPLEX 7.0으로 최적해를 구해 보았다. 본 연구에서 제시한 모형이 해군 함정의 효율전인 선석 할당 계획 수립에 적용될 수 있다면 해군 부대의 전비태세 향상에 기여를 할 수 있을 것으로 생각된다.