포병부대 사격순서결정을 위한 분지한계 알고리즘 연구
A Branch-and-Bound Algorithm on the Fire Sequencing for Planned Artillery Operations
0
조회
0
다운로드
4
인용
0
참고문헌
키워드
초록
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.
Abstract
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.
참고문헌 (9)
- 김태헌, "공유표적을 포함한 사격순서 결정에 관한 연구", 한국경영과학회지, 28(3), pp.123~134 (2003), 한국경영과학회
- 정금연, "화력계획 교리개선", 육군교육사령부 교리개선, ~ (2008)
- 황원식, "스케줄링을 이용한 계획표적 사격순서의 최적화 방안", 한국국방경영분석학회지, 33(1), pp.105~116 (2007), 한국국방경영분석학회
- 황원식, "포병부대 계획표적 사격시간 단축을 위한 표적할당에 관한 연구", 한국국방경영분석학회지, 36(1), pp.15~27 (2010), 한국국방경영분석학회
- Dobson,G, "Simultaneous Resource Scheduling to Minimize Weighted Flow Times", Operations Research, 37, pp.592~600 (1989)
- 권오정, "A Gentic Algorithm Approach to the Fire Sequencing Problem", 한국국방경영분석학회지, 29(2), pp.61~80 (2003), 한국국방경영분석학회
- Kwon,O.J, "Lagrangian Relaxation Approach to the Targeting Problem", Naval Research Logistics, 46, pp.640~653 (1999)
- Kwon,O.J, "Targering and Scheduling Problem for Field Artillery", Computers and Industrial Engineering, 33, pp.693~696 (1997)
- Lee K.S, "Complexity of the Fire Sequencing Problem", International Journal of Management Science, 5, pp.55~59 (1999)