[صفحه اصلی ]   [Archive]  
:: صفحه اصلي :: درباره نشريه :: آخرين شماره :: تمام شماره‌ها :: جستجو :: ثبت نام :: ارسال مقاله :: تماس با ما ::
:: جلد 6، شماره 2 - ( 6-1394 ) ::
جلد 6 شماره 2 صفحات 87-99 برگشت به فهرست نسخه ها
Weapon scheduling in naval combat systems for maximization of defense capabilities
چکیده:   (1010 مشاهده)

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.

متن کامل [PDF 741 kb]   (271 دریافت)    
نوع مطالعه: پژوهشی | موضوع مقاله: Production/Inventory
دریافت: ۱۳۹۵/۱/۲۷ | پذیرش: ۱۳۹۵/۵/۲ | انتشار: ۱۳۹۶/۵/۱۳
ارسال نظر درباره این مقاله
نام کاربری یا پست الکترونیک شما:

کد امنیتی را در کادر بنویسید >



XML   English Abstract   Print


جلد 6، شماره 2 - ( 6-1394 ) برگشت به فهرست نسخه ها
مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.048 seconds with 793 queries by yektaweb 3503