Heuristic for the Simultaneous Target Allocation and Fire Sequencing Problem

표적 할당과 사격 순서의 동시 결정 문제를 위한 발견적 기법

  • 김동현 (연세대학교 정보산업공학과) ;
  • 이영훈 (연세대학교 정보산업공학과)
  • Received : 2009.09.11
  • Accepted : 2009.12.31
  • Published : 2010.03.31

Abstract

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

Keywords

References

  1. 육군본부, 포병운용, FM 2-2, 2002.
  2. 육군본부, 화력운용, FM 3-10, 2008.
  3. 육군본부, 화력실무운용, RM 32-0-47, 2004.
  4. 김기호, "포병부대 계획표적 사격 순서 결정에 관한 연구", 고려대학교 논문, 2002.
  5. 김태헌, 이영훈, "공유표적을 포함한 사격 순서 결정에 관한 연구", 한국경영과학회지, 제28호, 제3호(2003), pp.123-134.
  6. 황원식, 이재영, "스케줄링을 이용한 계획표적 사격 순서의 최적화에 관한 연구", 한국국방경영분석학회지, 제33권, 제1호(2007), pp.105-115.
  7. Fowler, J.W., "Scheduling of unrelated parallel machines an application to PWB manufacturing," IIE Transactions, Vol.34(2002), pp. 921-931.
  8. Hariri, A.M.A. and C.N. Potts, "Heuristic for scheduling unrelated parallel machines," Computers and Operations Research, Vol.18, No.3 (1991), pp.323-331. https://doi.org/10.1016/0305-0548(91)90034-O
  9. Kwon, O.J., D.H. Kang, K.S. Lee, and S.S. Park, "Targeting and Scheduling Problem for Field Artillery," Computers and Industrial Engineering, Vol.33(1997), pp.693-696. https://doi.org/10.1016/S0360-8352(97)00224-6
  10. Martello, S., F. Soumis, and P. Toth, "Exact and approximation algorithms for makespan minimization on unrelated parallel machines," Discrete Applied Mathematics, Vol.75(1977), pp.169-188.
  11. Plekar, U.S., N. Rama, and K. Toaffe, "Duality based relaxations for makespan minimization for unrelated parallel machines," TIME/ORSA Bullutin, Vol.31, No.21(1991).
  12. Sundararaghavan, P. and M. Ahmed, "Single machine scheduling with start time dependent processing times," European Journal of Operational Research, Vol.78, No.3(1994), pp. 394-403. https://doi.org/10.1016/0377-2217(94)90048-5