Iranian Journal of Operations Research
مجله انجمن ایرانی تحقیق در عملیات
IJOR
Basic Sciences
http://iors.ir/journal
0
user
2008-1189
10.29252/iors
en
jalali
1394
6
1
gregorian
2015
9
1
6
2
online
1
fulltext
en
Weapon scheduling in naval combat systems for maximization of defense capabilities
Production/Inventory
Production/Inventory
پژوهشی
Original
<p dir="ltr" style="text-align: justify;"><strong><em>Air defense is a crucial area for all naval combat systems. In this study, we consider a warship equipped with an air-defense weapon that targets incoming threats using surface-to-air missiles. We define the weapon scheduling problem as the optimal scheduling of a set of surface-to-air missiles of a warship to a set of attacking air threats. The optimal scheduling of the weapon results in an increase in the probability of successful targeting of all incoming threats. We develop a heuristic method to obtain a very fast and acceptable solution for the problem. In addition, a branch and bound algorithm is developed to find the optimal solution. In order to increase the efficiency of this algorithm, a lower bound, an upper bound and a set of dominance rules have been developed. Using randomly generated test problems, the performance of the proposed solution approaches is analyzed. The results indicate that in all practical situations, the branch-and-bound algorithm is able to solve the problem optimally in less than a second.</em></strong></p>
Weapon scheduling problem, naval combat systems, branch and bound algorithm
87
99
http://iors.ir/journal/browse.php?a_code=A-10-714-1&slc_lang=en&sid=1
Raheleh
Taghavi
ra.taghavi@yahoo.com
`00031947532846001514`

00031947532846001514
No
Ferdowsi University of Mashhad
Mohammad
Ranjbar
m_ranjbar@um.ac.ir
`00031947532846001515`

00031947532846001515
Yes
Ferdowsi University of Mashhad