포병부대 사격순서결정을 위한 분지한계 알고리즘 연구

• 영문명: A Branch-and-Bound Algorithm on the Fire Sequencing for Planned Artillery Operations
• 발행기관: 한국산업경영시스템학회
• 저자명: 윤상흠(Sang Hum Yoon) 황원식(Won-Shik Hwang) 전재호(Jaeho Juhn) 이익선(Ik Sun Lee)
• 간행물 정보: 『산업경영시스템학회지』제33권 제3호, 154~161쪽, 전체 8쪽
• 주제분류: 경제경영 > 경영학
• 파일형태: PDF
• 발행일자: 2010.09.30

영문 초록

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.

목차

1. 서 론

2. 문제정의와 수리모형

3. 분지한계법(Branch-and-Bound Algorithm)

4. 성능 평가

5. 결 론

키워드

Fire Sequencing Artillery Operations Branch-and-Bound Heuristic