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

Title
포병부대 사격순서결정을 위한 분지한계 알고리즘 연구
Other Titles
A Branch-and-Bound Algorithm on the Fire Sequencing for Planned Artillery Operations
Author(s)
윤상흠황원식[황원식]전재호[전재호]이익선[이익선]
Keywords
Fire Sequencing; Artillery Operations; Branch-and-Bound; Heuristic; Fire Sequencing; Artillery Operations; Branch-and-Bound; Heuristic
Issue Date
201009
Publisher
한국산업경영시스템학회
Citation
산업경영시스템학회지, v.33, no.3, pp.154 - 161
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.
URI
http://hdl.handle.net/YU.REPOSITORY/23541
ISSN
2005-0461
Appears in Collections:
경영대학 > 경영학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE