[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
:: Volume 6, Issue 2 (9-2015) ::
IJOR 2015, 6(2): 87-99 Back to browse issues page
Weapon scheduling in naval combat systems for maximization of defense capabilities
Raheleh Taghavi Msr., Mohammad Ranjbar Dr.
Ferdowsi University of Mashhad , m_ranjbar@um.ac.ir
Abstract:   (2581 Views)

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.

Keywords: Weapon scheduling problem, naval combat systems, branch and bound algorithm
Full-Text [PDF 741 kb]   (1171 Downloads)    
Type of Study: Original | Subject: Production/Inventory
Received: 2016/04/15 | Accepted: 2016/07/23 | Published: 2017/08/4
Send email to the article author

Add your comments about this article
Your username or Email:


XML     Print

Volume 6, Issue 2 (9-2015) Back to browse issues page
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.05 seconds with 31 queries by YEKTAWEB 3815